| * | 2009 |
|---|
| 10 | EE | Klim Efremenko,
Omer Reingold:
How Well Do Random Walks Parallelize?.
APPROX-RANDOM 2009: 476-489 |
| 9 | EE | Raphaël Clifford,
Klim Efremenko,
Ely Porat,
Amir Rothschild:
From coding theory to efficient pattern matching.
SODA 2009: 778-784 |
| 8 | EE | Klim Efremenko:
3-query locally decodable codes of subexponential length.
STOC 2009: 39-44 |
| 2008 |
|---|
| 7 | EE | Raphaël Clifford,
Klim Efremenko,
Benny Porat,
Ely Porat:
A Black Box for Online Approximate Pattern Matching.
CPM 2008: 143-151 |
| 6 | EE | Ely Porat,
Klim Efremenko:
Approximating general metric distances between a pattern and a text.
SODA 2008: 419-427 |
| 5 | EE | Raphaël Clifford,
Klim Efremenko,
Benny Porat,
Ely Porat,
Amir Rothschild:
Mismatch Sampling.
SPIRE 2008: 99-108 |
| 4 | EE | Amihood Amir,
Klim Efremenko,
Oren Kapah,
Ely Porat,
Amir Rothschild:
Improved Deterministic Length Reduction
CoRR abs/0802.0017: (2008) |
| 3 | EE | Klim Efremenko,
Ely Porat:
Approximating General Metric Distances Between a Pattern and a Text
CoRR abs/0802.1427: (2008) |
| 2 | EE | Klim Efremenko:
3-Query Locally Decodable Codes of Subexponential Length.
Electronic Colloquium on Computational Complexity (ECCC) 15(069): (2008) |
| 2007 |
|---|
| 1 | EE | Raphaël Clifford,
Klim Efremenko,
Ely Porat,
Amir Rothschild:
k -Mismatch with Don't Cares.
ESA 2007: 151-162 |
