The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ohad Lipsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski
    Approximate Matching in the L1 Metric. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:91-103 [Conf]
  2. Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat
    Closest Pair Problems in Very High Dimensions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:782-792 [Conf]
  3. Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne
    Pattern matching with address errors: rearrangement distances. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1221-1229 [Conf]
  4. Ohad Lipsky, Ely Porat
    L1 Pattern Matching Lower Bound. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:327-330 [Conf]
  5. Ohad Lipsky, Ely Porat
    Approximate Matching in the Linfinity Metric. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:331-334 [Conf]
  6. Ely Porat, Ohad Lipsky
    Improved Sketching of Hamming Distance with Error Correcting. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:173-182 [Conf]
  7. Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur
    Approximate Swap and Mismatch Edit Distance. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:149-163 [Conf]

  8. Approximate String Matching with Swap and Mismatch. [Citation Graph (, )][DBLP]


  9. Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
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