Personal profile
Research interests
I am interested in the analysis of algorithms and data structures at large, with a special focus on dynamic problems. Some of my recent research has focused on:
- Advanced data structures, with an emphasis on indexing data structures and dynamizing static data structures.
- (Dynamic) graph problems.
- Conditional lower bounds and fine-grained complexity.
- Pattern Matching algorithms and stringology.
- Algorithms for distributed computing.
Fingerprint
Dive into the research topics where Tsvi Kopelowitz is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
An Improved Algorithm for The k-Dyck Edit Distance Problem
Fried, D., Golan, S., Kociumaka, T., Kopelowitz, T., Porat, E. & Starikovskaya, T., 21 Jun 2024, In: ACM Transactions on Algorithms. 20, 3Research output: Contribution to journal › Article › peer-review
Open Access -
On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch
Kopelowitz, T., Korin, A. & Roditty, L., Jul 2024, 51st International Colloquium on Automata, Languages, and Programming, ICALP 2024. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 101. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 297).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices
Fried, D., Kopelowitz, T. & Porat, E., Sep 2024, 32nd Annual European Symposium on Algorithms, ESA 2024. Chan, T., Fischer, J., Iacono, J. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 57. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 308).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
An Improved Algorithm for The k-Dyck Edit Distance Problem
Fried, D., Golan, S., Kociumaka, T., Kopelowitz, T., Porat, E. & Starikovskaya, T., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. p. 3650-3669 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue
Hoefer, M. & Kopelowitz, T., 22 Jan 2022, In: ACM Transactions on Algorithms. 18, 1, 43.Research output: Contribution to journal › Editorial