| Almost optimal exploration in multi-armed bandits Z Karnin, T Koren, O Somekh International Conference on Machine Learning, 1238-1246, 2013 | 236 | 2013 |
| Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in ZS Karnin, A Shpilka 2008 23rd Annual IEEE Conference on Computational Complexity, 280-291, 2008 | 78 | 2008 |
| Reducing dueling bandits to cardinal bandits N Ailon, Z Karnin, T Joachims International Conference on Machine Learning, 856-864, 2014 | 76 | 2014 |
| Online principal components analysis C Boutsidis, D Garber, Z Karnin, E Liberty Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 71 | 2014 |
| Copeland dueling bandits M Zoghi, ZS Karnin, S Whiteson, M De Rijke Advances in Neural Information Processing Systems 28, 307-315, 2015 | 65 | 2015 |
| How many folders do you really need? classifying email into a handful of categories M Grbovic, G Halawi, Z Karnin, Y Maarek Proceedings of the 23rd ACM International Conference on Conference on …, 2014 | 58 | 2014 |
| Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in ZS Karnin, P Mukhopadhyay, A Shpilka, I Volkovich SIAM Journal on Computing 42 (6), 2114-2131, 2013 | 48 | 2013 |
| Distributed exploration in multi-armed bandits E Hillel, ZS Karnin, T Koren, R Lempel, O Somekh Advances in Neural Information Processing Systems 26, 854-862, 2013 | 45 | 2013 |
| Threading machine generated email N Ailon, ZS Karnin, E Liberty, Y Maarek Proceedings of the sixth ACM international conference on Web search and data …, 2013 | 40 | 2013 |
| You've got mail, and here is what you could do with it! analyzing and predicting actions on email messages D Di Castro, Z Karnin, L Lewin-Eytan, Y Maarek Proceedings of the Ninth ACM International Conference on Web Search and Data …, 2016 | 39 | 2016 |
| Optimal dynamic distributed MIS K Censor-Hillel, E Haramaty, Z Karnin Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 38 | 2016 |
| Multi-armed bandits: Competing with optimal sequences ZS Karnin, O Anava Advances in Neural Information Processing Systems 29, 199-207, 2016 | 38* | 2016 |
| Reconstruction of generalized depth-3 arithmetic circuits with bounded top fan-in ZS Karnin, A Shpilka 2009 24th Annual IEEE Conference on Computational Complexity, 274-285, 2009 | 38 | 2009 |
| Optimal quantile approximation in streams Z Karnin, K Lang, E Liberty 2016 ieee 57th annual symposium on foundations of computer science (focs), 71-78, 2016 | 36 | 2016 |
| Near-optimal entrywise sampling for data matrices D Achlioptas, ZS Karnin, E Liberty Advances in Neural Information Processing Systems 26, 1565-1573, 2013 | 32 | 2013 |
| Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in ZS Karnin, A Shpilka Combinatorica 31 (3), 333, 2011 | 31 | 2011 |
| Online pca with spectral bounds Z Karnin, E Liberty Conference on Learning Theory, 1129-1140, 2015 | 29 | 2015 |
| Online pca with spectral bounds Z Karnin, E Liberty Conference on Learning Theory, 1129-1140, 2015 | 29 | 2015 |
| Budget-constrained item cold-start handling in collaborative filtering recommenders via optimal design O Anava, S Golan, N Golbandi, Z Karnin, R Lempel, O Rokhlenko, ... Proceedings of the 24th International Conference on World Wide Web, 45-54, 2015 | 25 | 2015 |
| Unsupervised svms: On the complexity of the furthest hyperplane problem Z Karnin, E Liberty, S Lovett, R Schwartz, O Weinstein Conference on Learning Theory, 2.1-2.17, 2012 | 23 | 2012 |
