|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 23 occurrences of 16 keywords
|
|
|
|
|
Results
Found 81 publication records. Showing 81 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Carmel Kent, Moshe Lewenstein, Dafna Sheinwald |
On demand string sorting over unbounded alphabets.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini |
Dotted interval graphs.  |
ACM Transactions on Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki |
Forbidden Patterns.  |
LATIN  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur |
Finding witnesses by peeling.  |
ACM Transactions on Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Lewenstein, Gabriel Valiente |
CPM 2006.  |
J. Discrete Algorithms  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty |
Fast, precise and dynamic distance queries.  |
SODA  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Isaac Goldstein, Moshe Lewenstein |
Quick Greedy Computation for Minimum Common String Partitions.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa |
Restricted Common Superstring and Restricted Common Supersequence.  |
CPM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat |
Range LCP.  |
ISAAC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Lewenstein |
Indexing with Gaps.  |
SPIRE  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
Persistency in Suffix Trees with Applications to String Interval Problems.  |
SPIRE  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Moshe Lewenstein, Bin Ma, Kaizhong Zhang |
On the Longest Common Rigid Subsequence Problem.  |
Algorithmica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz |
Optimization problems in multiple-interval graphs.  |
ACM Transactions on Algorithms  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty |
Fast, precise and dynamic distance queries  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa |
Permuted Common Supersequence  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein |
Restricted LCS.  |
SPIRE  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa |
On Shortest Common Superstring and Swap Permutations.  |
SPIRE  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Gotthilf, Moshe Lewenstein |
Improved algorithms for the k simple shortest paths and the replacement paths problems.  |
Inf. Process. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein |
On the longest common parameterized subsequence.  |
Theor. Comput. Sci.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat |
Real Two Dimensional Scaled Matching.  |
Algorithmica  |
2009 |
DBLP DOI BibTeX RDF |
Scaled pattern matching, Generalized pattern matching, Pattern matching, Design and analysis of algorithms, Approximate pattern matching, Combinatorial algorithms on words |
| 1 | Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein |
Generalized Substring Compression.  |
CPM  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Gotthilf, Moshe Lewenstein |
Improved Approximation Results on the Shortest Common Supersequence Problem.  |
SPIRE  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Lewenstein |
Parameterized Matching.  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Lewenstein |
Dictionary Matching and Indexing (Exact and with Errors).  |
Encyclopedia of Algorithms  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein |
On the Longest Common Parameterized Subsequence.  |
CPM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein |
Constrained LCS: Hardness and Approximation.  |
CPM  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt |
A Approximation Algorithm for the Minimum Maximal Matching Problem.  |
WAOA  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol |
Dynamic text and static pattern matching.  |
ACM Transactions on Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
border trees, static pattern, Dynamic text |
| 1 | Carmit Hazay, Moshe Lewenstein, Dina Sokol |
Approximate parameterized matching.  |
ACM Transactions on Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
mismatch pair, parameterize match, Hamming distance, maximum matching |
| 1 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur |
Efficient one-dimensional real scaled matching.  |
J. Discrete Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Apostolico, Péter L. Erdös, Moshe Lewenstein |
Parameterized matching with mismatches.  |
J. Discrete Algorithms  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsvi Kopelowitz, Moshe Lewenstein |
Dynamic weighted ancestors.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz |
Optimization problems in multiple-interval graphs.  |
SODA  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein |
Range Non-overlapping Indexing and Successive List Indexing.  |
WADS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, Dekel Tsur |
Finding Witnesses by Peeling.  |
CPM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmel Kent, Moshe Lewenstein, Dafna Sheinwald |
On Demand String Sorting over Unbounded Alphabets.  |
CPM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Johannes Fischer, Moshe Lewenstein |
Two-Dimensional Range Minimum Queries.  |
CPM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Gotthilf, Moshe Lewenstein |
Approximating Constrained LCS.  |
SPIRE  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat |
Function Matching.  |
SIAM J. Comput.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein |
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.  |
ICALP  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Lewenstein, Gabriel Valiente (eds.) |
Combinatorial Pattern Matching, 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings  |
CPM  |
2006 |
DBLP BibTeX RDF |
|
| 1 | David Gamarnik, Moshe Lewenstein, Maxim Sviridenko |
An improved upper bound for the TSP in cubic 3-edge-connected graphs.  |
Oper. Res. Lett.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.  |
J. ACM  |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms |
| 1 | Don Coppersmith, Moshe Lewenstein |
Constructive Bounds on Ordered Factorizations.  |
SIAM J. Discrete Math.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Yonatan Aumann, Moshe Lewenstein, Oren Melamud, Ron Y. Pinter, Zohar Yakhini |
Dotted interval graphs and high throughput genotyping.  |
SODA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmit Hazay, Moshe Lewenstein, Dekel Tsur |
Two Dimensional Parameterized Matching.  |
CPM  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvi Gotthilf, Moshe Lewenstein |
Tighter Approximations for Maximum Induced Matchings in Regular Graphs.  |
WAOA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein |
Towards Real-Time Suffix Tree Construction.  |
SPIRE  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Moshe Lewenstein, Ely Porat |
Faster algorithms for string matching with k mismatches.  |
J. Algorithms  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Carmit Hazay, Moshe Lewenstein, Dina Sokol |
Approximate Parameterized Matching.  |
ESA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat |
Closest Pair Problems in Very High Dimensions.  |
ICALP  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur |
Efficient One Dimensional Real Scaled Matching.  |
SPIRE  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein |
Dictionary matching and indexing with errors and don't cares.  |
STOC  |
2004 |
DBLP DOI BibTeX RDF |
dictionary matching, dictionary query, suffix trees, text indexing, wildcards, approximate pattern matching |
| 1 | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
Overlap matching.  |
Inf. Comput.  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Moshe Lewenstein, Maxim Sviridenko |
A 5/8 Approximation Algorithm for the Maximum Asymmetric TSP.  |
SIAM J. Discrete Math.  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Moshe Lewenstein, Maxim Sviridenko |
Approximating asymmetric maximum TSP.  |
SODA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Moshe Lewenstein |
Multidimensional matching and fast search in suffix trees.  |
SODA  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat |
Function Matching: Algorithms, Applications, and a Lower Bound.  |
ICALP  |
2003 |
DBLP DOI BibTeX RDF |
function matching, parameterized matching, Pattern matching, register allocation, protein folding, color indexing |
| 1 | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat |
Real Two Dimensional Scaled Matching.  |
WADS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol |
Dynamic Text and Static Pattern Matching.  |
WADS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Haim Kaplan, Moshe Lewenstein, Nira Shafrir, Maxim Sviridenko |
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs.  |
FOCS  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Moshe Lewenstein, Ely Porat |
Approximate swapped matching.  |
Inf. Process. Lett.  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Tirza Hirst, Moshe Lewenstein |
Uniquely Restricted Matchings.  |
Algorithmica  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Ely Porat, Moshe Lewenstein |
Approximate subset matching with Don't Cares.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
A faster implementation of the Goemans-Williamson clustering algorithm.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
Overlap matching.  |
SODA  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Moshe Lewenstein, Noa Lewenstein |
Pattern Matching in Hypertext.  |
J. Algorithms  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh |
Text Indexing and Dictionary Matching with One Error.  |
J. Algorithms  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein |
Pattern Matching with Swaps.  |
J. Algorithms  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Charles Golumbic, Moshe Lewenstein |
New results on induced matchings.  |
Discrete Applied Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Moshe Lewenstein, Ely Porat |
Faster algorithms for string matching with k mismatches.  |
SODA  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Ayelet Butman, Moshe Lewenstein |
Real scaled matching.  |
SODA  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Moshe Lewenstein, Ely Porat |
Approximate Swapped Matching.  |
FSTTCS  |
2000 |
DBLP DOI BibTeX RDF |
pattern matching with swaps, non-standard pattern matching, pattern matching, Design and analysis of algorithms, approximate pattern matching, combinatorial algorithms on words |
| 1 | Amihood Amir, Ayelet Butman, Moshe Lewenstein |
Real Scaled Matching.  |
Inf. Process. Lett.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tirza Hirst, Moshe Lewenstein |
Alternation and Bounded Concurrency Are Reverse Equivalent.  |
Inf. Comput.  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh |
Indexing and Dictionary Matching with One Error.  |
WADS  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein |
Efficient Special Cases of Pattern Matching with Swaps.  |
Inf. Process. Lett.  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein |
Efficient Special Cases of Pattern Matching with Swaps.  |
CPM  |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Alberto Apostolico, Moshe Lewenstein |
Inverse Pattern Matching.  |
J. Algorithms  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Moshe Lewenstein, Noa Lewenstein |
Pattern Matching In Hypertext.  |
WADS  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein |
Pattern Matching with Swaps.  |
FOCS  |
1997 |
DBLP DOI BibTeX RDF |
swapped matching, O(mn) time, pattern matching, pattern matching, time complexity, text string |
Displaying result #1 - #81 of 81 (100 per page; Change: )
|
|