| Random access in large-scale DNA data storage L Organick, SD Ang, YJ Chen, R Lopez, S Yekhanin, K Makarychev, ... Nature biotechnology 36 (3), 242-248, 2018 | 759 | 2018 |
| Network-aware scheduling for data-parallel jobs: Plan when you can V Jalaparti, P Bodik, I Menache, S Rao, K Makarychev, M Caesar ACM SIGCOMM Computer Communication Review 45 (4), 407-420, 2015 | 248 | 2015 |
| O (√ log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems A Agarwal, M Charikar, K Makarychev, Y Makarychev Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 239 | 2005 |
| Near-optimal algorithms for unique games M Charikar, K Makarychev, Y Makarychev Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 170 | 2006 |
| A new class of non-Shannon-type inequalities for entropies K Makarychev, Y Makarychev, A Romashchenko, N Vereshchagin Communications in Information and Systems 2 (2), 147-166, 2002 | 154 | 2002 |
| Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering K Makarychev, Y Makarychev, I Razenshteyn Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 148 | 2019 |
| Near optimal LP rounding algorithm for correlation clustering on complete and complete k-partite graphs S Chawla, K Makarychev, T Schramm, G Yaroslavtsev Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of …, 2015 | 148 | 2015 |
| Integrality gaps for Sherali-Adams relaxations M Charikar, K Makarychev, Y Makarychev Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 140 | 2009 |
| DNA assembly for nanopore data storage readout R Lopez, YJ Chen, S Dumas Ang, S Yekhanin, K Makarychev, MZ Racz, ... Nature communications 10 (1), 2933, 2019 | 136 | 2019 |
| The Grothendieck constant is strictly smaller than Krivine’s bound M Braverman, K Makarychev, Y Makarychev, A Naor Forum of Mathematics, Pi 1, e4, 2013 | 113 | 2013 |
| Near-optimal algorithms for maximum constraint satisfaction problems M Charikar, K Makarychev, Y Makarychev ACM Transactions on Algorithms (TALG) 5 (3), 32, 2009 | 104 | 2009 |
| Quadratic forms on graphs N Alon, K Makarychev, Y Makarychev, A Naor Inventiones mathematicae 163 (3), 499-522, 2006 | 102 | 2006 |
| Min-max graph partitioning and small set expansion N Bansal, U Feige, R Krauthgamer, K Makarychev, V Nagarajan, J Seffi, ... SIAM Journal on Computing 43 (2), 872-904, 2014 | 95 | 2014 |
| Online make-to-order joint replenishment model: primal dual competitive algorithms N Buchbinder, T Kimbrel, R Levi, K Makarychev, M Sviridenko Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008 | 91* | 2008 |
| Clustering billions of reads for DNA data storage C Rashtchian, K Makarychev, M Racz, S Ang, D Jevdjic, S Yekhanin, ... Advances in Neural Information Processing Systems 30, 2017 | 84 | 2017 |
| Improved approximation for the directed spanner problem P Berman, A Bhattacharyya, K Makarychev, S Raskhodnikova, ... Automata, Languages and Programming, 1-12, 2011 | 83* | 2011 |
| How to play unique games using embeddings E Chlamtac, K Makarychev, Y Makarychev 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 81 | 2006 |
| Approximation algorithms for semi-random partitioning problems K Makarychev, Y Makarychev, A Vijayaraghavan Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 79 | 2012 |
| Bilu–Linial stable instances of max cut and minimum multiway cut K Makarychev, Y Makarychev, A Vijayaraghavan Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 71 | 2014 |
| Metric extension operators, vertex sparsifiers and Lipschitz extendability K Makarychev, Y Makarychev Israel Journal of Mathematics 212 (2), 913-959, 2016 | 69* | 2016 |
Yury MakarychevProfessor of Computer Science, Toyota Technological Institute at Chicagottic.edu의 이메일 확인됨