This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Preparata FP. VLSI computation. In: Encyclopedia of parallel computing. Springer
Thompson CD (1980) A complexity theory for VLSI. Ph.D. thesis, Tech. Rep. CMUCS- 80–140, Dept. of Computer Science, Carnegie-Mellon University, Pittsburgh
Chazelle B, Monier L (1981) A model of computation for VLSI with related complexity results. In: Proceedings of the 13th ACM symposium on theory of computing, Milwaukee, pp 318–325
Bilardi G, Pracchi M, Preparata FP (1982) A critique of network speed in VLSI models of computation. IEEE J Solid-St Circ SC-17(4):696–702
Bilardi G, Preparata FP (1995) Horizons of parallel computation. J Parallel Distr Com 27(2):172–182
Bhatt SN, Leighton FT (1984) A framework for solving VLSI graph layout problems. J Comput Syst Sci 28:300–343
Bilardi G, Bay PE (1994) An area lower bound for a class of fat-trees. In: Proceedings of the second European symposium on algorithms, Utrecht, pp 413–423
Leiserson CE (1985) Fat-trees: universal networks for hardware-efficient supercomputing. IEEE T Comput C-34(10):892–900
Greenberg RI, Leiserson CE (1989) Randomized routing on fat-trees. In: Micali S (ed) Randomness and computation. JAI Press, Greenwich, pp 345–374
Leighton FT, Maggs BM, Ranade AG, Rao S (1994) Randomized routing and sorting on fixed-connection networks. J Algorithm 17(1):157–205
Bay PE, Bilardi G (1995) Deterministic on-line routing on area-universal networks. J ACM 42(3):614–640
Greenberg RI (1994) The fat-pyramid and universal parallel computation independent of wire delay. IEEE T Comput 43(12): 1358–1364
Bay PE, Bilardi G (1993) An area-universal VLSI circuit. In: Proceedings of the 1993 symposium on integrated systems, Seattle, pp 53–67
Bilardi G, Chaudhuri S, Dubhashi DP, Mehlhorn K (1994) A lower bound for area-universal graphs. Inform Process Lett 51(2): 101–105
Bhatt SN, Bilardi G, Pucci G (2008) Area-time tradeoffs for universal VLSI circuits. Theor Comput Sci 408(2–3):143–150
Kaklamanis C, Krizanc D, Rao S (1993) Universal emulations with sublogarithmic slowdown. In: Proceedings of the 34th IEEE symposium on foundations of computer science, Palo Alto, pp 341–350
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Bilardi, G., Pucci, G. (2011). Universality in VLSI Computation. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_219
Download citation
DOI: https://doi.org/10.1007/978-0-387-09766-4_219
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09765-7
Online ISBN: 978-0-387-09766-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering