{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T19:32:22Z","timestamp":1769628742242,"version":"3.49.0"},"reference-count":21,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2003.1214415","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T14:34:28Z","timestamp":1079966068000},"page":"118-134","source":"Crossref","is-referenced-by-count":36,"title":["Rectangle size bounds and threshold covers in communication complexity"],"prefix":"10.1109","author":[{"given":"H.","family":"Klauck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301343"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146684"},{"key":"13","first-page":"335","article-title":"On quantum and approximate privacy","author":"klauck","year":"2002","journal-title":"Symposium Theoretical Aspects in Computer Science"},{"key":"14","author":"kushilevitz","year":"1997","journal-title":"Communication Complexity"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1998.694600"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959903"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.30"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.15"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808742"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80049-2"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240467"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(90)90027-I"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181944"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/237814.238003"}],"event":{"name":"18th IEEE Annual Conference on Computational Complexity","location":"Aarhus, Denmark","acronym":"CCC-03"},"container-title":["18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8614\/27296\/01214415.pdf?arnumber=1214415","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T18:46:33Z","timestamp":1489430793000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214415\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/ccc.2003.1214415","relation":{},"subject":[]}}