Recent results in VLSI CAD at MIT

Authors:
Richard E. Zippel;Paul Penfield, Jr.;Lance A. Glasser;Charles E. Leiserson;John L. Wyatt, Jr.;F. Thomson Leighton;Jonathan Allen
Affiliations:
Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA;Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA
Venue:
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Year:
1986

The bounding approach to VLSI circuit simulation

The bounding approach to VLSI circuit simulation
Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algorithms for routing and testing routability of planar VLSI layouts

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
EXCL: A circuit extractor for IC designs

DAC '84 Proceedings of the 21st Design Automation Conference
A “greedy” channel router

DAC '82 Proceedings of the 19th Design Automation Conference
The “PI” (placement and interconnect) system

DAC '82 Proceedings of the 19th Design Automation Conference
Macromodeling and Optimization of Digital MOS VLSI Circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Hi-index	0.00