{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T08:24:53Z","timestamp":1790756693835,"version":"4.1.0"},"reference-count":41,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/focs.2013.21","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T13:37:15Z","timestamp":1388756235000},"page":"117-126","source":"Crossref","is-referenced-by-count":115,"title":["OSNAP: Faster Numerical Linear Algebra Algorithms via Sparser Subspace Embeddings"],"prefix":"10.1109","author":[{"given":"Jelani","family":"Nelson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huy L.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20360"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1142\/S1793536911000787"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.006"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177693335"},{"key":"33","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/132\/02","article-title":"Topics in random matrix theory","author":"tao","year":"2012","journal-title":"Volume 132 of Graduate Studies in Mathematics"},{"key":"15","article-title":"Fast approximation of matrix coherence and statistical leverage","author":"drineas","year":"2012","journal-title":"ICML"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1137\/100800774"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579329"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806737"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-007-0114-x"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfa.2010.11.014"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.2307\/1970079"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/070696507"},{"key":"21","article-title":"A derandomized sparse Johnson- Lindenstrauss transform","author":"kane","year":"2010","journal-title":"CoRR"},{"key":"20","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Contemporary Mathematics"},{"key":"41","first-page":"337","article-title":"Largescale parallel collaborative filtering for the Netflix prize","author":"zhou","year":"2008","journal-title":"AAIM"},{"key":"40","article-title":"Subspace embeddings and lp-regression using exponential random variables","author":"woodruff","year":"2013","journal-title":"COLT"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.94"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993735"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21504"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1137\/100810447"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.22"},{"key":"27","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"mahoney","year":"2011","journal-title":"Foundations and Trends in Machine Learning"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488621"},{"key":"29","article-title":"Lower bounds for oblivious subspace embeddings","author":"nelson","year":"2013","journal-title":"CoRR"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9110-x"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/060673096"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536445"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488622"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"6","article-title":"Rademacher chaos, random Eulerian graphs and the sparse Johnson- Lindenstrauss transform","author":"braverman","year":"2010","journal-title":"CoRR"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.37"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176989118"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536446"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.17"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.34"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214028"}],"event":{"name":"2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS)","location":"Berkeley, CA, USA","start":{"date-parts":[[2013,10,26]]},"end":{"date-parts":[[2013,10,29]]}},"container-title":["2013 IEEE 54th Annual Symposium on Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6685222\/6686124\/06686147.pdf?arnumber=6686147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T16:18:32Z","timestamp":1565021912000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6686147\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/focs.2013.21","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}