| Robust estimators in high-dimensions without the computational intractability I Diakonikolas, G Kamath, D Kane, J Li, A Moitra, A Stewart SIAM Journal on Computing 48 (2), 742-864, 2019 | 405 | 2019 |
| An optimal algorithm for the distinct elements problem DM Kane, J Nelson, DP Woodruff Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on …, 2010 | 359 | 2010 |
| Sparser johnson-lindenstrauss transforms DM Kane, J Nelson Journal of the ACM (JACM) 61 (1), 1-23, 2014 | 339 | 2014 |
| Sever: A robust meta-algorithm for stochastic optimization I Diakonikolas, G Kamath, D Kane, J Li, J Steinhardt, A Stewart International Conference on Machine Learning, 1596-1606, 2019 | 243 | 2019 |
| Being robust (in high dimensions) can be practical I Diakonikolas, G Kamath, DM Kane, J Li, A Moitra, A Stewart International Conference on Machine Learning, 999-1008, 2017 | 216 | 2017 |
| Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures I Diakonikolas, DM Kane, A Stewart 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 73-84, 2017 | 189 | 2017 |
| On the exact space complexity of sketching and streaming small norms DM Kane, J Nelson, DP Woodruff Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 169 | 2010 |
| A new approach for testing properties of discrete distributions I Diakonikolas, DM Kane 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016 | 140 | 2016 |
| Recent advances in algorithmic high-dimensional robust statistics I Diakonikolas, DM Kane arXiv preprint arXiv:1911.05911, 2019 | 124 | 2019 |
| List-decodable robust mean estimation and learning mixtures of spherical gaussians I Diakonikolas, DM Kane, A Stewart Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 123 | 2018 |
| Robustly learning a gaussian: Getting optimal error, efficiently I Diakonikolas, G Kamath, DM Kane, J Li, A Moitra, A Stewart Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018 | 118 | 2018 |
| Bounded independence fools degree-2 threshold functions I Diakonikolas, DM Kane, J Nelson 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 11-20, 2010 | 102 | 2010 |
| Testing identity of structured distributions I Diakonikolas, DM Kane, V Nikishkin Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 98 | 2014 |
| Fast moment estimation in data streams in optimal space DM Kane, J Nelson, E Porat, DP Woodruff Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 94 | 2011 |
| Counting arbitrary subgraphs in data streams DM Kane, K Mehlhorn, T Sauerwald, H Sun Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012 | 90 | 2012 |
| On the complexity of two-player win-lose games T Abbott, D Kane, P Valiant 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 113-122, 2005 | 87 | 2005 |
| Mass-surveillance without the state: Strongly undetectable algorithm-substitution attacks M Bellare, J Jaeger, D Kane Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015 | 83 | 2015 |
| vqsgd: Vector quantized stochastic gradient descent V Gandikota, D Kane, RK Maity, A Mazumdar International Conference on Artificial Intelligence and Statistics, 2197-2205, 2021 | 74 | 2021 |
| Modeling the distribution of ranks, Selmer groups, and Shafarevich-Tate groups of elliptic curves M Bhargava, DM Kane, B Poonen, E Rains arXiv preprint arXiv:1304.3971, 2013 | 73 | 2013 |
| The geometry of binary search trees ED Demaine, D Harmon, J Iacono, D Kane, M Patraşcu Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 73 | 2009 |
Ilias DiakonikolasUniversity of Wisconsin-Madisonwisc.edu의 이메일 확인됨
