{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:26:20Z","timestamp":1751880380478},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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":7563,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0166-218x(92)90019-7","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"19-28","source":"Crossref","is-referenced-by-count":4,"title":["The communication complexity of interval orders"],"prefix":"10.1016","volume":"40","author":[{"given":"Ulrich","family":"Faigle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Schrader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90019-7_BIB1","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983","journal-title":"Proceedings 15th ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(92)90019-7_BIB2","first-page":"337","article-title":"Complexity classes in communication complexity theory","author":"Babai","year":"1986","journal-title":"Proceedings 27th IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(92)90019-7_BIB3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02253744","article-title":"Interval orders without odd crowns are defect optimal","volume":"38","author":"Faigle","year":"1987","journal-title":"Computing"},{"key":"10.1016\/0166-218X(92)90019-7_BIB4","first-page":"141","article-title":"Communication complexity","volume":"7","author":"Faigle","year":"1990"},{"key":"10.1016\/0166-218X(92)90019-7_BIB5","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-2496(70)90062-3","article-title":"Intransitive indifference with inequal indifference intervals","volume":"7","author":"Fishburn","year":"1970","journal-title":"J. Math. Psych."},{"key":"10.1016\/0166-218X(92)90019-7_BIB6","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1137\/0604016","article-title":"Minimizing setups for ordered sets: a linear algebraic approach","volume":"4","author":"Gierz","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)90019-7_BIB7","series-title":"Proceedings 20th ACM Symposium on Theory of Computing","first-page":"162","article-title":"On different modes of communication","author":"Halstenberg","year":"1988"},{"key":"10.1016\/0166-218X(92)90019-7_BIB8","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\/0166-218X(92)90019-7_BIB9","series-title":"Proceedings 29th IEEE FOCS","first-page":"81","article-title":"Lattices, M\u00f6bius functions and communication complexity","author":"Lov\u00e1sz","year":"1988"},{"key":"10.1016\/0166-218X(92)90019-7_BIB10","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\/0166-218X(92)90019-7_BIB11","series-title":"Proceedings 11th ACM Symposium on Theory of Computing","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900197?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900197?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:23:52Z","timestamp":1554967432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92900197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["0166218X92900197"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90019-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}