 | 2012 |
| 17 |  | Johannes Fischer,
Travis Gagie,
Tsvi Kopelowitz,
Moshe Lewenstein,
Veli Mäkinen,
Leena Salmela,
Niko Välimäki:
Forbidden Patterns.
LATIN 2012: 327-337 |
| 16 |  | Tsvi Kopelowitz,
Nimrod Talmon:
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting
CoRR abs/1204.5229: (2012) |
| 2011 |
| 15 |  | Yair Bartal,
Lee-Ad Gottlieb,
Tsvi Kopelowitz,
Moshe Lewenstein,
Liam Roditty:
Fast, precise and dynamic distance queries.
SODA 2011: 840-853 |
| 14 |  | Tsvi Kopelowitz,
Moshe Lewenstein,
Ely Porat:
Persistency in Suffix Trees with Applications to String Interval Problems.
SPIRE 2011: 67-80 |
| 2010 |
| 13 |  | Tsvi Kopelowitz:
The Property Suffix Tree with Dynamic Properties.
CPM 2010: 63-75 |
| 12 |  | Yair Bartal,
Lee-Ad Gottlieb,
Tsvi Kopelowitz,
Moshe Lewenstein,
Liam Roditty:
Fast, precise and dynamic distance queries
CoRR abs/1008.1480: (2010) |
| 2009 |
| 11 |  | Orgad Keller,
Tsvi Kopelowitz,
Shir Landau,
Moshe Lewenstein:
Generalized Substring Compression.
CPM 2009: 26-38 |
| 10 |  | Orgad Keller,
Tsvi Kopelowitz,
Moshe Lewenstein:
On the longest common parameterized subsequence.
Theor. Comput. Sci. 410(51): 5347-5353 (2009) |
| 2008 |
| 9 |  | Orgad Keller,
Tsvi Kopelowitz,
Moshe Lewenstein:
On the Longest Common Parameterized Subsequence.
CPM 2008: 303-315 |
| 8 |  | Amihood Amir,
Eran Chencinski,
Costas S. Iliopoulos,
Tsvi Kopelowitz,
Hui Zhang:
Property matching and weighted matching.
Theor. Comput. Sci. 395(2-3): 298-310 (2008) |
| 7 |  | Tsvi Kopelowitz,
Ely Porat:
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error.
Theory Comput. Syst. 42(3): 349-365 (2008) |
| 2007 |
| 6 |  | Tsvi Kopelowitz,
Moshe Lewenstein:
Dynamic weighted ancestors.
SODA 2007: 565-574 |
| 5 |  | Orgad Keller,
Tsvi Kopelowitz,
Moshe Lewenstein:
Range Non-overlapping Indexing and Successive List Indexing.
WADS 2007: 625-636 |
| 2006 |
| 4 |  | Amihood Amir,
Eran Chencinski,
Costas S. Iliopoulos,
Tsvi Kopelowitz,
Hui Zhang:
Property Matching and Weighted Matching.
CPM 2006: 188-199 |
| 3 |  | Richard Cole,
Tsvi Kopelowitz,
Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.
ICALP (1) 2006: 358-369 |
| 2005 |
| 2 |  | Tsvi Kopelowitz,
Ely Porat:
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error.
ICTCS 2005: 309-322 |
| 1 |  | Amihood Amir,
Tsvi Kopelowitz,
Moshe Lewenstein,
Noa Lewenstein:
Towards Real-Time Suffix Tree Construction.
SPIRE 2005: 67-78 |