{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T03:16:10Z","timestamp":1673406970460},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":7777,"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":[[1992,4]]},"DOI":"10.1016\/0022-0000(92)90025-e","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"324-342","source":"Crossref","is-referenced-by-count":11,"title":["Results on communication complexity classes"],"prefix":"10.1016","volume":"44","author":[{"given":"Tak Wah","family":"Lam","sequence":"first","affiliation":[]},{"given":"Walter L.","family":"Ruzzo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(92)90025-E_BIB1","series-title":"Proceedings, Fifteenth Annual ACM Symposium on Theory of Computing","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983"},{"key":"10.1016\/0022-0000(92)90025-E_BIB2","series-title":"27th Annual IEEE Symposium 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(92)90025-E_BIB3","article-title":"On relation between communication complexity classes","author":"Ba\u010d\u00edk","year":"1990"},{"key":"10.1016\/0022-0000(92)90025-E_BIB4","series-title":"Proceedings, Sixteenth Annual 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(92)90025-E_BIB5","series-title":"Proceedings, Nineteenth Annual ACM Symposium on Theory of Computing","first-page":"178","article-title":"The power of randomness for communication complexity","author":"F\u00fcrer","year":"1987"},{"key":"10.1016\/0022-0000(92)90025-E_BIB6","series-title":"Proceedings, Twentieth Annual ACM Symposium 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(92)90025-E_BIB7","series-title":"Proceedings, Structure in Complexity Theory, Third Annual IEEE Conference","first-page":"19","article-title":"Relations between communication complexity classes","author":"Halstenberg","year":"1988"},{"key":"10.1016\/0022-0000(92)90025-E_BIB8","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(92)90025-E_BIB9","series-title":"Proceedings, Structure in Complexity Theory, Second Annual IEEE Conference","first-page":"41","article-title":"The probabilistic communication complexity of set intersection","author":"Kalyanasundaram","year":"1987"},{"key":"10.1016\/0022-0000(92)90025-E_BIB10","series-title":"Proceedings, Twentieth Annual ACM Symposium on Theory of Computing","first-page":"539","article-title":"Monotone circuits for connectivity require super-logarithmic depth","author":"Karchmer","year":"1988"},{"key":"10.1016\/0022-0000(92)90025-E_BIB11_1","article-title":"Some Topics in Communication Complexity Theory","author":"Lam","year":"1988"},{"key":"10.1016\/0022-0000(92)90025-E_BIB11_2","author":"Lam","year":"1988","journal-title":"Computer Science Department Technical Report 88-12-02"},{"key":"10.1016\/0022-0000(92)90025-E_BIB12","series-title":"Proceedings, Thirteenth Annual ACM Symposium on Theory of Computing","first-page":"300","article-title":"Lower bounds for VLSI","author":"Lipton","year":"1981"},{"key":"10.1016\/0022-0000(92)90025-E_BIB13","series-title":"29th Annual IEEE Symposium on Foundations of Computer Science","first-page":"81","article-title":"Lattices, M\u00f6bius functions and communication complexity","author":"Lov\u00e1sz","year":"1988"},{"key":"10.1016\/0022-0000(92)90025-E_BIB14","series-title":"Proceedings, Fourteenth Annual 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(92)90025-E_BIB15","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","article-title":"Communication complexity","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90025-E_BIB16","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","article-title":"Probabilistic communication complexity","volume":"33","author":"Paturi","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(92)90025-E_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90025-E_BIB18","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(92)90025-E_BIB19","series-title":"Proceedings, Twentieth Annual ACM Symposium on Theory of Computing","first-page":"223","article-title":"Expressing combinatorial optimization problems by linear programs","author":"Yannakakis","year":"1988"},{"key":"10.1016\/0022-0000(92)90025-E_BIB20","series-title":"Proceedings, Eleventh 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(92)90025-E_BIB21","series-title":"Proceedings, Thirteenth Annual ACM Symposium on Theory of Computing","first-page":"308","article-title":"The entropic limitations of VLSI computations","author":"Yao","year":"1981"},{"key":"10.1016\/0022-0000(92)90025-E_BIB22","series-title":"24th Annual IEEE Symposium on Foundations of Computer Science","first-page":"420","article-title":"Lower bounds by probabilistic arguments","author":"Yao","year":"1983"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290025E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009290025E?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:56:57Z","timestamp":1550325417000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009290025E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002200009290025E"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(92)90025-e","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}