Elazar Goldenberg

40 papers A* 6A 5B 1Journal 24Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. CoRR Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib, Bernhard Haeupler, Karthik C. S., Michal Koucký
2025	J	`jnl`	Explicit Good Codes Approaching Distance 1 in Ulam Metric. IEEE Trans. Inf. Theory Elazar Goldenberg, Mursalin Habib, Karthik C. S.
2025	A	`conf`	Hardness of Median and Center in the Ulam Metric. ESA Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S.
2025	J	`jnl`	Hardness of Median and Center in the Ulam Metric. CoRR Nick Fischer, Elazar Goldenberg, Mursalin Habib, Karthik C. S.
2024	B	`conf`	Explicit Good Codes Approaching Distance 1 in Ulam Metric. ISIT Elazar Goldenberg, Mursalin Habib, Karthik C. S.
2024	J	`jnl`	Explicit Good Codes Approaching Distance 1 in Ulam Metric. CoRR Elazar Goldenberg, Mursalin Habib, Karthik C. S.
2024	—	`conf`	Many Flavors of Edit Distance. FSTTCS Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Michal Koucký
2024	J	`jnl`	Many Flavors of Edit Distance. CoRR Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Michal Koucký
2023	A	`conf`	An Algorithmic Bridge Between Hamming and Levenshtein Distances. ITCS Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha
2023	A	`conf`	Can You Solve Closest String Faster Than Exhaustive Search? ESA Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier
2023	J	`jnl`	Can You Solve Closest String Faster than Exhaustive Search? CoRR Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier
2022	J	`jnl`	An Algorithmic Bridge Between Hamming and Levenshtein Distances. CoRR Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha
2022	A*	`conf`	Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. FOCS Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha
2021	J	`jnl`	Does Preprocessing help in Fast Sequence Comparisons? CoRR Elazar Goldenberg, Aviad Rubinstein, Barna Saha
2021	J	`jnl`	Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. CoRR Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha
2020	J	`jnl`	Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. J. ACM Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2020	A*	`conf`	Does preprocessing help in fast sequence comparisons? STOC Elazar Goldenberg, Aviad Rubinstein, Barna Saha
2020	A	`conf`	Hardness Amplification of Optimization Problems. ITCS Elazar Goldenberg, Karthik C. S.
2020	J	`jnl`	Toward a General Direct Product Testing Theorem. ACM Trans. Comput. Theory Elazar Goldenberg, Karthik C. S.
2019	J	`jnl`	Hardness Amplification of Optimization Problems. CoRR Elazar Goldenberg, Karthik C. S.
2019	J	`jnl`	Hardness Amplification of Optimization Problems. Electron. Colloquium Comput. Complex. Elazar Goldenberg, Karthik C. S.
2019	A*	`conf`	Sublinear Algorithms for Gap Edit Distance. FOCS Elazar Goldenberg, Robert Krauthgamer, Barna Saha
2019	J	`jnl`	Sublinear Algorithms for Gap Edit Distance. CoRR Elazar Goldenberg, Robert Krauthgamer, Barna Saha
2019	J	`jnl`	Towards a General Direct Product Testing Theorem. CoRR Elazar Goldenberg, Karthik C. S.
2018	J	`jnl`	Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time. CoRR Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2018	A*	`conf`	Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. FOCS Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2018	—	`conf`	Towards a General Direct Product Testing Theorem. FSTTCS Elazar Goldenberg, Karthik C. S.
2017	J	`jnl`	Direct Sum Testing. SIAM J. Comput. Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
2017	J	`jnl`	Local reconstruction of low-rank matrices and subspaces. Random Struct. Algorithms Roee David, Elazar Goldenberg, Robert Krauthgamer
2016	J	`jnl`	Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees. CoRR Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
2016	A*	`conf`	Streaming algorithms for embedding and computing edit distance in the low distance regime. STOC Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
2015	A	`conf`	Direct Sum Testing. ITCS Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
2015	J	`jnl`	Local Reconstruction of Low-Rank Matrices and Subspaces. Electron. Colloquium Comput. Complex. Roee David, Elazar Goldenberg, Robert Krauthgamer
2015	J	`jnl`	Low Distortion Embedding from Edit to Hamming Distance using Coupling. Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
2014	J	`jnl`	Direct Sum Testing. Electron. Colloquium Comput. Complex. Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar
2014	J	`jnl`	Information Complexity for Multiparty Communication. Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
2013	—	`conf`	Clustering in the Boolean Hypercube in a List Decoding Regime. ICALP (1) Irit Dinur, Elazar Goldenberg
2013	J	`jnl`	Clustering in the Boolean Hypercube in a List Decoding Regime. Electron. Colloquium Comput. Complex. Irit Dinur, Elazar Goldenberg
2010	—	`conf`	The Structure of Winning Strategies in Parallel Repetition Games. APPROX-RANDOM Irit Dinur, Elazar Goldenberg
2008	A*	`conf`	Locally Testing Direct Product in the Low Error Range. FOCS Irit Dinur, Elazar Goldenberg