default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTsvi Kopelowitz
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j17]Dvir Fried
, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. ACM Trans. Algorithms 20(3): 26 (2024)- [c50]Dvir Fried, Tsvi Kopelowitz, Ely Porat:
Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. ESA 2024: 57:1-57:6 - [c49]Tsvi Kopelowitz, Ariel Korin, Liam Roditty:
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. ICALP 2024: 101:1-101:18 - 2023
- [j16]Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Fully Dynamic Connectivity in O(log n(loglog n)2) Amortized Expected Time. TheoretiCS 2 (2023) - [i33]Tsvi Kopelowitz, Ariel Korin, Liam Roditty:
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch. CoRR abs/2310.12239 (2023) - 2022
- [j15]Martin Hoefer, Tsvi Kopelowitz:
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue. ACM Trans. Algorithms 18(1): 4e:1-4e:2 (2022) - [c48]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. SODA 2022: 3650-3669 - [i32]Aaron Bernstein, Shiri Chechik, Sebastian Forster, Tsvi Kopelowitz, Yasamin Nazari, Nicole Wein:
Dynamic Graph Algorithms (Dagstuhl Seminar 22461). Dagstuhl Reports 12(11): 45-65 (2022) - 2021
- [c47]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. ESA 2021: 12:1-12:18 - [c46]Tsvi Kopelowitz, Samuel McCauley, Ely Porat:
Support Optimality and Adaptive Cuckoo Filters. WADS 2021: 556-570 - [i31]Tsvi Kopelowitz, Samuel McCauley, Ely Porat:
Support Optimality and Adaptive Cuckoo Filters. CoRR abs/2105.10622 (2021) - [i30]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein:
Incremental Edge Orientation in Forests. CoRR abs/2107.02318 (2021) - [i29]Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya:
An Improved Algorithm for The k-Dyck Edit Distance Problem. CoRR abs/2111.02336 (2021) - 2020
- [c45]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski:
Improved Circular k-Mismatch Sketches. APPROX-RANDOM 2020: 46:1-46:24 - [c44]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. CPM 2020: 15:1-15:15 - [c43]Tsvi Kopelowitz, Virginia Vassilevska Williams:
Towards Optimal Set-Disjointness and Set-Intersection Data Structures. ICALP 2020: 74:1-74:16 - [c42]Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat:
An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States. PODC 2020: 191-199 - [c41]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie:
Contention resolution without collision detection. STOC 2020: 105-118 - [c40]Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Approximating text-to-pattern Hamming distances. STOC 2020: 643-656 - [i28]Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Approximating Text-to-Pattern Hamming Distances. CoRR abs/2001.00211 (2020) - [i27]Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Seth Pettie:
Contention Resolution Without Collision Detection. CoRR abs/2004.08039 (2020) - [i26]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
The Streaming k-Mismatch Problem: Tradeoffs between Space and Total Time. CoRR abs/2004.12881 (2020) - [i25]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski:
Improved Circular k-Mismatch Sketches. CoRR abs/2006.13673 (2020) - [i24]Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat:
An O(log3/2n) Parallel Time Population Protocol for Majority with O(log n) States. CoRR abs/2011.12633 (2020)
2010 – 2019
- 2019
- [j14]Shay Golan, Tsvi Kopelowitz, Ely Porat:
Streaming Pattern Matching with d Wildcards. Algorithmica 81(5): 1988-2015 (2019) - [j13]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): 2123-2157 (2019) - [j12]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. SIAM J. Comput. 48(1): 122-143 (2019) - [j11]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): 49:1-49:31 (2019) - [c39]Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat:
Dynamic Dictionary Matching in the Online Model. WADS 2019: 409-422 - [i23]Tsvi Kopelowitz, Ely Porat:
The Strong 3SUM-INDEXING Conjecture is False. CoRR abs/1907.11206 (2019) - [i22]Hodaya Barr, Tsvi Kopelowitz, Ely Porat, Liam Roditty:
{-1, 0, 1}-APSP and (min, max)-Product Problems. CoRR abs/1911.06132 (2019) - 2018
- [j10]Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young:
Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses. SIAM J. Comput. 47(5): 1735-1754 (2018) - [c38]Shay Golan, Tsvi Kopelowitz, Ely Porat:
Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. ICALP 2018: 65:1-65:16 - [c37]Tsvi Kopelowitz, Ely Porat:
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. SOSA 2018: 10:1-10:5 - [c36]Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter:
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. SPAA 2018: 333-341 - [i21]Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter:
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. CoRR abs/1805.06151 (2018) - 2017
- [c35]William E. Devanny, Jeremy T. Fineman, Michael T. Goodrich, Tsvi Kopelowitz:
The Online House Numbering Problem: Min-Max Online List Labeling. ESA 2017: 33:1-33:15 - [c34]Aaron Bernstein, Tsvi Kopelowitz, Seth Pettie, Ely Porat, Clifford Stein:
Simultaneously Load Balancing for Every p-norm, With Reassignments. ITCS 2017: 51:1-51:14 - [c33]Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie:
Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. SODA 2017: 510-520 - [c32]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes:
File Maintenance: When in Doubt, Change the Layout! SODA 2017: 1503-1522 - [c31]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
Exponential separations in the energy complexity of leader election. STOC 2017: 771-783 - [c30]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Conditional Lower Bounds for Space/Time Tradeoffs. WADS 2017: 421-436 - [i20]Shay Golan, Tsvi Kopelowitz, Ely Porat:
Streaming Pattern Matching with d Wildcards. CoRR abs/1704.01646 (2017) - [i19]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
How Hard is it to Find (Honest) Witnesses? CoRR abs/1706.05815 (2017) - [i18]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Conditional Lower Bounds for Space/Time Tradeoffs. CoRR abs/1706.05847 (2017) - 2016
- [j9]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): 39:1-39:19 (2016) - [j8]Tsvi Kopelowitz:
The property suffix tree with dynamic properties. Theor. Comput. Sci. 638: 44-51 (2016) - [c29]Tsvi Kopelowitz, Ely Porat, Yaron Rozen:
Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. CPM 2016: 6:1-6:13 - [c28]Tsvi Kopelowitz, Robert Krauthgamer:
Color-Distance Oracles and Snippets. CPM 2016: 24:1-24:10 - [c27]Shay Golan, Tsvi Kopelowitz, Ely Porat:
Streaming Pattern Matching with d Wildcards. ESA 2016: 44:1-44:16 - [c26]Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
How Hard is it to Find (Honest) Witnesses?. ESA 2016: 45:1-45:16 - [c25]Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Faster Worst Case Deterministic Dynamic Connectivity. ESA 2016: 53:1-53:15 - [c24]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. FOCS 2016: 615-624 - [c23]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: 12:1-12:12 - [c22]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. PODC 2016: 195-197 - [c21]Tsvi Kopelowitz, Seth Pettie, Ely Porat:
Higher Lower Bounds from the 3SUM Conjecture. SODA 2016: 1272-1287 - [c20]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: 367-375 - [c19]Michael A. Bender, Tsvi Kopelowitz, Seth Pettie, Maxwell Young:
Contention resolution with log-logstar channel accesses. STOC 2016: 499-508 - [i17]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie:
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model. CoRR abs/1602.08166 (2016) - [i16]Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, Seth Pettie:
Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time. CoRR abs/1609.05867 (2016) - [i15]Yi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan:
How to Elect a Low-energy Leader. CoRR abs/1609.08486 (2016) - 2015
- [j7]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. Algorithmica 72(2): 450-466 (2015) - [c18]Tsvi Kopelowitz, Ely Porat:
Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. FOCS 2015: 601-613 - [c17]Tsvi Kopelowitz, Seth Pettie, Ely Porat:
Dynamic Set Intersection. WADS 2015: 470-481 - [i14]Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom:
Online Dictionary Matching with One Gap. CoRR abs/1503.07563 (2015) - [i13]Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Mikkel Thorup:
Deterministic Worst Case Dynamic Connectivity: Simpler and Faster. CoRR abs/1507.05944 (2015) - [i12]Tsvi Kopelowitz, Ely Porat:
Breaking the Variance: Approximating the Hamming Distance in $\tilde O(1/ε)$ Time Per Alignment. CoRR abs/1512.04515 (2015) - 2014
- [j6]Tsvi Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya:
Cross-document pattern matching. J. Discrete Algorithms 24: 40-47 (2014) - [j5]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): 1396-1416 (2014) - [j4]Orgad Keller, Tsvi Kopelowitz, Shir Landau Feibish, Moshe Lewenstein:
Generalized substring compression. Theor. Comput. Sci. 525: 42-54 (2014) - [c16]Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon:
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. ICALP (2) 2014: 532-543 - [i11]Casper Kejlberg-Rasmussen, Tsvi Kopelowitz, Seth Pettie, Ely Porat:
Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. CoRR abs/1407.6755 (2014) - [i10]Tsvi Kopelowitz, Seth Pettie, Ely Porat:
3SUM Hardness in (Dynamic) Data Structures. CoRR abs/1407.6756 (2014) - [i9]Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat:
The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. CoRR abs/1408.2279 (2014) - 2013
- [c15]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: 148-159 - [i8]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 abs/1306.0406 (2013) - [i7]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. CoRR abs/1311.1762 (2013) - [i6]Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon:
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. CoRR abs/1312.1382 (2013) - 2012
- [c14]Tsvi Kopelowitz:
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List. FOCS 2012: 283-292 - [c13]Tsvi Kopelowitz, Nimrod Talmon:
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting. ISAAC 2012: 558-567 - [c12]Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein, Veli Mäkinen, Leena Salmela, Niko Välimäki:
Forbidden Patterns. LATIN 2012: 327-337 - [i5]Tsvi Kopelowitz, Nimrod Talmon:
Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting. CoRR abs/1204.5229 (2012) - [i4]Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Suffix Tree Construction with Small Space. CoRR abs/1207.1135 (2012) - [i3]Tsvi Kopelowitz:
On-line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List. CoRR abs/1208.3798 (2012) - [i2]Tsvi Kopelowitz, Robert Krauthgamer:
Faster Clustering via Preprocessing. CoRR abs/1208.5247 (2012) - 2011
- [c11]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. SODA 2011: 840-853 - [c10]Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat:
Persistency in Suffix Trees with Applications to String Interval Problems. SPIRE 2011: 67-80 - 2010
- [c9]Tsvi Kopelowitz:
The Property Suffix Tree with Dynamic Properties. CPM 2010: 63-75 - [i1]Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty:
Fast, precise and dynamic distance queries. CoRR abs/1008.1480 (2010)
2000 – 2009
- 2009
- [j3]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the longest common parameterized subsequence. Theor. Comput. Sci. 410(51): 5347-5353 (2009) - [c8]Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein:
Generalized Substring Compression. CPM 2009: 26-38 - 2008
- [j2]Tsvi Kopelowitz, Ely Porat:
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. Theory Comput. Syst. 42(3): 349-365 (2008) - [j1]Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property matching and weighted matching. Theor. Comput. Sci. 395(2-3): 298-310 (2008) - [c7]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
On the Longest Common Parameterized Subsequence. CPM 2008: 303-315 - 2007
- [c6]Tsvi Kopelowitz, Moshe Lewenstein:
Dynamic weighted ancestors. SODA 2007: 565-574 - [c5]Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein:
Range Non-overlapping Indexing and Successive List Indexing. WADS 2007: 625-636 - 2006
- [c4]Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang:
Property Matching and Weighted Matching. CPM 2006: 188-199 - [c3]Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein:
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing. ICALP (1) 2006: 358-369 - 2005
- [c2]Tsvi Kopelowitz, Ely Porat:
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. ICTCS 2005: 309-322 - [c1]Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
