{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T09:48:24Z","timestamp":1725443304238},"reference-count":7,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2002.1004330","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T16:30:39Z","timestamp":1056558639000},"page":"18","source":"Crossref","is-referenced-by-count":2,"title":["Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems"],"prefix":"10.1109","author":[{"given":"P.","family":"Beame","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Vee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90047-M"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814578"},{"key":"1","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1145\/301250.301424","article-title":"Determinism versus non-determinism for linear time RAMs with memory restrictions","author":"ajtai","year":"1999","journal-title":"Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1577"},{"key":"6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/301250.301330","article-title":"Lower bounds for high dimensional nearest neight search and related problems","author":"borodin","year":"1999","journal-title":"Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743453"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892078"}],"event":{"name":"17th IEEE Annual Conference on Computational Complexity","acronym":"CCC-02","location":"Montreal, Que., Canada"},"container-title":["Proceedings 17th IEEE Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7872\/21680\/01004330.pdf?arnumber=1004330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:39:01Z","timestamp":1497551941000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004330\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/ccc.2002.1004330","relation":{},"subject":[]}}