The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yury Lifshits: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Patrick Cégielski, Irène Guessarian, Yury Lifshits, Yuri Matiyasevich
    Window Subsequence Problems for Compressed Texts. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:127-136 [Conf]
  2. Yury Lifshits, Markus Lohrey
    Querying and Embedding Compressed Texts. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:681-692 [Conf]
  3. Yury Lifshits
    A lower bound on the size of [epsiv]-free NFA corresponding to a regular expression. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:6, pp:293-299 [Journal]
  4. Juhani Karhumäki, Yury Lifshits, Wojciech Rytter
    Tiling Periodicity. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:295-306 [Conf]
  5. Yury Lifshits
    Processing Compressed Texts: A Tractability Border. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:228-240 [Conf]
  6. Danièle Beauquier, Marie Duflot, Yury Lifshits
    Decidability of Parameterized Probabilistic Information Flow. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:82-91 [Conf]
  7. Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
    Maximal Intersection Queries in Randomized Graph Models. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:227-236 [Conf]
  8. Yury Lifshits, Dirk Nowotka
    Estimation of the Click Volume by Large Scale Regression Analysis. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:216-226 [Conf]
  9. Yury Lifshits
    Solving Classical String Problems on Compressed Texts [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  10. Solving Classical String Problems an Compressed Texts. [Citation Graph (, )][DBLP]


  11. Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. [Citation Graph (, )][DBLP]


  12. Disorder inequality: a combinatorial approach to nearest neighbor search. [Citation Graph (, )][DBLP]


  13. Evolution of two-sided markets. [Citation Graph (, )][DBLP]


  14. Combinatorial Framework for Similarity Search. [Citation Graph (, )][DBLP]


  15. Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions. [Citation Graph (, )][DBLP]


  16. Conditional Probability Tree Estimation Analysis and Algorithms [Citation Graph (, )][DBLP]


  17. Maximal Intersection Queries in Randomized Input Models [Citation Graph (, )][DBLP]


Search in 0.014secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002