{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:53:52Z","timestamp":1775282032623,"version":"3.50.1"},"reference-count":38,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"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":7229,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0022-0000(93)90035-u","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"322-349","source":"Crossref","is-referenced-by-count":33,"title":["Communication complexity and combinatorial lattice theory"],"prefix":"10.1016","volume":"47","author":[{"given":"L\u00e1szl\u00f3","family":"Lov\u0103sz","sequence":"first","affiliation":[]},{"given":"Michael","family":"Saks","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90035-U_BIB1_1","series-title":"Proceedings, 19th IEEE Symp. on Foundations of Computer Science","first-page":"151","article-title":"Lower bounds on information transfer in distributed computing","author":"Abelson","year":"1978"},{"key":"10.1016\/0022-0000(93)90035-U_BIB1_2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/322186.322200","volume":"27","author":"Abelson","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90035-U_BIB2","series-title":"Proceedings, 15th ACM Symposium on Theory of Computing","first-page":"133","article-title":"On the notions of information transfer in VLSI circuits","author":"Aho","year":"1983"},{"key":"10.1016\/0022-0000(93)90035-U_BIB3","series-title":"Proceedings, 26th IEEE Symp. on Foundations of Computer Science","first-page":"277","article-title":"Geometric realizations of set systems and probabilistic communication complexity","author":"Alon","year":"1985"},{"key":"10.1016\/0022-0000(93)90035-U_BIB4","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1002\/jgt.3190130413","article-title":"A counterexample to the rank-coloring conjecture","volume":"13","author":"Alon","year":"1989","journal-title":"J. Graph. Theory"},{"key":"10.1016\/0022-0000(93)90035-U_BIB5","series-title":"Proceedings, 27th IEEE Symp. on Foundations of Computer Science","first-page":"337","article-title":"Complexity classes in communication complexity theory","author":"Babai","year":"1986"},{"key":"10.1016\/0022-0000(93)90035-U_BIB6","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0021-9800(67)80051-6","article-title":"A higher invariant for matroids","volume":"2","author":"Crapo","year":"1967","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0022-0000(93)90035-U_BIB7","first-page":"504","article-title":"Whitney number inequalities for geometric lattices","volume":"47","author":"Dowling","year":"1975"},{"key":"10.1016\/0022-0000(93)90035-U_BIB8_1","series-title":"Proceedings, 16th ACM Symposium on Theory of Computing","first-page":"81","article-title":"Lower bounds on communication complexity","author":"Duris","year":"1984"},{"key":"10.1016\/0022-0000(93)90035-U_BIB8_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90037-X","volume":"73","author":"Duris","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0022-0000(93)90035-U_BIB9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF00149365","article-title":"The theory of convex geometries","volume":"19","author":"Edelman","year":"1985","journal-title":"Geom. Dedicata"},{"key":"10.1016\/0022-0000(93)90035-U_BIB10","first-page":"189","article-title":"On conjectures of Gaffiti, II","volume":"60","author":"Fajtlowicz","year":"1987"},{"key":"10.1016\/0022-0000(93)90035-U_BIB11","series-title":"Information Theory and Reliable Communication","author":"Gallagher","year":"1968"},{"key":"10.1016\/0022-0000(93)90035-U_BIB12","series-title":"Ordered Sets","first-page":"583","article-title":"The Mobius function of a partially ordered set","author":"Greene","year":"1982"},{"key":"10.1016\/0022-0000(93)90035-U_BIB13","series-title":"Proceedings, 20th ACM Symp. on Theory of Computing","first-page":"162","article-title":"On different modes of communication","author":"Halstehberg","year":"1988"},{"key":"10.1016\/0022-0000(93)90035-U_BIB14","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1137\/0214040","article-title":"Solving undirected graph problems on VLSI","volume":"14","author":"Hambrusch","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90035-U_BIB15","series-title":"Proceedings, 20th ACM Symp. on Theory of Computing","first-page":"186","article-title":"On the communication complexity of graph properties","author":"Hajnal","year":"1988"},{"key":"10.1016\/0022-0000(93)90035-U_BIB16","first-page":"284","article-title":"Binding constraints and helly numbers","volume":"319","author":"Hoffman","year":"1979"},{"key":"10.1016\/0022-0000(93)90035-U_BIB17","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/62.70","article-title":"The VLSI complexity of selected graph problems","volume":"31","author":"Ja'Ja'","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90035-U_BIB18","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/0213052","article-title":"Information transfer under different sets of protocols","volume":"13","author":"Ja'Ja'","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90035-U_BIB19","series-title":"Graph Theory and Combinatorics, Proceedings of the Cambridge Combinatorial Conference in honor of Paul Erd\u00f6s","first-page":"217","article-title":"Shelling structures, convexity and a happy end","author":"Korte","year":"1984"},{"key":"10.1016\/0022-0000(93)90035-U_BIB20_1","series-title":"Proceedings, 29th IEEE Symp. on Foundations of Computer Science","first-page":"539","article-title":"Monotone circuits for connectivity problems require super-logarithmic depth","author":"Karchmer","year":"1988"},{"key":"10.1016\/0022-0000(93)90035-U_BIB20_2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0403021","volume":"3","author":"Karchmer","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0022-0000(93)90035-U_BIB21","first-page":"207","article-title":"Determinants on semilattices","volume":"20","author":"Lindstrom","year":"1969"},{"key":"10.1016\/0022-0000(93)90035-U_BIB22","series-title":"Proceedings, 13th ACM Symposium on Theory of Computing","first-page":"300","article-title":"Lower bounds for VLSI","author":"Lipton","year":"1981"},{"key":"10.1016\/0022-0000(93)90035-U_BIB23","series-title":"Proceedings, 14th ACM Symposium 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\/0022-0000(93)90035-U_BIB24","doi-asserted-by":"crossref","first-page":"265","DOI":"10.2307\/2318218","article-title":"A bound for the chromatic number of a graph","volume":"83","author":"van Nuffelen","year":"1976","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0022-0000(93)90035-U_BIB25","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","article-title":"Communication complexity","volume":"28","author":"Papaditriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(93)90035-U_BIB26_1","series-title":"Proceedings 25th IEEE Symp. on Foundations of Computer Science","first-page":"118","article-title":"Probabilistic communication complexity","author":"Paturi","year":"1984"},{"key":"10.1016\/0022-0000(93)90035-U_BIB26_2","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","volume":"33","author":"Paturi","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(93)90035-U_BIB27","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","article-title":"On recognizing graph properties from adjacency matrices","volume":"3","author":"Rivest","year":"1978","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/0022-0000(93)90035-U_BIB28","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF00531932","article-title":"On the foundations of combinatorial theory 1: Theory of Mobius functions","volume":"2","author":"Rota","year":"1964","journal-title":"Z. Wahrsch."},{"key":"10.1016\/0022-0000(93)90035-U_BIB29","series-title":"Enumerative Combinatorics","author":"Stanley","year":"1987"},{"key":"10.1016\/0022-0000(93)90035-U_BIB30","series-title":"Proceedings, 11th Annual ACM Symposium on Theory of Computing","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979"},{"key":"10.1016\/0022-0000(93)90035-U_BIB31","series-title":"Matroid Theory","author":"Welsh","year":"1976"},{"key":"10.1016\/0022-0000(93)90035-U_BIB32","series-title":"Proceedings, 29th IEEE Symp. on Foundations of Computer Science","first-page":"223","article-title":"Expressing combinatorial optimization problems by linear programs","author":"Yannakakis","year":"1988"},{"key":"10.1016\/0022-0000(93)90035-U_BIB33","series-title":"Proceedings, 11th Annual ACM Symposium on Theory of Computing","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979"},{"key":"10.1016\/0022-0000(93)90035-U_BIB34","series-title":"Proceedings, 13th Annual ACM Symposium on Theory of Computing","first-page":"308","article-title":"The entropic limitations of VLSI computation","author":"Yao","year":"1981"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390035U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390035U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:58:06Z","timestamp":1550325486000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390035U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["002200009390035U"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90035-u","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}