| 2010 | ||
|---|---|---|
| 21 | Ravi Kumar, Yury Lifshits, Andrew Tomkins: Evolution of two-sided markets. WSDM 2010: 311-320 | |
| 20 | Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits, Dirk Nowotka: Maximal Intersection Queries in Randomized Input Models CoRR abs/1004.0092: (2010) | |
| 19 | Juhani Karhumäki, Yury Lifshits, Wojciech Rytter: Tiling Periodicity. Discrete Mathematics & Theoretical Computer Science 12(2): 237-248 (2010) | |
| 18 | Yury Lifshits: Nearest neighbor search: algorithmic perspective. SIGSPATIAL Special 2(2): 12-15 (2010) | |
| 17 | Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits, Dirk Nowotka: Maximal Intersection Queries in Randomized Input Models. Theory Comput. Syst. 46(1): 104-119 (2010) | |
| 2009 | ||
| 16 | Yury Lifshits: Combinatorial Framework for Similarity Search. SISAP 2009: 11-17 | |
| 15 | Yury Lifshits, Shengyu Zhang: Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. SODA 2009: 318-326 | |
| 14 | Alina Beygelzimer, John Langford, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl: Conditional Probability Tree Estimation Analysis and Algorithms. UAI 2009: 51-58 | |
| 13 | Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson: Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica 54(3): 379-399 (2009) | |
| 12 | Alina Beygelzimer, John Langford, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl: Conditional Probability Tree Estimation Analysis and Algorithms CoRR abs/0903.4217: (2009) | |
| 2008 | ||
| 11 | Navin Goyal, Yury Lifshits, Hinrich Schütze: Disorder inequality: a combinatorial approach to nearest neighbor search. WSDM 2008: 25-32 | |
| 2007 | ||
| 10 | Yury Lifshits: Processing Compressed Texts: A Tractability Border. CPM 2007: 228-240 | |
| 9 | Juhani Karhumäki, Yury Lifshits, Wojciech Rytter: Tiling Periodicity. CPM 2007: 295-306 | |
| 8 | Yury Lifshits, Dirk Nowotka: Estimation of the Click Volume by Large Scale Regression Analysis. CSR 2007: 216-226 | |
| 7 | Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka: Maximal Intersection Queries in Randomized Graph Models. CSR 2007: 227-236 | |
| 6 | Danièle Beauquier, Marie Duflot, Yury Lifshits: Decidability of Parameterized Probabilistic Information Flow. CSR 2007: 82-91 | |
| 2006 | ||
| 5 | Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri Matiyasevich: Window Subsequence Problems for Compressed Texts. CSR 2006: 127-136 | |
| 4 | Yury Lifshits: Solving Classical String Problems an Compressed Texts. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 | |
| 3 | Yury Lifshits, Markus Lohrey: Querying and Embedding Compressed Texts. MFCS 2006: 681-692 | |
| 2 | Yury Lifshits: Solving Classical String Problems on Compressed Texts CoRR abs/cs/0604058: (2006) | |
| 2003 | ||
| 1 | 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) | |
| 1 | Danièle Beauquier | [6] |
| 2 | Alina Beygelzimer | [12] [14] |
| 3 | Patrick Cégielski | [5] |
| 4 | Marie Duflot | [6] |
| 5 | Navin Goyal | [11] |
| 6 | Irène Guessarian | [5] |
| 7 | Benjamin Hoffmann | [7] [17] [20] |
| 8 | Juhani Karhumäki | [9] [19] |
| 9 | Ravi Kumar (S. Ravi Kumar) | [21] |
| 10 | John Langford | [12] [14] |
| 11 | Mikhail Lifshits | [17] [20] |
| 12 | Markus Lohrey | [3] |
| 13 | Yuri Matiyasevich | [5] |
| 14 | Shay Mozes | [13] |
| 15 | Dirk Nowotka | [7] [8] [17] [20] |
| 16 | Wojciech Rytter | [9] [19] |
| 17 | Hinrich Schütze | [11] |
| 18 | Gregory B. Sorkin | [12] [14] |
| 19 | Alexander L. Strehl | [12] [14] |
| 20 | Andrew Tomkins | [21] |
| 21 | Oren Weimann | [13] |
| 22 | Shengyu Zhang | [15] |
| 23 | Michal Ziv-Ukelson | [13] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page