default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMoshe Lewenstein
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c73]Philip Bille
, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. STACS 2024: 16:1-16:21- 2023
- [c72]Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia:
String Factorization via Prefix Free Families. CPM 2023: 19:1-19:10 - 2022
- [i19]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. CoRR abs/2211.16860 (2022)
2010 – 2019
- 2019
- [j43]Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover? Algorithmica 81(7): 2857-2875 (2019) - [c71]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. ISAAC 2019: 7:1-7:22 - [i18]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. CoRR abs/1910.00831 (2019) - 2018
- [c70]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Improved Space-Time Tradeoffs for kSUM. ESA 2018: 37:1-37:14 - [i17]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Improved Space-Time Tradeoffs for kSUM. CoRR abs/1807.03718 (2018) - 2017
- [j42]Hicham El-Zein, Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Timothy M. Chan:
On the Succinct Representation of Equivalence Classes. Algorithmica 78(3): 1020-1040 (2017) - [c69]Amihood Amir, Avivit Levy, Moshe Lewenstein, Ronit Lubin, Benny Porat:
Can We Recover the Cover?. CPM 2017: 25:1-25:15 - [c68]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Orthogonal Vectors Indexing. ISAAC 2017: 40:1-40:12 - [c67]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Conditional Lower Bounds for Space/Time Tradeoffs. WADS 2017: 421-436 - [i16]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
How Hard is it to Find (Honest) Witnesses? CoRR abs/1706.05815 (2017) - [i15]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Conditional Lower Bounds for Space/Time Tradeoffs. CoRR abs/1706.05847 (2017) - [i14]Isaac Goldstein, Moshe Lewenstein, Ely Porat:
Orthogonal Vectors Indexing. CoRR abs/1710.00586 (2017) - 2016
- [j41]Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Document retrieval with one wildcard. Theor. Comput. Sci. 635: 94-101 (2016) - [j40]Gary Benson, Martin Farach-Colton, Moshe Lewenstein, Ely Porat:
Special issue in honor of the 60th birthday of Amihood Amir. Theor. Comput. Sci. 638: 1-2 (2016) - [j39]Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, Srinivasa Rao Satti:
Two dimensional range minimum queries and Fibonacci lattices. Theor. Comput. Sci. 638: 33-43 (2016) - [c66]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
How Hard is it to Find (Honest) Witnesses?. ESA 2016: 45:1-45:16 - [e3]Roberto Grossi, Moshe Lewenstein:
27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. LIPIcs 54, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-012-5 [contents] - [r4]Moshe Lewenstein:
Dictionary Matching. Encyclopedia of Algorithms 2016: 533-538 - [r3]Moshe Lewenstein:
Parameterized Pattern Matching. Encyclopedia of Algorithms 2016: 1525-1530 - [i13]Moshe Lewenstein, Seth Pettie, Virginia Vassilevska Williams:
Structure and Hardness in P (Dagstuhl Seminar 16451). Dagstuhl Reports 6(11): 1-34 (2016) - 2015
- [j38]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. Algorithmica 72(2): 450-466 (2015) - [c65]Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. CPM 2015: 65-76 - [c64]Timothy M. Chan, Moshe Lewenstein:
Fast String Dictionary Lookup with One Error. CPM 2015: 114-123 - [c63]Pooya Davoodi, John Iacono, Gad M. Landau, Moshe Lewenstein:
Range Minimum Query Indexes in Higher Dimensions. CPM 2015: 149-159 - [c62]Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein:
Beyond the Runs Theorem. SPIRE 2015: 277-286 - [c61]Amihood Amir, Moshe Lewenstein, Sharma V. Thankachan:
Range LCP Queries Revisited. SPIRE 2015: 350-361 - [c60]Timothy M. Chan, Moshe Lewenstein:
Clustered Integer 3SUM via Additive Combinatorics. STOC 2015: 31-40 - [i12]Timothy M. Chan, Moshe Lewenstein:
Clustered Integer 3SUM via Additive Combinatorics. CoRR abs/1502.05204 (2015) - [i11]Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. CoRR abs/1504.02671 (2015) - 2014
- [j37]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. J. Comput. Syst. Sci. 80(7): 1245-1253 (2014) - [j36]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43(4): 1396-1416 (2014) - [j35]Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur:
Two-Dimensional Parameterized Matching. ACM Trans. Algorithms 11(2): 12:1-12:30 (2014) - [j34]Orgad Keller, Tsvi Kopelowitz, Shir Landau Feibish, Moshe Lewenstein:
Generalized substring compression. Theor. Comput. Sci. 525: 42-54 (2014) - [j33]Isaac Goldstein, Moshe Lewenstein:
Quick greedy computation for minimum common string partition. Theor. Comput. Sci. 542: 98-107 (2014) - [j32]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan:
Less space: Indexing for queries with wildcards. Theor. Comput. Sci. 557: 120-127 (2014) - [c59]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Hypertext Searching - A Survey. Language, Culture, Computation (1) 2014: 364-381 - [c58]Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson:
Weighted Ancestors in Suffix Trees. ESA 2014: 455-466 - [c57]Moshe Lewenstein, J. Ian Munro, Patrick K. Nicholson, Venkatesh Raman:
Improved Explicit Data Structures in the Bitprobe Model. ESA 2014: 630-641 - [c56]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. ICALP (1) 2014: 114-125 - [c55]Moshe Lewenstein, J. Ian Munro, Yakov Nekrich, Sharma V. Thankachan:
Document Retrieval with One Wildcard. MFCS (2) 2014: 529-540 - [c54]Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter:
Space-Efficient String Indexing for Wildcard Pattern Matching. STACS 2014: 506-517 - [i10]Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter:
Space-Efficient String Indexing for Wildcard Pattern Matching. CoRR abs/1401.0625 (2014) - [i9]Amihood Amir, Timothy M. Chan, Moshe Lewenstein, Noa Lewenstein:
On Hardness of Jumbled Indexing. CoRR abs/1405.0189 (2014) - [i8]Pawel Gawrychowski, Moshe Lewenstein, Patrick K. Nicholson:
Weighted ancestors in suffix trees. CoRR abs/1406.7716 (2014) - 2013
- [c53]Moshe Lewenstein:
Orthogonal Range Searching for Text Indexing. Space-Efficient Data Structures, Streams, and Algorithms 2013: 267-302 - [c52]Moshe Lewenstein:
LCP Magic. CPM 2013: 11 - [c51]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan:
Less Space: Indexing for Queries with Wildcards. ISAAC 2013: 89-99 - [c50]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct Data Structures for Representing Equivalence Classes. ISAAC 2013: 502-512 - [c49]Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. WADS 2013: 390-401 - [e2]Oren Kurland, Moshe Lewenstein, Ely Porat:
String Processing and Information Retrieval - 20th International Symposium, SPIRE 2013, Jerusalem, Israel, October 7-9, 2013, Proceedings. Lecture Notes in Computer Science 8214, Springer 2013, ISBN 978-3-319-02431-8 [contents] - [i7]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR abs/1306.0406 (2013) - [i6]Moshe Lewenstein:
Orthogonal Range Searching for Text Indexing. CoRR abs/1306.0615 (2013) - [i5]Moshe Lewenstein, J. Ian Munro, Venkatesh Raman:
Succinct data structures for representing equivalence classes. CoRR abs/1306.4287 (2013) - [i4]Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty:
Finding the Minimum-Weight k-Path. CoRR abs/1307.2415 (2013) - [i3]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. CoRR abs/1311.1762 (2013) - 2012
- [j31]Hideo Bannai, Travis Gagie, Tomohiro I, Shunsuke Inenaga, Gad M. Landau, Moshe Lewenstein:
An efficient algorithm to test square-freeness of strings compressed by straight-line programs. Inf. Process. Lett. 112(19): 711-714 (2012) - [j30]Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini:
Dotted interval graphs. ACM Trans. Algorithms 8(2): 9:1-9:21 (2012) - [j29]Carmel Kent, Moshe Lewenstein, Dafna Sheinwald:
On demand string sorting over unbounded alphabets. Theor. Comput. Sci. 426: 66-74 (2012) - [c48]Gerth Stølting Brodal, Pooya Davoodi, Moshe Lewenstein, Rajeev Raman, S. Srinivasa Rao:
Two Dimensional Range Minimum Queries and Fibonacci Lattices. ESA 2012: 217-228 - [c47]Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki:
Forbidden Patterns. LATIN 2012: 327-337 - [c46]Lap-Kei Lee, Moshe Lewenstein, Qin Zhang:
Parikh Matching in the Streaming Model. SPIRE 2012: 336-341 - 2011
- [j28]Moshe Lewenstein, Gabriel Valiente:
CPM 2006. J. Discrete Algorithms 9(4): 313 (2011) - [j27]Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding witnesses by peeling. ACM Trans. Algorithms 7(2): 24:1-24:15 (2011) - [c45]Isaac Goldstein, Moshe Lewenstein:
Quick Greedy Computation for Minimum Common String Partitions. CPM 2011: 273-284 - [c44]Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa:
Restricted Common Superstring and Restricted Common Supersequence. CPM 2011: 467-478 - [c43]Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat:
Range LCP. ISAAC 2011: 683-692 - [c42]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. SODA 2011: 840-853 - [c41]Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Persistency in Suffix Trees with Applications to String Interval Problems. SPIRE 2011: 67-80 - [c40]Moshe Lewenstein:
Indexing with Gaps. SPIRE 2011: 135-143 - 2010
- [j26]Nikhil Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang:
On the Longest Common Rigid Subsequence Problem. Algorithmica 56(2): 270-280 (2010) - [j25]Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz:
Optimization problems in multiple-interval graphs. ACM Trans. Algorithms 6(2): 40:1-40:18 (2010) - [c39]Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein:
Restricted LCS. SPIRE 2010: 250-257 - [c38]Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa:
On Shortest Common Superstring and Swap Permutations. SPIRE 2010: 270-278 - [i2]Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa:
Permuted Common Supersequence. CoRR abs/1004.0424 (2010) - [i1]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. CoRR abs/1008.1480 (2010)
2000 – 2009
- 2009
- [j24]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009) - [j23]Zvi Gotthilf, Moshe Lewenstein:
Improved algorithms for the k simple shortest paths and the replacement paths problems. Inf. Process. Lett. 109(7): 352-355 (2009) - [j22]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the longest common parameterized subsequence. Theor. Comput. Sci. 410(51): 5347-5353 (2009) - [c37]Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein:
Generalized Substring Compression. CPM 2009: 26-38 - [c36]Zvi Gotthilf, Moshe Lewenstein:
Improved Approximation Results on the Shortest Common Supersequence Problem. SPIRE 2009: 277-284 - 2008
- [c35]Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein:
Constrained LCS: Hardness and Approximation. CPM 2008: 255-262 - [c34]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the Longest Common Parameterized Subsequence. CPM 2008: 303-315 - [c33]Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt:
A Approximation Algorithm for the Minimum Maximal Matching Problem. WAOA 2008: 267-278 - [r2]Moshe Lewenstein:
Dictionary Matching and Indexing (Exact and with Errors). Encyclopedia of Algorithms 2008 - [r1]Moshe Lewenstein:
Parameterized Matching. Encyclopedia of Algorithms 2008 - 2007
- [j21]Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein:
Parameterized matching with mismatches. J. Discrete Algorithms 5(1): 135-140 (2007) - [j20]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur:
Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007) - [j19]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2): 19 (2007) - [j18]Carmit Hazay, Moshe Lewenstein, Dina Sokol:
Approximate parameterized matching. ACM Trans. Algorithms 3(3): 29 (2007) - [c32]Carmel Kent, Moshe Lewenstein, Dafna Sheinwald:
On Demand String Sorting over Unbounded Alphabets. CPM 2007: 16-27 - [c31]Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur:
Finding Witnesses by Peeling. CPM 2007: 28-39 - [c30]Amihood Amir, Johannes Fischer, Moshe Lewenstein:
Two-Dimensional Range Minimum Queries. CPM 2007: 286-294 - [c29]Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz:
Optimization problems in multiple-interval graphs. SODA 2007: 268-277 - [c28]Tsvi Kopelowitz, Moshe Lewenstein:
Dynamic weighted ancestors. SODA 2007: 565-574 - [c27]Zvi Gotthilf, Moshe Lewenstein:
Approximating Constrained LCS. SPIRE 2007: 164-172 - [c26]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
Range Non-overlapping Indexing and Successive List Indexing. WADS 2007: 625-636 - 2006
- [j17]Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat:
Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006) - [c25]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) 2006: 358-369 - [e1]Moshe Lewenstein, Gabriel Valiente:
Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings. Lecture Notes in Computer Science 4009, Springer 2006, ISBN 3-540-35455-7 [contents] - 2005
- [j16]Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. J. ACM 52(4): 602-626 (2005) - [j15]David Gamarnik, Moshe Lewenstein, Maxim Sviridenko:
An improved upper bound for the TSP in cubic 3-edge-connected graphs. Oper. Res. Lett. 33(5): 467-474 (2005) - [j14]Don Coppersmith, Moshe Lewenstein:
Constructive Bounds on Ordered Factorizations. SIAM J. Discret. Math. 19(2): 301-303 (2005) - [c24]Carmit Hazay, Moshe Lewenstein, Dekel Tsur:
Two Dimensional Parameterized Matching. CPM 2005: 266-279 - [c23]Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini:
Dotted interval graphs and high throughput genotyping. SODA 2005: 339-348 - [c22]Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78 - [c21]Zvi Gotthilf, Moshe Lewenstein:
Tighter Approximations for Maximum Induced Matchings in Regular Graphs. WAOA 2005: 270-281 - 2004
- [j13]Amihood Amir, Moshe Lewenstein, Ely Porat:
Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004) - [c20]Carmit Hazay, Moshe Lewenstein, Dina Sokol:
Approximate Parameterized Matching. ESA 2004: 414-425 - [c19]Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat:
Closest Pair Problems in Very High Dimensions. ICALP 2004: 782-792 - [c18]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur:
Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9 - [c17]Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein:
Dictionary matching and indexing with errors and don't cares. STOC 2004: 91-100 - 2003
- [j12]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. Inf. Comput. 181(1): 57-74 (2003) - [j11]Moshe Lewenstein, Maxim Sviridenko:
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP. SIAM J. Discret. Math. 17(2): 237-248 (2003) - [c16]Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko:
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. FOCS 2003: 56-65 - [c15]Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat:
Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942 - [c14]Moshe Lewenstein, Maxim Sviridenko:
Approximating asymmetric maximum TSP. SODA 2003: 646-654 - [c13]Richard Cole, Moshe Lewenstein:
Multidimensional matching and fast search in suffix trees. SODA 2003: 851-852 - [c12]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic Text and Static Pattern Matching. WADS 2003: 340-352 - [c11]Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat:
Real Two Dimensional Scaled Matching. WADS 2003: 353-364 - 2002
- [j10]Amihood Amir, Moshe Lewenstein, Ely Porat:
Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002) - 2001
- [j9]Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein:
Uniquely Restricted Matchings. Algorithmica 31(2): 139-154 (2001) - [c10]Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
A faster implementation of the Goemans-Williamson clustering algorithm. SODA 2001: 17-25 - [c9]Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat:
Overlap matching. SODA 2001: 279-288 - [c8]Amihood Amir, Ely Porat, Moshe Lewenstein:
Approximate subset matching with Don't Cares. SODA 2001: 305-306 - 2000
- [j8]Martin Charles Golumbic, Moshe Lewenstein:
New results on induced matchings. Discret. Appl. Math. 101(1-3): 157-165 (2000) - [j7]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching in Hypertext. J. Algorithms 35(1): 82-99 (2000) - [j6]Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. J. Algorithms 37(2): 247-266 (2000) - [j5]Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Text Indexing and Dictionary Matching with One Error. J. Algorithms 37(2): 309-325 (2000) - [c7]Amihood Amir, Moshe Lewenstein, Ely Porat:
Approximate Swapped Matching. FSTTCS 2000: 302-311 - [c6]Amihood Amir, Moshe Lewenstein, Ely Porat:
Faster algorithms for string matching with k mismatches. SODA 2000: 794-803 - [c5]Amihood Amir, Ayelet Butman, Moshe Lewenstein:
Real scaled matching. SODA 2000: 815-816
1990 – 1999
- 1999
- [j4]Tirza Hirst, Moshe Lewenstein:
Alternation and Bounded Concurrency Are Reverse Equivalent. Inf. Comput. 152(2): 173-187 (1999) - [j3]Amihood Amir, Ayelet Butman, Moshe Lewenstein:
Real Scaled Matching. Inf. Process. Lett. 70(4): 185-190 (1999) - [c4]Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh:
Indexing and Dictionary Matching with One Error. WADS 1999: 181-192 - 1998
- [j2]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps. Inf. Process. Lett. 68(3): 125-132 (1998) - [c3]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps. CPM 1998: 209-220 - 1997
- [j1]Amihood Amir, Alberto Apostolico, Moshe Lewenstein:
Inverse Pattern Matching. J. Algorithms 24(2): 325-339 (1997) - [c2]Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching with Swaps. FOCS 1997: 144-153 - [c1]Amihood Amir, Moshe Lewenstein, Noa Lewenstein:
Pattern Matching In Hypertext. WADS 1997: 160-173
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-08-05 21:13 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:
