Klim Efremenko

	2012
17		Klim Efremenko: From irreducible representations to locally decodable codes. STOC 2012: 327-338
16		Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch sampling. Inf. Comput. 214: 112-118 (2012)
	2011
15		Klim Efremenko: From Irreducible Representations to Locally Decodable Codes. Electronic Colloquium on Computational Complexity (ECCC) 18: 154 (2011)
	2010
14		Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma: Local List Decoding with a Constant Number of Queries. FOCS 2010: 715-722
13		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)
12		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)
11		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)
	2009
10		Klim Efremenko, Omer Reingold: How Well Do Random Walks Parallelize?. APPROX-RANDOM 2009: 476-489
9		Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: From coding theory to efficient pattern matching. SODA 2009: 778-784
8		Klim Efremenko: 3-query locally decodable codes of subexponential length. STOC 2009: 39-44
	2008
7		Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat: A Black Box for Online Approximate Pattern Matching. CPM 2008: 143-151
6		Ely Porat, Klim Efremenko: Approximating general metric distances between a pattern and a text. SODA 2008: 419-427
5		Raphaël Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild: Mismatch Sampling. SPIRE 2008: 99-108
4		Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild: Improved Deterministic Length Reduction CoRR abs/0802.0017: (2008)
3		Klim Efremenko, Ely Porat: Approximating General Metric Distances Between a Pattern and a Text CoRR abs/0802.1427: (2008)
2		Klim Efremenko: 3-Query Locally Decodable Codes of Subexponential Length. Electronic Colloquium on Computational Complexity (ECCC) 15(069): (2008)
	2007
1		Raphaël Clifford, Klim Efremenko, Ely Porat, Amir Rothschild: k -Mismatch with Don't Cares. ESA 2007: 151-162

Coauthor Index

1	Amihood Amir	[4]
2	Avraham Ben-Aroya	[12] [13] [14]
3	Raphaël Clifford	[1] [5] [7] [9] [11] [16]
4	Oren Kapah	[4]
5	Benny Porat	[5] [7] [16]
6	Ely Porat	[1] [3] [4] [5] [6] [7] [9] [11] [16]
7	Omer Reingold	[10]
8	Amir Rothschild	[1] [4] [5] [9] [11] [16]
9	Amnon Ta-Shma	[12] [13] [14]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page