| Streaming algorithms for embedding and computing edit distance in the low distance regime D Chakraborty, E Goldenberg, M Koucký Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 52 | 2016 |
| Locally testing direct product in the low error range I Dinur, E Goldenberg 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 613-622, 2008 | 38 | 2008 |
| Direct sum testing R David, I Dinur, E Goldenberg, G Kindler, I Shinkar SIAM Journal on Computing 46 (4), 1336-1369, 2017 | 32 | 2017 |
| Approximating edit distance within constant factor in truly sub-quadratic time D Chakraborty, D Das, E Goldenberg, M Koucký, M Saks Journal of the ACM (JACM) 67 (6), 1-22, 2020 | 20 | 2020 |
| Sublinear algorithms for gap edit distance E Goldenberg, R Krauthgamer, B Saha 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 11 | 2019 |
| Streaming algorithms for computing edit distance without exploiting suffix trees D Chakraborty, E Goldenberg, M Koucký arXiv preprint arXiv:1607.03718, 2016 | 11 | 2016 |
| Low Distortion Embedding from Edit to Hamming Distance using Coupling. D Chakraborty, E Goldenberg, M Koucký Electronic Colloquium on Computational Complexity (ECCC) 22 (111), 4, 2015 | 10 | 2015 |
| Does preprocessing help in fast sequence comparisons? E Goldenberg, A Rubinstein, B Saha Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 4 | 2020 |
| Hardness amplification of optimization problems E Goldenberg arXiv preprint arXiv:1908.10248, 2019 | 3 | 2019 |
| Toward a General Direct Product Testing Theorem E Goldenberg, K CS ACM Transactions on Computation Theory (TOCT) 12 (1), 1-18, 2019 | 2 | 2019 |
| Towards a general direct product testing theorem E Goldenberg arXiv preprint arXiv:1901.06220, 2019 | 2 | 2019 |
| The structure of winning strategies in parallel repetition games I Dinur, E Goldenberg Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2010 | 2 | 2010 |
| Local reconstruction of low‐rank matrices and subspaces R David, E Goldenberg, R Krauthgamer Random Structures & Algorithms 51 (4), 607-630, 2017 | 1 | 2017 |
| Locally testing direct products in the high error range I Dinur, E Goldenberg FOCS, 2008 | 1 | 2008 |
| Information Complexity for Multiparty Communication. D Chakraborty, E Goldenberg, M Koucký Electronic Colloquium on Computational Complexity (ECCC) 21, 132, 2014 | | 2014 |
| Clustering in the boolean hypercube in a list decoding regime I Dinur, E Goldenberg International Colloquium on Automata, Languages, and Programming, 413-424, 2013 | | 2013 |
| Locally Testing Direct Product Functions E Goldenberg Hebrew University of Jerusalem, 2008 | | 2008 |
| Streaming Algorithms For Computing Edit Distance Without Exploiting Su x Trees D Chakraborty, E Goldenberg, M Koucký | | |
| FOCS 2018 Awards S Hirahara, U Mahadev, S Khot, D Minzer, M Safra, D Chakraborty, D Das, ... | | |
