Journal Publications

The Property Suffix Tree with Dynamic Properties.
Tsvi Kopelowitz.
Accepted to Theoretical Computer Science 2016
See pdf

Sparse Suffix Tree Indexing with Small Space.
Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj.
Accepted to ACM Transactions on Algorithms 2015.

Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein.
Algorithmica 72(2): 450-466, 2015.

Cross-document pattern matching. 
Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana A. Starikovskaya.
Journal of Discrete Algorithms 24:40-47, 2014.

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing.
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein.
SIAM J. Comput. 43(4): 1396-1416 (2014)

Faster Algorithms for Substring Compression Problems.
Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein.
Theortical Computer Science 525:
: 42-54, 2014.

On the Longest Common Parameterized Subsequence.

Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein.
Theoretical Computer Science 410(51)
: 5347-5353, 2009.

Improved Algorithms for Polynomial Time-Decay and Time-Decay with Additive error.
Tsvi Kopelowitz, Ely Porat.
Theory of Computing Systems42(3): 349-36, 2008.

Property Matching and Weighted Matching.
Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang.
Theoretical Computer Science 395(2-3): 298-310, 2008.