Tsvi Kopelowitz

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 60

Top Topics

Pattern Matching

Hamming Distance

Top Venues

Publications

Tsvi Kopelowitz, Ariel Korin, Liam Roditty
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. ICALP (2024)
Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
-Dyck Edit Distance Problem. ACM Trans. Algorithms 20 (3) (2024)
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
) Amortized Expected Time. TheoretiCS 2 (2023)
Tsvi Kopelowitz, Ariel Korin, Liam Roditty
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. CoRR (2023)
Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
An Improved Algorithm for The k-Dyck Edit Distance Problem. SODA (2022)
Martin Hoefer, Tsvi Kopelowitz
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue. ACM Trans. Algorithms 18 (1) (2022)
Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12 (11) (2022)
Tsvi Kopelowitz, Samuel McCauley, Ely Porat
Support Optimality and Adaptive Cuckoo Filters. WADS (2021)
Tsvi Kopelowitz, Samuel McCauley, Ely Porat
Support Optimality and Adaptive Cuckoo Filters. CoRR (2021)
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein
Incremental Edge Orientation in Forests. CoRR (2021)
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein
Incremental Edge Orientation in Forests. ESA (2021)
Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya
An Improved Algorithm for The k-Dyck Edit Distance Problem. CoRR (2021)
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie
Contention resolution without collision detection. STOC (2020)
Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat
n) Parallel Time Population Protocol for Majority with O(log n) States. CoRR (2020)
Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
Approximating Text-to-Pattern Hamming Distances. CoRR (2020)
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time. CoRR (2020)
Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
Approximating text-to-pattern Hamming distances. STOC (2020)
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. CPM (2020)
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski
Improved Circular k-Mismatch Sketches. CoRR (2020)
Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie
Contention Resolution Without Collision Detection. CoRR (2020)
Tsvi Kopelowitz, Virginia Vassilevska Williams
Towards Optimal Set-Disjointness and Set-Intersection Data Structures. ICALP (2020)
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski
Improved Circular k-Mismatch Sketches. APPROX-RANDOM (2020)
Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat
) States. PODC (2020)
Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat
Dynamic Dictionary Matching in the Online Model. WADS (2019)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Mind the Gap! - Online Dictionary Matching with One Gap. Algorithmica 81 (6) (2019)
Shay Golan, Tsvi Kopelowitz, Ely Porat
Streaming Pattern Matching with d Wildcards. Algorithmica 81 (5) (2019)
Tsvi Kopelowitz, Ely Porat
The Strong 3SUM-INDEXING Conjecture is False. CoRR (2019)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan
Exponential Separations in the Energy Complexity of Leader Election. ACM Trans. Algorithms 15 (4) (2019)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. SIAM J. Comput. 48 (1) (2019)
Hodaya Barr, Tsvi Kopelowitz, Ely Porat, Liam Roditty
{-1, 0, 1}-APSP and (min, max)-Product Problems. CoRR (2019)
Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. CoRR (2018)
Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. SPAA (2018)
Tsvi Kopelowitz, Ely Porat
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. SOSA (2018)
Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses. SIAM J. Comput. 47 (5) (2018)
Shay Golan, Tsvi Kopelowitz, Ely Porat
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. ICALP (2018)
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
How Hard is it to Find (Honest) Witnesses? CoRR (2017)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan
Exponential separations in the energy complexity of leader election. STOC (2017)
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes
File Maintenance: When in Doubt, Change the Layout! SODA (2017)
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie
) Amortized Expected Time. SODA (2017)
William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz
The Online House Numbering Problem: Min-Max Online List Labeling. ESA (2017)
Shay Golan, Tsvi Kopelowitz, Ely Porat
Streaming Pattern Matching with d Wildcards. CoRR (2017)
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
Conditional Lower Bounds for Space/Time Tradeoffs. WADS (2017)
Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein
Simultaneously Load Balancing for Every p-norm, With Reassignments. ITCS (2017)
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
Conditional Lower Bounds for Space/Time Tradeoffs. CoRR (2017)
Tsvi Kopelowitz, Ely Porat, Yaron Rozen
Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. CPM (2016)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. FOCS (2016)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan
How to Elect a Low-energy Leader. CoRR (2016)
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. SPAA (2016)
Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
Sparse Text Indexing in Small Space. ACM Trans. Algorithms 12 (3) (2016)
Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young
Contention resolution with log-logstar channel accesses. STOC (2016)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. PODC (2016)
Shay Golan, Tsvi Kopelowitz, Ely Porat
Streaming Pattern Matching with d Wildcards. ESA (2016)
Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. CoRR (2016)
Tsvi Kopelowitz, Seth Pettie, Ely Porat
Higher Lower Bounds from the 3SUM Conjecture. SODA (2016)
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie
) Amortized Expected Time. CoRR (2016)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. ISAAC (2016)
Tsvi Kopelowitz
The property suffix tree with dynamic properties. Theor. Comput. Sci. 638 (2016)
Tsvi Kopelowitz, Robert Krauthgamer
Color-Distance Oracles and Snippets. CPM (2016)
Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
How Hard is it to Find (Honest) Witnesses?. ESA (2016)
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
Faster Worst Case Deterministic Dynamic Connectivity. ESA (2016)
Tsvi Kopelowitz, Ely Porat
Breaking the Variance: Approximating the Hamming Distance in $\tilde O(1/ε)$ Time Per Alignment. CoRR (2015)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. Algorithmica 72 (2) (2015)
Tsvi Kopelowitz, Seth Pettie, Ely Porat
Dynamic Set Intersection. WADS (2015)
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup
Deterministic Worst Case Dynamic Connectivity: Simpler and Faster. CoRR (2015)
Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom
Online Dictionary Matching with One Gap. CoRR (2015)
Tsvi Kopelowitz, Ely Porat
Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. FOCS (2015)
Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Ely Porat
Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. CoRR (2014)
Tsvi Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
Cross-document pattern matching. J. Discrete Algorithms 24 (2014)
Orgad Keller, Tsvi Kopelowitz, Shir Landau Feibish, Moshe Lewenstein
Generalized substring compression. Theor. Comput. Sci. 525 (2014)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43 (4) (2014)
Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR (2014)
Tsvi Kopelowitz, Seth Pettie, Ely Porat
3SUM Hardness in (Dynamic) Data Structures. CoRR (2014)
Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. ICALP (2) (2014)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. CoRR (2013)
Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. CoRR (2013)
Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR (2013)
Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
Sparse Suffix Tree Construction in Small Space. ICALP (1) (2013)
Tsvi Kopelowitz, Robert Krauthgamer
Faster Clustering via Preprocessing CoRR (2012)
Tsvi Kopelowitz, Nimrod Talmon
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting. ISAAC (2012)
Tsvi Kopelowitz
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List. FOCS (2012)
Tsvi Kopelowitz, Nimrod Talmon
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting CoRR (2012)
Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj
Sparse Suffix Tree Construction with Small Space CoRR (2012)
Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki
Forbidden Patterns. LATIN (2012)
Tsvi Kopelowitz
On-line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List CoRR (2012)
Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
Persistency in Suffix Trees with Applications to String Interval Problems. SPIRE (2011)
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
Fast, precise and dynamic distance queries. SODA (2011)
Tsvi Kopelowitz
The Property Suffix Tree with Dynamic Properties. CPM (2010)
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty
Fast, precise and dynamic distance queries CoRR (2010)
Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
On the longest common parameterized subsequence. Theor. Comput. Sci. 410 (51) (2009)
Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein
Generalized Substring Compression. CPM (2009)
Tsvi Kopelowitz, Ely Porat
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. Theory Comput. Syst. 42 (3) (2008)
Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
On the Longest Common Parameterized Subsequence. CPM (2008)
Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang
Property matching and weighted matching. Theor. Comput. Sci. 395 (2-3) (2008)
Tsvi Kopelowitz, Moshe Lewenstein
Dynamic weighted ancestors. SODA (2007)
Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
Range Non-overlapping Indexing and Successive List Indexing. WADS (2007)
Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang
Property Matching and Weighted Matching. CPM (2006)
Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) (2006)
Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein
Towards Real-Time Suffix Tree Construction. SPIRE (2005)
Tsvi Kopelowitz, Ely Porat
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. ICTCS (2005)