Locally Testing Direct Product in the Low Error Range. - Irit Dinur; Elazar Goldenberg (FOCS, 2008)

The Structure of Winning Strategies in Parallel Repetition Games. - Irit Dinur; Elazar Goldenberg (APPROX-RANDOM, 2010)

Clustering in the Boolean Hypercube in a List Decoding Regime. - Irit Dinur; Elazar Goldenberg (ICALP (1), 2013)

Information Complexity for Multiparty Communication. - Diptarka Chakraborty; Elazar Goldenberg; Michal Koucký 001 (Electron. Colloquium Comput. Complex., 2014)

Direct Sum Testing. - Roee David; Irit Dinur; Elazar Goldenberg; Guy Kindler; Igor Shinkar (ITCS, 2015)

Low Distortion Embedding from Edit to Hamming Distance using Coupling. - Diptarka Chakraborty; Elazar Goldenberg; Michal Koucký 001 (Electron. Colloquium Comput. Complex., 2015)

Local Reconstruction of Low-Rank Matrices and Subspaces. - Roee David; Elazar Goldenberg; Robert Krauthgamer (Electron. Colloquium Comput. Complex., 2015)

Streaming algorithms for embedding and computing edit distance in the low distance regime. - Diptarka Chakraborty; Elazar Goldenberg; Michal Koucký 001 (STOC, 2016)

Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees. - Diptarka Chakraborty; Elazar Goldenberg; Michal Koucký 001 (CoRR, 2016)

Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. - Diptarka Chakraborty; Debarati Das 001; Elazar Goldenberg; Michal Koucký 001; Michael E. Saks (FOCS, 2018)

Towards a General Direct Product Testing Theorem. - Elazar Goldenberg; Karthik C. S. 001 (FSTTCS, 2018)

Sublinear Algorithms for Gap Edit Distance. - Elazar Goldenberg; Robert Krauthgamer; Barna Saha (FOCS, 2019)

Hardness Amplification of Optimization Problems. - Elazar Goldenberg; Karthik C. S. 001 (ITCS, 2020)

Does preprocessing help in fast sequence comparisons? - Elazar Goldenberg; Aviad Rubinstein; Barna Saha (STOC, 2020)

Toward a General Direct Product Testing Theorem. - Elazar Goldenberg; Karthik C. S. 001 (ACM Trans. Comput. Theory, 2020)

Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. - Elazar Goldenberg; Tomasz Kociumaka; Robert Krauthgamer; Barna Saha (FOCS, 2022)

Can You Solve Closest String Faster Than Exhaustive Search? - Amir Abboud; Nick Fischer; Elazar Goldenberg; Karthik C. S. 001; Ron Safier (ESA, 2023)

An Algorithmic Bridge Between Hamming and Levenshtein Distances. - Elazar Goldenberg; Tomasz Kociumaka; Robert Krauthgamer; Barna Saha (ITCS, 2023)

Many Flavors of Edit Distance. - Sudatta Bhattacharya; Sanjana Dey; Elazar Goldenberg; Michal Koucký 001 (FSTTCS, 2024)

Explicit Good Codes Approaching Distance 1 in Ulam Metric. - Elazar Goldenberg; Mursalin Habib; Karthik C. S. 001 (ISIT, 2024)

Hardness of Median and Center in the Ulam Metric. - Nick Fischer; Elazar Goldenberg; Mursalin Habib; Karthik C. S. 001 (ESA, 2025)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. - Sudatta Bhattacharya; Sanjana Dey; Elazar Goldenberg; Mursalin Habib; Bernhard Haeupler; Karthik C. S. 001; Michal Koucký 001 (CoRR, 2025)