{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:15Z","timestamp":1725662895249},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_21","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:02:24Z","timestamp":1330192944000},"page":"235-246","source":"Crossref","is-referenced-by-count":2,"title":["Communication complexity"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Abelson, Lower bounds on information transfer in distributed computations. Proc. of the 19-th Annual Symposium on Foundations of Computer Science, 1978.","DOI":"10.1109\/SFCS.1978.22"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Lipton and Sedgewick, Lower bounds for VLSI. Proc. of the 13-th Symposium on Theory of Computing, 1981, 300\u2013307.","DOI":"10.1145\/800076.802482"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Melhorn and Schmidt, Las Vegas is better than determinism in VLSI and distributed computing. Proc. of the 14-th Annual Symposium on Theory of Computing, 1982, 330\u2013337.","DOI":"10.1145\/800070.802208"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Papadimitriou and Sipser, Communication Complexity. Proc. of the 23-th Annual Symposium on Foundations of Computer Science, 1982, 189\u2013195.","DOI":"10.1145\/800070.802192"},{"key":"21_CR5","unstructured":"Savage, Area \u2014 time tradeoffs for matrix multiplication and related problems in VLSI models. Proc. of the Allerton Conference, 1979."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Thompson, Area-time complexity of VLSI. Proc. of the 11-th Annual Symposium on Theory of Computing, 1979, 81\u201388.","DOI":"10.1145\/800135.804401"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Vuillemin, A combinatorial limit on the computational power of VLSI circuits. Proc. of the 11-th Annual Symposium on Foundations of Computer Science, 1980, 294\u2013300.","DOI":"10.1109\/SFCS.1980.1"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Yao, Some complexity questions related to distributive computing. Proc. of the 11-th Annual Symposium on Theory of Computing, 1979, 209\u2013311.","DOI":"10.1145\/800135.804414"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Yao, The entropic limitations on VLSI computations. Proc. of the 13-th Annual Symposium on Theory of Computing, 1981, 308\u2013311.","DOI":"10.1145\/800076.802483"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:14Z","timestamp":1605643634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}