{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:00Z","timestamp":1750307040825,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214008","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"327-338","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["From irreducible representations to locally decodable codes"],"prefix":"10.1145","author":[{"given":"Klim","family":"Efremenko","sequence":"first","affiliation":[{"name":"Tel-Aviv University, Tel-Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536422"},{"key":"e_1_3_2_1_2_1","first-page":"72","article-title":"A survey on private information retrieval (column: Computational complexity)","volume":"82","author":"Gasarch W. I.","year":"2004","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/872747.873181"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070032"},{"key":"e_1_3_2_1_5_1","unstructured":"T. Itoh and Y. Suzuki. New constructions for query-efficient locally decodable codes of subexponential length. CoRR abs\/0810.4576 2008.  T. Itoh and Y. Suzuki. New constructions for query-efficient locally decodable codes of subexponential length. CoRR abs\/0810.4576 2008."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780560"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993660"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Y. Meng Chee T. Feng S. Ling H. Wang and L. F. Zhang. Query-Efficient Locally Decodable Codes of Subexponential Length. ArXiv e-prints Aug. 2010.  Y. Meng Chee T. Feng S. Ling H. Wang and L. F. Zhang. Query-Efficient Locally Decodable Codes of Subexponential Length. ArXiv e-prints Aug. 2010.","DOI":"10.1007\/s00037-011-0017-1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"J. P. Serre. Linear representations of finite groups \/ Jean-Pierre Serre ; translated from the French by Leonard L. Scott. Springer-Verlag New York : 1977.  J. P. Serre. Linear representations of finite groups \/ Jean-Pierre Serre ; translated from the French by Leonard L. Scott. Springer-Verlag New York : 1977.","DOI":"10.1007\/978-1-4684-9458-7"},{"volume-title":"Electronic Colloquium on Computational Complexity (ECCC)","year":"2007","author":"Woodruff D.","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"S. Yekhanin. Locally decodable codes. Foundations and trends in theoretical computer science 2010.  S. Yekhanin. Locally decodable codes. Foundations and trends in theoretical computer science 2010.","DOI":"10.1561\/9781601985453"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"New York New York USA","acronym":"STOC'12"},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214008","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":13,"alternative-id":["10.1145\/2213977.2214008","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214008","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}