The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Moshe Lewenstein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
    Efficient Special Cases of Pattern Matching with Swaps. [Citation Graph (0, 0)][DBLP]
    CPM, 1998, pp:209-220 [Conf]
  2. Carmit Hazay, Moshe Lewenstein, Dekel Tsur
    Two Dimensional Parameterized Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:266-279 [Conf]
  3. Carmit Hazay, Moshe Lewenstein, Dina Sokol
    Approximate Parameterized Matching. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:414-425 [Conf]
  4. Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
    Pattern Matching with Swaps. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:144-153 [Conf]
  5. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:56-0 [Conf]
  6. Amihood Amir, Moshe Lewenstein, Ely Porat
    Approximate Swapped Matching. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2000, pp:302-311 [Conf]
  7. Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat
    Function Matching: Algorithms, Applications, and a Lower Bound. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:929-942 [Conf]
  8. Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
    Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:358-369 [Conf]
  9. 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]
  10. Amihood Amir, Ayelet Butman, Moshe Lewenstein
    Real scaled matching. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:815-816 [Conf]
  11. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
    Overlap matching. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:279-288 [Conf]
  12. Amihood Amir, Moshe Lewenstein, Ely Porat
    Faster algorithms for string matching with k mismatches. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:794-803 [Conf]
  13. Amihood Amir, Ely Porat, Moshe Lewenstein
    Approximate subset matching with Don't Cares. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:305-306 [Conf]
  14. Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini
    Dotted interval graphs and high throughput genotyping. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:339-348 [Conf]
  15. Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
    A faster implementation of the Goemans-Williamson clustering algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:17-25 [Conf]
  16. Richard Cole, Moshe Lewenstein
    Multidimensional matching and fast search in suffix trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:851-852 [Conf]
  17. Moshe Lewenstein, Maxim Sviridenko
    Approximating asymmetric maximum TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:646-654 [Conf]
  18. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
    Efficient One Dimensional Real Scaled Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:1-9 [Conf]
  19. Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
    Towards Real-Time Suffix Tree Construction. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:67-78 [Conf]
  20. Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein
    Dictionary matching and indexing with errors and don't cares. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:91-100 [Conf]
  21. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat
    Real Two Dimensional Scaled Matching. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:353-364 [Conf]
  22. Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
    Indexing and Dictionary Matching with One Error. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:181-192 [Conf]
  23. Amihood Amir, Moshe Lewenstein, Noa Lewenstein
    Pattern Matching In Hypertext. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:160-173 [Conf]
  24. Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
    Dynamic Text and Static Pattern Matching. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:340-352 [Conf]
  25. Zvi Gotthilf, Moshe Lewenstein
    Tighter Approximations for Maximum Induced Matchings in Regular Graphs. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:270-281 [Conf]
  26. Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein
    Uniquely Restricted Matchings. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:31, n:2, pp:139-154 [Journal]
  27. Martin Charles Golumbic, Moshe Lewenstein
    New results on induced matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:101, n:1-3, pp:157-165 [Journal]
  28. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat
    Overlap matching. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:181, n:1, pp:57-74 [Journal]
  29. Tirza Hirst, Moshe Lewenstein
    Alternation and Bounded Concurrency Are Reverse Equivalent. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1999, v:152, n:2, pp:173-187 [Journal]
  30. Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
    Efficient Special Cases of Pattern Matching with Swaps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:3, pp:125-132 [Journal]
  31. Amihood Amir, Moshe Lewenstein, Ely Porat
    Approximate swapped matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:1, pp:33-39 [Journal]
  32. Amihood Amir, Ayelet Butman, Moshe Lewenstein
    Real Scaled Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:4, pp:185-190 [Journal]
  33. Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko
    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:602-626 [Journal]
  34. Amihood Amir, Alberto Apostolico, Moshe Lewenstein
    Inverse Pattern Matching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:325-339 [Journal]
  35. Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein
    Pattern Matching with Swaps. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:247-266 [Journal]
  36. Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh
    Text Indexing and Dictionary Matching with One Error. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:37, n:2, pp:309-325 [Journal]
  37. Amihood Amir, Moshe Lewenstein, Noa Lewenstein
    Pattern Matching in Hypertext. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:1, pp:82-99 [Journal]
  38. Amihood Amir, Moshe Lewenstein, Ely Porat
    Faster algorithms for string matching with k mismatches. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:2, pp:257-275 [Journal]
  39. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur
    Efficient one-dimensional real scaled matching. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:205-211 [Journal]
  40. Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein
    Parameterized matching with mismatches. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:135-140 [Journal]
  41. David Gamarnik, Moshe Lewenstein, Maxim Sviridenko
    An improved upper bound for the TSP in cubic 3-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2005, v:33, n:5, pp:467-474 [Journal]
  42. Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat
    Function Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:5, pp:1007-1022 [Journal]
  43. Don Coppersmith, Moshe Lewenstein
    Constructive Bounds on Ordered Factorizations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:301-303 [Journal]
  44. Moshe Lewenstein, Maxim Sviridenko
    A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:2, pp:237-248 [Journal]
  45. Carmel Kent, Moshe Lewenstein, Dafna Sheinwald
    On Demand String Sorting over Unbounded Alphabets. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:16-27 [Conf]
  46. Amihood Amir, Johannes Fischer, Moshe Lewenstein
    Two-Dimensional Range Minimum Queries. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:286-294 [Conf]
  47. Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur
    Finding Witnesses by Peeling. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:28-39 [Conf]
  48. Tsvi Kopelowitz, Moshe Lewenstein
    Dynamic weighted ancestors. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:565-574 [Conf]
  49. Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz
    Optimization problems in multiple-interval graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:268-277 [Conf]
  50. Zvi Gotthilf, Moshe Lewenstein
    Approximating Constrained LCS. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:164-172 [Conf]
  51. Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
    Range Non-overlapping Indexing and Successive List Indexing. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:625-636 [Conf]
  52. Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol
    Dynamic text and static pattern matching. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]
  53. Carmit Hazay, Moshe Lewenstein, Dina Sokol
    Approximate parameterized matching. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal]

  54. On the Longest Common Parameterized Subsequence. [Citation Graph (, )][DBLP]


  55. Constrained LCS: Hardness and Approximation. [Citation Graph (, )][DBLP]


  56. Generalized Substring Compression. [Citation Graph (, )][DBLP]


  57. Improved Approximation Results on the Shortest Common Supersequence Problem. [Citation Graph (, )][DBLP]


  58. A Approximation Algorithm for the Minimum Maximal Matching Problem. [Citation Graph (, )][DBLP]


  59. Real Two Dimensional Scaled Matching. [Citation Graph (, )][DBLP]


  60. On the Longest Common Rigid Subsequence Problem. [Citation Graph (, )][DBLP]


  61. Permuted Common Supersequence [Citation Graph (, )][DBLP]


  62. Fast, precise and dynamic distance queries [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
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