- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j4 |      | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch sampling. Inf. Comput. 214: 112-118 (2012) |
| j3 | | Klim Efremenko: 3-Query Locally Decodable Codes of Subexponential Length. SIAM J. Comput. 41(6): 1694-1703 (2012) |
| c9 | | |
| 2011 | ||
| j2 | | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A black box for online approximate pattern matching. Inf. Comput. 209(4): 731-736 (2011) |
| i6 | | Klim Efremenko: From Irreducible Representations to Locally Decodable Codes. Electronic Colloquium on Computational Complexity (ECCC) 18: 154 (2011) |
| 2010 | ||
| j1 | | Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: Pattern matching with don't cares and few errors. J. Comput. Syst. Sci. 76(2): 115-124 (2010) |
| c8 | | Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma: Local List Decoding with a Constant Number of Queries. FOCS 2010: 715-722 |
| i5 | | Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma: Local list decoding with a constant number of queries. Electronic Colloquium on Computational Complexity (ECCC) 17: 47 (2010) |
| i4 | | Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma: A Note on Amplifying the Error-Tolerance of Locally Decodable Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 134 (2010) |
| 2009 | ||
| c7 | | |
| c6 | | Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: From coding theory to efficient pattern matching. SODA 2009: 778-784 |
| c5 | | |
| 2008 | ||
| c4 | | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A Black Box for Online Approximate Pattern Matching. CPM 2008: 143-151 |
| c3 | | |
| c2 | | Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch Sampling. SPIRE 2008: 99-108 |
| i3 | | Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild: Improved Deterministic Length Reduction. CoRR abs/0802.0017 (2008) |
| i2 | | Klim Efremenko, Ely Porat: Approximating General Metric Distances Between a Pattern and a Text. CoRR abs/0802.1427 (2008) |
| i1 | | Klim Efremenko: 3-Query Locally Decodable Codes of Subexponential Length. Electronic Colloquium on Computational Complexity (ECCC) 15(069) (2008) |
| 2007 | ||
| c1 | | Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: k -Mismatch with Don't Cares. ESA 2007: 151-162 |
| 1 | Amihood Amir | |
| 2 | Avraham Ben-Aroya | |
| 3 | Raphaël Clifford | |
| 4 | Oren Kapah | |
| 5 | Benny Porat | |
| 6 | Ely Porat | |
| 7 | Omer Reingold | |
| 8 | Amir Rothschild | |
| 9 | Amnon Ta-Shma |
Colors in the list of coauthors
Last update Mon May 20 06:58:51 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page