default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElazar Goldenberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Michal Koucký:
Many Flavors of Edit Distance. FSTTCS 2024: 11:1-11:16- [c14]Elazar Goldenberg, Mursalin Habib, Karthik C. S.:
Explicit Good Codes Approaching Distance 1 in Ulam Metric. ISIT 2024: 133-138 - [i17]Elazar Goldenberg, Mursalin Habib, Karthik C. S.:
Explicit Good Codes Approaching Distance 1 in Ulam Metric. CoRR abs/2401.17235 (2024) - [i16]Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Michal Koucký:
Many Flavors of Edit Distance. CoRR abs/2410.09877 (2024) - 2023
- [c13]Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier:
Can You Solve Closest String Faster Than Exhaustive Search? ESA 2023: 3:1-3:17 - [c12]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. ITCS 2023: 58:1-58:23 - [i15]Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier:
Can You Solve Closest String Faster than Exhaustive Search? CoRR abs/2305.16878 (2023) - 2022
- [c11]Elazar Goldenberg, Tomasz Kociumaka
, Robert Krauthgamer, Barna Saha:
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. FOCS 2022: 674-685 - [i14]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
An Algorithmic Bridge Between Hamming and Levenshtein Distances. CoRR abs/2211.12496 (2022) - 2021
- [i13]Elazar Goldenberg, Aviad Rubinstein, Barna Saha:
Does Preprocessing help in Fast Sequence Comparisons? CoRR abs/2108.09115 (2021) - [i12]Elazar Goldenberg, Tomasz Kociumaka, Robert Krauthgamer, Barna Saha:
Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal. CoRR abs/2111.12706 (2021) - 2020
- [j4]Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks:
Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. J. ACM 67(6): 36:1-36:22 (2020) - [j3]Elazar Goldenberg, Karthik C. S.:
Toward a General Direct Product Testing Theorem. ACM Trans. Comput. Theory 12(1): 7:1-7:18 (2020) - [c10]Elazar Goldenberg, Karthik C. S.:
Hardness Amplification of Optimization Problems. ITCS 2020: 1:1-1:13 - [c9]Elazar Goldenberg, Aviad Rubinstein, Barna Saha:
Does preprocessing help in fast sequence comparisons? STOC 2020: 657-670
2010 – 2019
- 2019
- [c8]Elazar Goldenberg, Robert Krauthgamer, Barna Saha:
Sublinear Algorithms for Gap Edit Distance. FOCS 2019: 1101-1120 - [i11]Elazar Goldenberg, Karthik C. S.:
Towards a General Direct Product Testing Theorem. CoRR abs/1901.06220 (2019) - [i10]Elazar Goldenberg, Karthik C. S.:
Hardness Amplification of Optimization Problems. CoRR abs/1908.10248 (2019) - [i9]Elazar Goldenberg, Robert Krauthgamer, Barna Saha:
Sublinear Algorithms for Gap Edit Distance. CoRR abs/1910.00901 (2019) - [i8]Elazar Goldenberg, Karthik C. S.:
Hardness Amplification of Optimization Problems. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c7]Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks:
Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. FOCS 2018: 979-990 - [c6]Elazar Goldenberg, Karthik C. S.:
Towards a General Direct Product Testing Theorem. FSTTCS 2018: 11:1-11:17 - [i7]Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks:
Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time. CoRR abs/1810.03664 (2018) - 2017
- [j2]Roee David, Elazar Goldenberg, Robert Krauthgamer:
Local reconstruction of low-rank matrices and subspaces. Random Struct. Algorithms 51(4): 607-630 (2017) - [j1]Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar:
Direct Sum Testing. SIAM J. Comput. 46(4): 1336-1369 (2017) - 2016
- [c5]Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký:
Streaming algorithms for embedding and computing edit distance in the low distance regime. STOC 2016: 712-725 - [i6]Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký:
Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees. CoRR abs/1607.03718 (2016) - 2015
- [c4]Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar:
Direct Sum Testing. ITCS 2015: 327-336 - [i5]Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký:
Low Distortion Embedding from Edit to Hamming Distance using Coupling. Electron. Colloquium Comput. Complex. TR15 (2015) - [i4]Roee David, Elazar Goldenberg, Robert Krauthgamer:
Local Reconstruction of Low-Rank Matrices and Subspaces. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i3]Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký:
Information Complexity for Multiparty Communication. Electron. Colloquium Comput. Complex. TR14 (2014) - [i2]Roee David, Irit Dinur, Elazar Goldenberg, Guy Kindler, Igor Shinkar:
Direct Sum Testing. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c3]Irit Dinur, Elazar Goldenberg:
Clustering in the Boolean Hypercube in a List Decoding Regime. ICALP (1) 2013: 413-424 - [i1]Irit Dinur, Elazar Goldenberg:
Clustering in the Boolean Hypercube in a List Decoding Regime. Electron. Colloquium Comput. Complex. TR13 (2013) - 2010
- [c2]Irit Dinur, Elazar Goldenberg:
The Structure of Winning Strategies in Parallel Repetition Games. APPROX-RANDOM 2010: 518-530
2000 – 2009
- 2008
- [c1]Irit Dinur, Elazar Goldenberg:
Locally Testing Direct Product in the Low Error Range. FOCS 2008: 613-622
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
