Theoretical Aspects of VLSI Pin Limitations
- 1 April 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (2) , 356-378
- https://doi.org/10.1137/0222027
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Compressions and isoperimetric inequalitiesJournal of Combinatorial Theory, Series A, 1991
- An Isoperimetric Inequality on the Discrete TorusSIAM Journal on Discrete Mathematics, 1990
- Interconnection networks: Physical design andperformance analysisJournal of Parallel and Distributed Computing, 1986
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- Evaluation of cube and data manipulator networksJournal of Parallel and Distributed Computing, 1985
- The VLSI optimality of the aks sorting networkInformation Processing Letters, 1985
- Sorting inc logn parallel stepsCombinatorica, 1983
- Pin Limitations and Partitioning of VLSI Interconnection NetworksIEEE Transactions on Computers, 1982
- A Self-Routing Benes Network and Parallel Permutation AlgorithmsIEEE Transactions on Computers, 1981
- A note on the edges of the n-cubeDiscrete Mathematics, 1976