{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:55Z","timestamp":1750307215412,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"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,1,8]]},"DOI":"10.1145\/2090236.2090271","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"442-451","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Compressed matrix multiplication"],"prefix":"10.1145","author":[{"given":"Rasmus","family":"Pagh","sequence":"first","affiliation":[{"name":"IT University of Copenhagen"}]}],"member":"320","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1813"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1886521.1886554"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514909"},{"key":"e_1_3_2_1_5_1","volume-title":"27th International Symposium on Theoretical Aspects of Computer Science (STACS)","volume":"5","author":"Braverman Vladimir","year":"2010"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00400-6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536445"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009716300509"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0989"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80013-2"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Martin\n       \n      Dietzfelbinger Joseph\n       \n      Gil Yossi\n       \n      Matias and \n      \n      \n      Nicholas\n       \n      Pippenger\n    .\n      \n  \n   \n  Polynomial hash functions are reliable (extended abstract). In Werner Kuich editor Automata Languages and Programming 19th International Colloquium volume \n  623\n   of \n  Lecture Notes in Computer Science pages \n  235\n  --\n  246 Vienna Austria 13--17 July \n  1992\n  . \n  Springer-Verlag\n  .   Martin Dietzfelbinger Joseph Gil Yossi Matias and Nicholas Pippenger. Polynomial hash functions are reliable (extended abstract). In Werner Kuich editor Automata Languages and Programming 19th International Colloquium volume 623 of Lecture Notes in Computer Science pages 235--246 Vienna Austria 13--17 July 1992. Springer-Verlag.","DOI":"10.1007\/3-540-55719-9_77"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2045092"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806755"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1960.10483369"},{"key":"e_1_3_2_1_18_1","first-page":"737","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Indyk Piotr","year":"2008"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.01.010"},{"key":"e_1_3_2_1_20_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/978-3-642-04128-0_37","volume-title":"ESA","author":"Lingas Andrzej","year":"2009"},{"volume-title":"Chapman and Hall\/CRC Press","year":"2011","author":"Mahoney Michael W.","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993638"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077466"}],"event":{"name":"ITCS '12: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts","acronym":"ITCS '12"},"container-title":["Proceedings of the 3rd Innovations in Theoretical Computer Science Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090271","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2090236.2090271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:06:46Z","timestamp":1750241206000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2090236.2090271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":25,"alternative-id":["10.1145\/2090236.2090271","10.1145\/2090236"],"URL":"https:\/\/doi.org\/10.1145\/2090236.2090271","relation":{},"subject":[],"published":{"date-parts":[[2012,1,8]]},"assertion":[{"value":"2012-01-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}