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 | 86 | 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 | 49 | 2008 |

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 | 48 | 2020 |

Direct sum testing R David, I Dinur, E Goldenberg, G Kindler, I Shinkar Proceedings of the 2015 Conference on innovations in theoretical computer …, 2015 | 44 | 2015 |

Sublinear algorithms for gap edit distance E Goldenberg, R Krauthgamer, B Saha 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 31 | 2019 |

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 | 26 | 2020 |

Low distortion embedding from edit to hamming distance using coupling D Chakraborty, E Goldenberg, M Kouckı Proceedings of the 48th IEEE Annual Annual ACM SIGACT Symposium on Theory of …, 2016 | 14 | 2016 |

Gap edit distance via non-adaptive queries: Simple and optimal E Goldenberg, T Kociumaka, R Krauthgamer, B Saha 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 13 | 2022 |

Streaming algorithms for computing edit distance without exploiting suffix trees D Chakraborty, E Goldenberg, M Kouckı arXiv preprint arXiv:1607.03718, 2016 | 12 | 2016 |

Hardness amplification of optimization problems E Goldenberg arXiv preprint arXiv:1908.10248, 2019 | 7 | 2019 |

Toward a general direct product testing theorem E Goldenberg, K CS ACM Transactions on Computation Theory (TOCT) 12 (1), 1-18, 2019 | 6 | 2019 |

Zirconium vacuum arc operation in a mixture of Ar and O2 gases: Ar effect on the arcing characteristics, deposition rate and coating properties O Goldberg, E Goldenberg, VN Zhitomirsky, SR Cohen, RL Boxman Surface and Coatings Technology 206 (21), 4417-4424, 2012 | 6 | 2012 |

An algorithmic bridge between Hamming and Levenshtein distances E Goldenberg, T Kociumaka, R Krauthgamer, B Saha arXiv preprint arXiv:2211.12496, 2022 | 2 | 2022 |

The structure of winning strategies in parallel repetition games I Dinur, E Goldenberg International Workshop on Randomization and Approximation Techniques in …, 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 |

Explicit Good Codes Approaching Distance 1 in Ulam Metric E Goldenberg, M Habib, CS Karthik arXiv preprint arXiv:2401.17235, 2024 | | 2024 |

Can You Solve Closest String Faster Than Exhaustive Search? A Abboud, N Fischer, E Goldenberg, R Safier arXiv preprint arXiv:2305.16878, 2023 | | 2023 |

Leibniz International Proceedings in Informatics (LIPIcs): 14th Innovations in Theoretical Computer Science Conference (ITCS 2023) E Goldenberg, T Kociumaka, R Krauthgamer, B Saha SourceOECD ITCS, 2023 | | 2023 |

LIPIcs, Volume 151, ITCS'20, Complete Volume}} T Vidick, E Goldenberg, CS Karthik, O Paradise, A Schvartzman, ... 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) 151, 9, 2020 | | 2020 |

38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) R Majumdar, AP Sistla, O Svensson, S Vempala, S Bhandari, P Harsha, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |