Conference Publications

Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest
Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter
SPAA 2018

Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams
Shay Golan, Tsvi Kopelowitz, Ely Porat
ICALP 2018

A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance
Tsvi Kopelowitz, Ely Porat
SOSA 2018

The Online House Numbering Problem: Min-Max Online List Labeling
William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz
ESA 2017

Conditional Lower Bounds for Space/Time Tradeoffs
Issac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
WADS 2017

Exponential Separations in the Energy Complexity of Leader Election
Yi-Jun Chang,
Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan
STOC 2017

Simultaneously Load Balancing for Every p-norm, With Reassignments

Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein
ITCS 2017

Fully Dynamic Connectivity in O(logn(loglogn)^2) Amortized Expected Time
 

Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie
SODA 2017
See https://arxiv.org/abs/1609.05867

File Maintenance: When in Doubt, Change the Layout!
Michael Bender, Jeremy Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montas
SODA 2017

An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model.

Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie.
FOCS 2016
Also, a Brief Announcement at PODC 2016
See http://arxiv.org/abs/1602.08166


Mind the Gap.
Amihood Amir, Tsvi Kopelowitz, Avivit Levi, Seth Pettie, Ely Porat, B. Riva Shalom.
ISAAC 2016
See http://arxiv.org/abs/1503.07563

Deterministic Worst Case Dynamic Connectivity: Simpler and Faster.
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup.
ESA 2016
See http://arxiv.org/abs/1507.05944


How Hard is it to Find (Honest) Witnesses?
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat.
ESA 2016

Streaming Pattern Matching with d Wildcards.
Shay Golan, Tsvi Kopelowitz, Ely Porat.
ESA 2016

Contention Resolution with Log-Logstar Channel Accesses.
Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young.
STOC 2016.
See pdf.

The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets.
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat.
SPAA 2016.
See http://arxiv.org/abs/1408.2279

Color-Distance Oracles and Snippets
Tsvi Kopelowitz, Robert Krauthgamer.
CPM 2016.
See pdf.

Succinct Online Dictionary Matching with Improved Worst-case Guarantees
Tsvi Kopelowitz, Ely Porat, Yaron Rozen
CPM 2016.
See pdf.

Higher Lower Bounds from the 3SUM Conjecture.
Tsvi Kopelowitz, Seth Pettie, Ely Porat.
SODA 2016.
See http://arxiv.org/pdf/1407.6756

Breaking the Variance: Approximating the Hamming Distance in O~(1/epsilon) Time Per Alignment.
Tsvi Kopelowitz, Ely Porat.
FOCS 2015.
See http://arxiv.org/pdf/1512.04515

Dynamic Set Intersection.
Tsvi Kopelowitz, Seth Pettie, Ely Porat.
WADS 2015.
See http://arxiv.org/abs/1407.6755

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds.
Tsvi Kopelwoitz, Robert Krauthgamer, Ely Porat, Shay Solomon.
ICALP 2014.
See http://arxiv.org/abs/1312.1382

Sparse Suffix Tree Construction with Small Space.
Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
ICALP 2013
See http://arxiv.org/abs/1207.1135

Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting.
Tsvi Kopelowitz, Nimrod Talmon.
ISAAC 2012.
See http://arxiv.org/abs/1204.5229

On-line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List.
Tsvi Kopelowitz
FOCS 2012.
See http://arxiv.org/abs/1208.3798

Forbidden Patterns.
Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki.
LATIN 2012.
See pdf.

Persistency in Suffix Trees with Applications to String Interval Problems.
Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat.
SPIRE 2011.
See pdf.

Fast, precise and dynamic distance queries.
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty.
SODA 2011.
See http://arxiv.org/abs/1008.1480

The Property Suffix Tree with Dynamic Properties.

Tsvi Kopelowitz.
CPM 2010
See journal version here

Faster Algorithms for Substring Compression Problems.
Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein.
CPM 2009.
See journal version here.

On the Longest Common Parameterized Subsequence.
Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein. 
CPM 2008.
See journal version
here.

Range Non-Overlapping Indexing and Successive List Indexing.
Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein.
WADS 2007.
See pdf.

Dynamic Weighted Ancestors. Full version coming soon.
Tsvi Kopelowitz, Moshe Lewenstein.
SODA 2007.
See http://dl.acm.org/citation.cfm?id=1283444

Suffix Trays and Suffix Trists: Structures for Faster Text Indexing.
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein. 
ICALP 2016.
See journal version here.

Property Matching and Weighted Matching.
Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang. 
CPM 2006.
See journal version here.

Improved Algorithms for Polynomial Time-Decay and Time-Decay with Additive error.
Tsvi Kopelowitz, Ely Porat.
ICTCS 2005.
See journal version here.