Towards Real-Time Suffix Tree Construction. - Amihood Amir; Tsvi Kopelowitz; Moshe Lewenstein; Noa Lewenstein (SPIRE, 2005)

Dynamic weighted ancestors. - Tsvi Kopelowitz; Moshe Lewenstein (SODA, 2007)

Range Non-overlapping Indexing and Successive List Indexing. - Orgad Keller; Tsvi Kopelowitz; Moshe Lewenstein (WADS, 2007)

Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. - Tsvi Kopelowitz; Ely Porat (Theory Comput. Syst., 2008)

Property matching and weighted matching. - Amihood Amir; Eran Chencinski; Costas S. Iliopoulos; Tsvi Kopelowitz; Hui Zhang 004 (Theor. Comput. Sci., 2008)

On the longest common parameterized subsequence. - Orgad Keller; Tsvi Kopelowitz; Moshe Lewenstein (Theor. Comput. Sci., 2009)

Fast, precise and dynamic distance queries. - Yair Bartal; Lee-Ad Gottlieb; Tsvi Kopelowitz; Moshe Lewenstein; Liam Roditty (SODA, 2011)

Persistency in Suffix Trees with Applications to String Interval Problems. - Tsvi Kopelowitz; Moshe Lewenstein; Ely Porat (SPIRE, 2011)

On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List. - Tsvi Kopelowitz (FOCS, 2012)

Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting. - Tsvi Kopelowitz; Nimrod Talmon (ISAAC, 2012)

Forbidden Patterns. - Johannes Fischer 001; Travis Gagie; Tsvi Kopelowitz; Moshe Lewenstein; Veli Mäkinen; Leena Salmela; Niko Välimäki (LATIN, 2012)

Sparse Suffix Tree Construction with Small Space - Philip Bille; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (CoRR, 2012)

Faster Clustering via Preprocessing - Tsvi Kopelowitz; Robert Krauthgamer (CoRR, 2012)

Sparse Suffix Tree Construction in Small Space. - Philip Bille; Johannes Fischer 001; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (ICALP (1), 2013)

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 (CoRR, 2013)

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. - Tsvi Kopelowitz; Robert Krauthgamer; Ely Porat; Shay Solomon (ICALP (2), 2014)

Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Ely Porat (CoRR, 2014)

3SUM Hardness in (Dynamic) Data Structures. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (CoRR, 2014)

Cross-document pattern matching. - Tsvi Kopelowitz; Gregory Kucherov; Yakov Nekrich; Tatiana Starikovskaya (J. Discrete Algorithms, 2014)

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. - Amihood Amir; Gianni Franceschini; Roberto Grossi; Tsvi Kopelowitz; Moshe Lewenstein; Noa Lewenstein (SIAM J. Comput., 2014)

Generalized substring compression. - Orgad Keller; Tsvi Kopelowitz; Shir Landau Feibish; Moshe Lewenstein (Theor. Comput. Sci., 2014)

Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. - Tsvi Kopelowitz; Ely Porat (FOCS, 2015)

Dynamic Set Intersection. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (WADS, 2015)

Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. - Richard Cole 001; Tsvi Kopelowitz; Moshe Lewenstein (Algorithmica, 2015)

Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (CoRR, 2015)

Deterministic Worst Case Dynamic Connectivity: Simpler and Faster. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (CoRR, 2015)

Breaking the Variance: Approximating the Hamming Distance in $ tilde O(1/ε)$ Time Per Alignment. - Tsvi Kopelowitz; Ely Porat (CoRR, 2015)

Color-Distance Oracles and Snippets. - Tsvi Kopelowitz; Robert Krauthgamer (CPM, 2016)

Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. - Tsvi Kopelowitz; Ely Porat; Yaron Rozen (CPM, 2016)

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

Faster Worst Case Deterministic Dynamic Connectivity. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (ESA, 2016)

Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (ISAAC, 2016)

Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie (PODC, 2016)

Higher Lower Bounds from the 3SUM Conjecture. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (SODA, 2016)

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)

Contention resolution with log-logstar channel accesses. - Michael A. Bender; Tsvi Kopelowitz; Seth Pettie; Maxwell Young (STOC, 2016)

How to Elect a Low-energy Leader. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie; Ruosong Wang; Wei Zhan (CoRR, 2016)

Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie (CoRR, 2016)

Sparse Text Indexing in Small Space. - Philip Bille; Johannes Fischer 001; Inge Li Gørtz; Tsvi Kopelowitz; Benjamin Sach; Hjalte Wedel Vildhøj (ACM Trans. Algorithms, 2016)

The property suffix tree with dynamic properties. - Tsvi Kopelowitz (Theor. Comput. Sci., 2016)

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

Simultaneously Load Balancing for Every p-norm, With Reassignments. - Aaron Bernstein; Tsvi Kopelowitz; Seth Pettie; Ely Porat; Clifford Stein 001 (ITCS, 2017)

File Maintenance: When in Doubt, Change the Layout! - Michael A. Bender; Jeremy T. Fineman; Seth Gilbert; Tsvi Kopelowitz; Pablo Montes (SODA, 2017)

Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie (SODA, 2017)

Conditional Lower Bounds for Space/Time Tradeoffs. - Isaac Goldstein; Tsvi Kopelowitz; Moshe Lewenstein; Ely Porat (WADS, 2017)

Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. - Shay Golan 001; Tsvi Kopelowitz; Ely Porat (ICALP, 2018)

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

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

Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses. - Michael A. Bender; Tsvi Kopelowitz; Seth Pettie; Maxwell Young (SIAM J. Comput., 2018)

Dynamic Dictionary Matching in the Online Model. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (WADS, 2019)

Mind the Gap! - Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (Algorithmica, 2019)

Streaming Pattern Matching with d Wildcards. - Shay Golan 001; Tsvi Kopelowitz; Ely Porat (Algorithmica, 2019)

The Strong 3SUM-INDEXING Conjecture is False. - Tsvi Kopelowitz; Ely Porat (CoRR, 2019)

{-1, 0, 1}-APSP and (min, max)-Product Problems. - Hodaya Barr; Tsvi Kopelowitz; Ely Porat; Liam Roditty (CoRR, 2019)

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie (SIAM J. Comput., 2019)

Exponential Separations in the Energy Complexity of Leader Election. - Yi-Jun Chang; Tsvi Kopelowitz; Seth Pettie; Ruosong Wang; Wei Zhan (ACM Trans. Algorithms, 2019)

Improved Circular k-Mismatch Sketches. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Przemyslaw Uznanski (APPROX-RANDOM, 2020)

The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (CPM, 2020)

Towards Optimal Set-Disjointness and Set-Intersection Data Structures. - Tsvi Kopelowitz; Virginia Vassilevska Williams (ICALP, 2020)

An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States. - Stav Ben-Nun; Tsvi Kopelowitz; Matan Kraus; Ely Porat (PODC, 2020)

Contention resolution without collision detection. - Michael A. Bender; Tsvi Kopelowitz; William Kuszmaul; Seth Pettie (STOC, 2020)

Approximating text-to-pattern Hamming distances. - Timothy M. Chan; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (STOC, 2020)

An O(log3/2n) Parallel Time Population Protocol for Majority with O(log n) States. - Stav Ben-Nun; Tsvi Kopelowitz; Matan Kraus; Ely Porat (CoRR, 2020)

Incremental Edge Orientation in Forests. - Michael A. Bender; Tsvi Kopelowitz; William Kuszmaul; Ely Porat; Clifford Stein 001 (ESA, 2021)

Support Optimality and Adaptive Cuckoo Filters. - Tsvi Kopelowitz; Samuel McCauley; Ely Porat (WADS, 2021)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (SODA, 2022)

Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue. - Martin Hoefer 001; Tsvi Kopelowitz (ACM Trans. Algorithms, 2022)

Dynamic Graph Algorithms (Dagstuhl Seminar 22461). - Aaron Bernstein; Shiri Chechik; Sebastian Forster; Tsvi Kopelowitz; Yasamin Nazari; Nicole Wein (Dagstuhl Reports, 2022)

Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. - Shang-En Huang; Dawei Huang; Tsvi Kopelowitz; Seth Pettie; Mikkel Thorup (TheoretiCS, 2023)

Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. - Dvir Fried; Tsvi Kopelowitz; Ely Porat (ESA, 2024)

On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. - Tsvi Kopelowitz; Ariel Korin; Liam Roditty (ICALP, 2024)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (ACM Trans. Algorithms, 2024)

Color Distance Oracles and Snippets: Separation Between Exact and Approximate Solutions. - Noam Horowicz; Tsvi Kopelowitz (CoRR, 2025)