| 2009 |
|---|
| 12 | EE | Yury Lifshits,
Shengyu Zhang:
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design.
SODA 2009: 318-326 |
| 2008 |
|---|
| 11 | EE | Navin Goyal,
Yury Lifshits,
Hinrich Schütze:
Disorder inequality: a combinatorial approach to nearest neighbor search.
WSDM 2008: 25-32 |
| 2007 |
|---|
| 10 | EE | Yury Lifshits:
Processing Compressed Texts: A Tractability Border.
CPM 2007: 228-240 |
| 9 | EE | Juhani Karhumäki,
Yury Lifshits,
Wojciech Rytter:
Tiling Periodicity.
CPM 2007: 295-306 |
| 8 | EE | Yury Lifshits,
Dirk Nowotka:
Estimation of the Click Volume by Large Scale Regression Analysis.
CSR 2007: 216-226 |
| 7 | EE | Benjamin Hoffmann,
Yury Lifshits,
Dirk Nowotka:
Maximal Intersection Queries in Randomized Graph Models.
CSR 2007: 227-236 |
| 6 | EE | Danièle Beauquier,
Marie Duflot,
Yury Lifshits:
Decidability of Parameterized Probabilistic Information Flow.
CSR 2007: 82-91 |
| 2006 |
|---|
| 5 | EE | Patrick Cégielski,
Irène Guessarian,
Yury Lifshits,
Yuri Matiyasevich:
Window Subsequence Problems for Compressed Texts.
CSR 2006: 127-136 |
| 4 | EE | Yury Lifshits:
Solving Classical String Problems an Compressed Texts.
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 |
| 3 | EE | Yury Lifshits,
Markus Lohrey:
Querying and Embedding Compressed Texts.
MFCS 2006: 681-692 |
| 2 | EE | Yury Lifshits:
Solving Classical String Problems on Compressed Texts
CoRR abs/cs/0604058: (2006) |
| 2003 |
|---|
| 1 | EE | Yury Lifshits:
A lower bound on the size of [epsiv]-free NFA corresponding to a regular expression.
Inf. Process. Lett. 85(6): 293-299 (2003) |
