{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:47Z","timestamp":1725664247331},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583387"},{"type":"electronic","value":"9783540486633"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58338-6_79","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:50:37Z","timestamp":1330253437000},"page":"326-335","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A comparison of two lower bound methods for communication complexity"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juraj","family":"Hromkovi\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abelson, H., Lower Bounds on Information Transfer in Distributed Computations, Proc. 19tfh IEEE Symp. on Foundations of Computer Science, 1978, pp. 151\u2013158.","key":"25_CR1","DOI":"10.1109\/SFCS.1978.22"},{"doi-asserted-by":"crossref","unstructured":"Aho, A.V., Ullman, J.D., Yannakakis, M., On notions of informations transfer in VLSI circuits. Proc. 15th ACM STOC, 1983, pp. 133\u2013139.","key":"25_CR2","DOI":"10.1145\/800061.808742"},{"unstructured":"Bollobas, B., Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability, Cambridge University Press, 1986, pp. 74\u201375.","key":"25_CR3"},{"unstructured":"H\u00fchne, M.: personal communication.","key":"25_CR4"},{"unstructured":"Koml\u00f3s, J.: On the determinant of (0,1)-matrices, Studia. Sci. Math Hungar. 2, 7\u201321.","key":"25_CR5"},{"unstructured":"Koml\u00f3s, J.: On the determinant of random matrices. Studia. Sci. Math. Hungar. 3, 387\u2013399.","key":"25_CR6"},{"doi-asserted-by":"crossref","unstructured":"Lengauer, Th.: VLSI Theory, In: Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity (Jan van Leeuwen, Ed.), Elsevier, 1990 pp. 835\u2013868.","key":"25_CR7","DOI":"10.1016\/B978-0-444-88071-0.50021-7"},{"key":"25_CR8","first-page":"384","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional cover. Discrete Mathematic 13(1975), 384\u2013390.","journal-title":"Discrete Mathematic"},{"unstructured":"Lov\u00e1sz, L., Communication Complexity: A Survey, Paths, Flows, and VLSI-Layout (B.Korte et al. Eds.), Springer-Verlag 1990, pp. 235\u2013265.","key":"25_CR9"},{"doi-asserted-by":"crossref","unstructured":"Mehlhorn, K. and Schmidt, E., Las Vegas is better than determinism in VLSI and distributed computing. Proc. 14th Annual ACM Symposium on Theory of Computing, San Francisco, 1982, pp. 330\u2013337.","key":"25_CR10","DOI":"10.1145\/800070.802208"},{"key":"25_CR11","first-page":"16","volume-title":"Complexity in Information Theory","author":"A. Orlitsky","year":"1988","unstructured":"Orlitsky, A., El Gamal, A.: Communication Complexity, In: Complexity in Information Theory (Yaser S. Abu-Mustafa, Ed.), Springer-Verlag, New York 1988, 16\u201361."},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C., Some complexity questions related to distributive computing, 11th ACM Symposium on Theory of Computing, 1979, pp. 209\u2013213.","key":"25_CR12","DOI":"10.1145\/800135.804414"},{"doi-asserted-by":"crossref","unstructured":"Yao, A.C., The entropic limitations on VLSI computations, 13th ACM Symposium on Theory of Computing, 1981, pp. 308\u2013311.","key":"25_CR13","DOI":"10.1145\/800076.802483"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1994"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58338-6_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:16:19Z","timestamp":1578510979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58338-6_79"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583387","9783540486633"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58338-6_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}