{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:18:31Z","timestamp":1729671511856,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006848","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"1843-1847","source":"Crossref","is-referenced-by-count":4,"title":["Communication cost of transforming a nearest plane partition to the Voronoi partition"],"prefix":"10.1109","author":[{"given":"Vinay A.","family":"Vaishampayan","sequence":"first","affiliation":[]},{"given":"Maiara F.","family":"Bollauf","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Communication Complexity: A Survey","author":"lov\u00e1sz","year":"1990","journal-title":"Paths Flows and VLSI Layout"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394497"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161916"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158882"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.915643"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.21219"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"journal-title":"An Introduction to the Geometry of Numbers","year":"1997","author":"cassels","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006847"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.814482"},{"journal-title":"Sphere Packings Lattices and Groups","year":"1998","author":"conway","key":"ref5"},{"journal-title":"Communication Complexity","year":"1997","author":"kushilevitz","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056022"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.32125"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579403"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1561\/0400000040","article-title":"Lower Bounds in Communication Complexity","volume":"3","author":"lee","year":"2009","journal-title":"Foundations and Trends in Theoretical Computer Science"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006848.pdf?arnumber=8006848","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T22:20:16Z","timestamp":1570054816000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006848\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006848","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}