Tsvi Kopelowitz

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