{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T19:26:14Z","timestamp":1778700374031,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6102,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,11]]},"DOI":"10.1016\/s0304-3975(96)00062-x","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"39-51","source":"Crossref","is-referenced-by-count":28,"title":["A comparison of two lower-bound methods for communication complexity"],"prefix":"10.1016","volume":"168","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":"78","reference":[{"key":"10.1016\/S0304-3975(96)00062-X_BIB1","series-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science","first-page":"151","article-title":"Lower bounds on information transfer in distributed computations","author":"Abelson","year":"1978"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB2","series-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB3","series-title":"Geometric Algebra","author":"Artin","year":"1957"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB4","series-title":"Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability","author":"Bollobas","year":"1986"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB5","unstructured":"M. H\u00fchne, personal communication."},{"key":"10.1016\/S0304-3975(96)00062-X_BIB6","series-title":"Proc. 7th IEEE Conference on Structure in Complexity Theory","first-page":"262","article-title":"Fractional covers and communication complexity","author":"Karchmer","year":"1992"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB7","first-page":"7","article-title":"On the determinant of (0, 1)-matrices","volume":"2","author":"Koml\u00f3s","year":"1965","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/S0304-3975(96)00062-X_BIB8","first-page":"387","article-title":"On the determinant of random matrices","volume":"3","author":"Koml\u00f3s","year":"1968","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/S0304-3975(96)00062-X_BIB9","first-page":"835","article-title":"VLSI theory","author":"Lengauer","year":"1990"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB10","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(96)00062-X_BIB11","series-title":"Paths, Flows, and VLSI-Layout","first-page":"235","article-title":"Communication complexity: a survey","author":"Lov\u00e1sz","year":"1990"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB12","series-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing","first-page":"330","article-title":"Las Vegas is better than determinism in VLSI and distributed computing","author":"Mehlhorn","year":"1982"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB13","series-title":"Complexity in Information Theory","first-page":"16","article-title":"Communication complexity","author":"Orlitsky","year":"1988"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB14","series-title":"Proc. 34th IEEE Symp. on Foundations of Computer Science","first-page":"168","article-title":"On the \u201clog rank\u201d-conjecture in communication complexity","author":"Raz","year":"1993"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB15","series-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979"},{"key":"10.1016\/S0304-3975(96)00062-X_BIB16","series-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing","first-page":"308","article-title":"The entropic limitations on VLSI computations","author":"Yao","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600062X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759600062X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:56:15Z","timestamp":1555376175000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759600062X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S030439759600062X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00062-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}