Solving Undirected Graph Problems on VLSI
- 1 August 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (3) , 527-544
- https://doi.org/10.1137/0214040
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Information Transfer in Distributed Computing with Applications to VLSIJournal of the ACM, 1984
- Efficient VLSI Networks for Parallel Processing Based on Orthogonal TreesIEEE Transactions on Computers, 1983
- VLSI Algorithms for the Connected Component ProblemSIAM Journal on Computing, 1983
- A Combinatorial Limit to the Computing Power of VLSI CircuitsIEEE Transactions on Computers, 1983
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Information transfer and area-time tradeoffs for VLSI multiplicationCommunications of the ACM, 1980
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- Guarded commands, nondeterminacy and formal derivation of programsCommunications of the ACM, 1975