{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:53:57Z","timestamp":1775282037552,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0022-0000(90)90027-i","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"402-429","source":"Crossref","is-referenced-by-count":17,"title":["Relations between communication complexity classes"],"prefix":"10.1016","volume":"41","author":[{"given":"Bernd","family":"Halstenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(90)90027-I_BIB1","series-title":"Proceedings, 26th Annu. IEEE Sympos. on Foundations of Computer Science","first-page":"277","article-title":"Geometrical realization of set systems and probabilistic communication complexity","author":"Alon","year":"1985"},{"key":"10.1016\/0022-0000(90)90027-I_BIB2","series-title":"Proceedings, 15th Annu. ACM Sympos. 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(90)90027-I_BIB3","series-title":"Proceedings, 27th Annu. IEEE Sympos. 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(90)90027-I_BIB4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0217015","article-title":"Unbiased bits from sources of weak randomness and probabilistic communication complexity","volume":"17","author":"Chor","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(90)90027-I_BIB5","series-title":"Proceedings, 20th Annu. ACM Sympos. on Theory of Computing","first-page":"162","article-title":"On different modes of communication","author":"Halstenberg","year":"1988"},{"key":"10.1016\/0022-0000(90)90027-I_BIB6","series-title":"Proceedings, 3rd IEEE Structure in Complexity Theory Conf","first-page":"278","article-title":"The polynomial time hierarchy collapses if the Boolean hierarchy collapses","author":"Kadin","year":"1988"},{"key":"10.1016\/0022-0000(90)90027-I_BIB7","series-title":"Proceedings, 2nd IEEE Structure in Complexity Theory Conf","first-page":"41","article-title":"The probabilistic communication complexity of set intersection","author":"Kalyanasundaram","year":"1987"},{"key":"10.1016\/0022-0000(90)90027-I_BIB8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(83)90044-3","article-title":"BPP and the polynomial hierarchy","volume":"17","author":"Lautemann","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(90)90027-I_BIB9","doi-asserted-by":"crossref","unstructured":"R. Paturi, and J. Simon, Probabilistic communication complexity, J. Comput. System Sci. 33 (86), 106\u2013124","DOI":"10.1109\/SFCS.1984.715908"},{"key":"10.1016\/0022-0000(90)90027-I_BIB10","series-title":"Proceedings, 3rd IEEE Structure in Complexity Theory Conf","first-page":"260","article-title":"Bounded query computations","author":"Wagner","year":"1988"},{"key":"10.1016\/0022-0000(90)90027-I_BIB11","series-title":"Proceedings, 11th Annu. ACM Sympos. on Theory of Computing","first-page":"209","article-title":"Some complexity questions related to distributed computing","author":"Yao","year":"1979"},{"key":"10.1016\/0022-0000(90)90027-I_BIB12","series-title":"Proceedings, 24th Annu. IEEE Sympos. 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:002200009090027I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009090027I?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:01Z","timestamp":1550325361000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009090027I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["002200009090027I"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(90)90027-i","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}