{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T01:59:04Z","timestamp":1791251944359,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"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":[[2013,8,11]]},"DOI":"10.1145\/2487575.2487623","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T08:31:21Z","timestamp":1376382681000},"page":"581-588","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":161,"title":["Simple and deterministic matrix sketching"],"prefix":"10.1145","author":[{"given":"Edo","family":"Liberty","sequence":"first","affiliation":[{"name":"Yahoo! Labs, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375608"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1219092.1219097"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.985947"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_26"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.21"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496875"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536445"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806737"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740658"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/644108.644147"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.01.010"},{"key":"e_1_3_2_1_16_1","first-page":"370","volume-title":"Proceedings of the 39th Annual Symposium on Foundations of Computer Science, FOCS '98","author":"Frieze Alan","unstructured":"Alan Frieze , Ravi Kannan , and Santosh Vempala . Fast monte-carlo algorithms for finding low-rank approximations . In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, FOCS '98 , pages 370 --, Washington, DC, USA, 1998. IEEE Computer Society. Alan Frieze, Ravi Kannan, and Santosh Vempala. Fast monte-carlo algorithms for finding low-rank approximations. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, FOCS '98, pages 370--, Washington, DC, USA, 1998. IEEE Computer Society."},{"key":"e_1_3_2_1_17_1","volume-title":"Gibbons and Yossi Matias. External memory algorithms","author":"Phillip","year":"1999","unstructured":"Phillip B. Gibbons and Yossi Matias. External memory algorithms , 1999 . Phillip B. Gibbons and Yossi Matias. External memory algorithms, 1999."},{"key":"e_1_3_2_1_18_1","first-page":"1195","volume-title":"SODA","author":"Daniel","year":"2012","unstructured":"Daniel M. Kane and Jelani Nelson. Sparser johnson-lindenstrauss transforms . In SODA , pages 1195 -- 1206 , 2012 . Daniel M. Kane and Jelani Nelson. Sparser johnson-lindenstrauss transforms. In SODA, pages 1195--1206, 2012."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"e_1_3_2_1_20_1","unstructured":"Edo Liberty. www.cs.yale.edu\/homes\/el327\/public\/experimentalresults\/.  Edo Liberty. www.cs.yale.edu\/homes\/el327\/public\/experimentalresults\/."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709640104"},{"key":"e_1_3_2_1_22_1","volume-title":"ICML","author":"Mahoney Michael W.","year":"2012","unstructured":"Michael W. Mahoney , Petros Drineas , Malik Magdon-Ismail , and David P. Woodruff . Fast approximation of matrix coherence and statistical leverage . In ICML , 2012 . Michael W. Mahoney, Petros Drineas, Malik Magdon-Ismail, and David P. Woodruff. Fast approximation of matrix coherence and statistical leverage. In ICML, 2012."},{"key":"e_1_3_2_1_23_1","volume-title":"USA","author":"Misra Jayadev","year":"1982","unstructured":"Jayadev Misra and David Gries . Finding repeated elements. Technical report, Ithaca, NY , USA , 1982 . Jayadev Misra and David Gries. Finding repeated elements. Technical report, Ithaca, NY, USA, 1982."},{"key":"e_1_3_2_1_24_1","volume-title":"April","author":"Oliveira Roberto Imbuzeiro","year":"2010","unstructured":"Roberto Imbuzeiro Oliveira . Sums of random hermitian matrices and an inequality by rudelson. arXiv:1004.3821v1 , April 2010 . Roberto Imbuzeiro Oliveira. Sums of random hermitian matrices and an inequality by rudelson. arXiv:1004.3821v1, April 2010."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275505"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1255443.1255449"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"e_1_3_2_1_28_1","volume-title":"The Random Projection Method","author":"Vempala S. S.","year":"2004","unstructured":"S. S. Vempala . The Random Projection Method . American Mathematical Society , 2004 . S. S. Vempala. The Random Projection Method. American Mathematical Society, 2004."},{"key":"e_1_3_2_1_29_1","unstructured":"Roman Vershynin. A note on sums of independent random matrices after ahlswede-winter. Lecture Notes.  Roman Vershynin. A note on sums of independent random matrices after ahlswede-winter. Lecture Notes."},{"key":"e_1_3_2_1_30_1","volume-title":"Spectral norm of products of random and deterministic matrices. Probability Theory and Related Fields, 150(3--4):471--509","author":"Vershynin Roman","year":"2011","unstructured":"Roman Vershynin . Spectral norm of products of random and deterministic matrices. Probability Theory and Related Fields, 150(3--4):471--509 , 2011 . Roman Vershynin. Spectral norm of products of random and deterministic matrices. Probability Theory and Related Fields, 150(3--4):471--509, 2011."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"}],"event":{"name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Chicago Illinois USA","acronym":"KDD' 13","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487623","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487575.2487623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:56Z","timestamp":1750221356000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":31,"alternative-id":["10.1145\/2487575.2487623","10.1145\/2487575"],"URL":"https:\/\/doi.org\/10.1145\/2487575.2487623","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}