default search action
Yury Lifshits
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [i5]Alina Beygelzimer, John Langford, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl:
Conditional Probability Tree Estimation Analysis and Algorithms. CoRR abs/1408.2031 (2014) - 2012
- [j6]Malcolm Slaney
, Yury Lifshits, Junfeng He:
Optimal Parameters for Locality-Sensitive Hashing. Proc. IEEE 100(9): 2604-2623 (2012) - 2010
- [j5]Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. Discret. Math. Theor. Comput. Sci. 12(2): 237-248 (2010) - [j4]Benjamin Hoffmann, Mikhail Lifshits
Maximal Intersection Queries in Randomized Input Models. Theory Comput. Syst. 46(1): 104-119 (2010) - [j3]Yury Lifshits:
Nearest neighbor search: algorithmic perspective. ACM SIGSPATIAL Special 2(2): 12-15 (2010) - [c12]Ravi Kumar, Yury Lifshits, Andrew Tomkins:
Evolution of two-sided markets. WSDM 2010: 311-320 - [i4]Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits, Dirk Nowotka:
Maximal Intersection Queries in Randomized Input Models. CoRR abs/1004.0092 (2010)
2000 – 2009
- 2009
- [j2]Yury Lifshits, Shay Mozes
Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. Algorithmica 54(3): 379-399 (2009) - [c11]Yury Lifshits:
Combinatorial Framework for Similarity Search. SISAP 2009: 11-17 - [c10]Yury Lifshits, Shengyu Zhang:
Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. SODA 2009: 318-326 - [c9]Alina Beygelzimer, John Langford, Yury Lifshits, Gregory B. Sorkin, Alexander L. Strehl:
Conditional Probability Tree Estimation Analysis and Algorithms. UAI 2009: 51-58 - [i3]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
- [c8]Navin Goyal, Yury Lifshits, Hinrich Schütze:
Disorder inequality: a combinatorial approach to nearest neighbor search. WSDM 2008: 25-32 - 2007
- [c7]Yury Lifshits:
Processing Compressed Texts: A Tractability Border. CPM 2007: 228-240 - [c6]Juhani Karhumäki, Yury Lifshits, Wojciech Rytter:
Tiling Periodicity. CPM 2007: 295-306 - [c5]Danièle Beauquier, Marie Duflot
Decidability of Parameterized Probabilistic Information Flow. CSR 2007: 82-91 - [c4]Yury Lifshits, Dirk Nowotka:
Estimation of the Click Volume by Large Scale Regression Analysis. CSR 2007: 216-226 - [c3]Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka:
Maximal Intersection Queries in Randomized Graph Models. CSR 2007: 227-236 - 2006
- [c2]Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri V. Matiyasevich:
Window Subsequence Problems for Compressed Texts. CSR 2006: 127-136 - [c1]Yury Lifshits, Markus Lohrey:
Querying and Embedding Compressed Texts. MFCS 2006: 681-692 - [i2]Yury Lifshits:
Solving Classical String Problems an Compressed Texts. Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006 - [i1]Yury Lifshits:
Solving Classical String Problems on Compressed Texts. CoRR abs/cs/0604058 (2006) - 2003
- [j1]Yury Lifshits:
A lower bound on the size of ε-free NFA corresponding to a regular expression. Inf. Process. Lett. 85(6): 293-299 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: