AREA-EFFICIENT GRAPH LAYOUTS (FOR VLSI).

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1980, Pages 270-281

  Leiserson, Charles E ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS;

INTEGRATED CIRCUITS;

EID: 0019264022     PISSN: 02725428     EISSN: None     Source Type: None    
DOI: 10.1109/SFCS.1980.13     Document Type: Conference Paper

References (24)

1. A. V. Aho J. E. Hopcroft J. D. Ulimart The Design and Analysis of Computer Algorithms 1974 Addison-Wesley Massachusetts, Reading
2. M. O. Albertson J. P. Hutchinson On the independence ratio of a graph Journal of Graph Theory 2 1 8 1978
3. J. L. Bentley D. Haken J. B. Saxe A general method for solving divide-and-conquer recurrences December 1978 CMU-CS-78-154 Department of Computer Science, Carnegie-Mellon University
4. R. P. Brent H. T. Kung Fast algorithms for manipulating formal power series JACM 25 581 595 October 1978
5. R. P. Brent H. T. Kung On the area of binary tree layouts July 1979 TR-CS-79-07 The Australian National University, Department of Computer Science
6. M. R. Garey D. S. Johnson L. Stockmeyer Some simplified polynomial complete problems 6th Annual Symposium on Theory of Computing 47 63 6th Annual Symposium on Theory of Computing 1974-April
7. T.. Günther Die raumliche anordnung von einheiten mit wechselbeziehungen Elektronische Datenverarbeitung 209 212 May 1969
8. D. Hoey C. E Leiserson A layout for the shuffleexchange network 1980 International Conference on Parallel Processing 1980 International Conference on Parallel Processing 1980-August
9. D. Johannsen Bristle blocks: a silicon compiler Caltech Conference on Very Large Scale Integration 303 310 Caltech Conference on Very Large Scale Integration 1979-January
10. B. W. Kcniighan S. Lin An effective heuristic procedure for partitioning graphs Bell Systems Technical Journal 49 291 308 February 1970
11. C. Y. Lee An algorithm for path connection and its application IRE Transactions on Electronic Conputers EC-10 3 346 365 September 1961
12. P. M. Lewis R. E. Stearns J. Hartmanis Menory bounds for recognition of context-free and context-sensitive languages IEEE Symposium on Switching Circuit Theory and Logical Design IEEE Symposium on Switching Circuit Theory and Logical Design 1965
13. R. J. Lipton R. E. Taijan A separator theorem for planar graphs A Conference on Theoretical Computer Science A Conference on Theoretical Computer Science 1977-August
14. R. I. Mattison A high quality, low cost router for MOS/LS1 Proceedings of the ACM-IEEE Design Automation Workshop 94 103 Proceedings of the ACM-IEEE Design Automation Workshop Dallas Texas 1972-June
15. C. A. Mead L. A. Conway Introduction to VLSI Systems 1980 Addison-Wesley Massachusetts, Reading
16. C. Mead M. Rem Cost and performance of VLSI computing structures IEEE Journal of Solid Stale Circuits SC-14 2 455 462 April 1979
17. F. P. Preparata J. Vuillemin The cube-connectedcycles: a versatile network for parallel computation June 1979 356 Institut de Recherche d'lnformatique et d'Automatique
18. C. H. Sequin A. M. Despain D. A. Patterson Communication in X-tree, a modular multiprocessor system ACM 78 Proceedings ACM 78 Proceedings 1978
19. S Harold Parallel processing with the perfect shuffle IEEE Transactions on Computers C-20 2 153 161 February 1971
20. I. E Sutherland D. Oestreicher How big should a printed circuit board be? IEEE Transactions on Computers C-22 537 542 May 1973
21. R. E. Tarjan Efficiency of a good but not linear set union algorithm JACM 25 2 215 225 1975
22. C. D. Thompson A Complexity Theory for VLSI 1930 Carnegie-Mellon University