Publications
Explicit Good Codes Approaching Distance 1 in Ulam Metric
Elazar Goldenberg, Mursalin Habib Karthik C. S.,
ISIT 2024Can You Solve Closest String Faster than Exhaustive Search?
Amir Abboud , Nick Fischer, Elazar Goldenberg, Karthik C. S. , Ron Safier
ESA 2023An Algorithmic Bridge Between Hamming and Levenshtein Distances
Elazar Goldenberg, Tomasz Kociumaka , Robert Krauthgamer , and Barna Saha
ITCS 2023.Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal
Elazar Goldenberg, Tomasz Kociumaka , Robert Krauthgamer , and Barna Saha
FOCS 2022.Does Preprocessing help in Fast Sequence Comparisons?
Elazar Goldenberg, Aviad Rubinstein and Barna Saha,
STOC 2020.
Karthik C.S., Elazar Goldenberg,
Elazar Goldenberg, Robert Krauthgamer and Barna Saha,
Karthik C.S., Elazar Goldenberg,
Published in FSTTCS 2018, check here for the journal version published in TOCT.
Debarti Das, Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký and Michael Saks,
FOCS 2018 (best paper award).
Diptarka Chakraborty, Elazar Goldenberg and Michal Koucký,
submitted.
Roee David, Elazar Goldenberg and Robert Krauthgamer,
published in Random Structures & Algorithms.
Diptarka Chakraborty, Elazar Goldenberg and Michal Koucký
Direct Sum Testing (see also the journal version).
Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, and Igor Shinkar
ITCS2015 and published in SICOMP.
Irit Dinur and Elazar Goldenberg
Irit Dinur and Elazar Goldenberg
Irit Dinur and Elazar Goldenberg