{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:07Z","timestamp":1725663547977},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540564027"},{"type":"electronic","value":"9783540475545"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56402-0_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:10:32Z","timestamp":1330254632000},"page":"70-77","source":"Crossref","is-referenced-by-count":0,"title":["Topology of parallel networks and computational complexity (extended abstract)"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"8_CR1","first-page":"85","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon: Eigenvalues and expanders. Combinatorica 6 (1986), 85\u201395.","journal-title":"Combinatorica"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"A. V. Aho-J. D. Ullman-M. Yanakakis: On notion of information transfer in VLSI circuits. In: Proc. 15th ACM STOC, Assoc. Comput. Mach. 1983, 133\u2013139.","DOI":"10.1145\/800061.808742"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"A. Broder \u2014 E. Shamir: On the second eigenvalue of random regular graphs. In: Proc. 28th Annual Symp. on FOCS, IEEE 1987, 286\u2013294.","DOI":"10.1109\/SFCS.1987.45"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"X. Gub\u00e1s, J. Hromkovi\u010d, J. Waczul\u00edk: A nonlinear lower bound on the practical combinational complexity. In: Proc. STACS '92, Lecture Notes in Computer Science 577, Springer-Verlag 1992, 281\u2013292.","DOI":"10.1007\/3-540-55210-3_191"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(88)90165-X","volume":"57","author":"J. Hromkovi\u010d","year":"1988","unstructured":"J. Hromkovi\u010d: The advantages of a new approach to defining the communication complexity for VLSI. Theoret. Comput. Sci 57 (1988), 97\u2013111.","journal-title":"Theoret. Comput. Sci"},{"issue":"3","key":"8_CR6","first-page":"229","volume":"7","author":"J. Hromkovi\u010d","year":"1988","unstructured":"J. Hromkovi\u010d: Some complexity aspects of VLSI computations. Part 1. A framework for the study of information transfer in VLSI circuits. Comput. Artificial Intelligence 7(3) (1988), 229\u2013252.","journal-title":"Comput. Artificial Intelligence"},{"issue":"No.3","key":"8_CR7","first-page":"209","volume":"8","author":"J. Hromkovi\u010d","year":"1989","unstructured":"J. Hromkovi\u010d: Some complexity aspects of VLSI computations. Part 6. Communication complexity. Computers AI 8 (1989), No. 3, 209\u2013225.","journal-title":"Computers AI"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d: Nonlinear lower bounds in the number of processors of circuits with sublinear separators. In: Proc. FCT '91, Lecture Notes on Computer Science 529, Springer-Verlag 1991, 240\u2013247 (also: Information and Computation 95 (1991), 117\u2013128).","DOI":"10.1007\/3-540-54458-5_68"},{"issue":"No.4","key":"8_CR9","first-page":"157","volume":"25","author":"G. Kumi\u010d\u00e1kov\u00e1-Jir\u00e1skov\u00e1","year":"1989","unstructured":"G. Kumi\u010d\u00e1kov\u00e1-Jir\u00e1skov\u00e1: Chomsky hierarchy and communication complexity. Inf. Process. Cybern. EIK 25 (1989), No. 4, 157\u2013164.","journal-title":"Inf. Process. Cybern. EIK"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","volume":"28","author":"C. Papadimitriou","year":"1984","unstructured":"Ch. Papadimitriou-M. Sipser: Communication complexity. J. Comp. Syst. Sci 28 (1984), 260\u2013269.","journal-title":"J. Comp. Syst. Sci"},{"key":"8_CR11","unstructured":"J. Ullman: Computational Aspects of VLSI. Principles of Computer Science Series. Comput. Sci Press, Rochville, MD 1984."},{"key":"8_CR12","first-page":"308","volume-title":"Proc. 13th Annual ACM STOC","author":"A.C. Yao","year":"1981","unstructured":"A.C. Yao: The entropic limitation of VLSI computations. In: Proc. 13th Annual ACM STOC, Assoc. Comput. Math., New York 1981, 308\u2013311."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56402-0_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:43Z","timestamp":1605647023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56402-0_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540564027","9783540475545"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56402-0_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}