Yury Lifshits

According to our database, Yury Lifshits authored at least 19 papers between 2003 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2012

Optimal Parameters for Locality-Sensitive Hashing.

Malcolm Slaney, Yury Lifshits, Junfeng He

Proc. IEEE, 2012

2010

Nearest neighbor search: algorithmic perspective.

Yury Lifshits

ACM SIGSPATIAL Special, 2010

Maximal Intersection Queries in Randomized Input Models.

Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits, Dirk Nowotka

Theory Comput. Syst., 2010

Tiling Periodicity.

Juhani Karhumäki, Yury Lifshits, Wojciech Rytter

Discret. Math. Theor. Comput. Sci., 2010

Evolution of two-sided markets.

Ravi Kumar, Yury Lifshits, Andrew Tomkins

Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

2009

Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions.

Yury Lifshits, Shay Mozes, Oren Weimann, Michal Ziv-Ukelson

Algorithmica, 2009

Conditional Probability Tree Estimation Analysis and Algorithms.

Alina Beygelzimer, John Langford, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl

Proceedings of the UAI 2009, 2009

Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design.

Yury Lifshits, Shengyu Zhang

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Combinatorial Framework for Similarity Search.

Yury Lifshits

Proceedings of the Second International Workshop on Similarity Search and Applications, 2009

2008

Disorder inequality: a combinatorial approach to nearest neighbor search.

Navin Goyal, Yury Lifshits, Hinrich Schütze

Proceedings of the International Conference on Web Search and Web Data Mining, 2008

2007

Estimation of the Click Volume by Large Scale Regression Analysis.

Yury Lifshits, Dirk Nowotka

Proceedings of the Computer Science, 2007

Maximal Intersection Queries in Randomized Graph Models.

Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka

Proceedings of the Computer Science, 2007

Decidability of Parameterized Probabilistic Information Flow.

Danièle Beauquier, Marie Duflot, Yury Lifshits

Proceedings of the Computer Science, 2007

Processing Compressed Texts: A Tractability Border.

Yury Lifshits

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

2006

Solving Classical String Problems on Compressed Texts

Yury Lifshits

CoRR, 2006

Querying and Embedding Compressed Texts.

Yury Lifshits, Markus Lohrey

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Solving Classical String Problems an Compressed Texts.

Yury Lifshits

Proceedings of the Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05., 2006

Window Subsequence Problems for Compressed Texts.

Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri V. Matiyasevich

Proceedings of the Computer Science, 2006

2003

A lower bound on the size of ε-free NFA corresponding to a regular expression.

Yury Lifshits

Inf. Process. Lett., 2003