Tsvi Kopelowitz

1.1k total citations
38 papers, 229 citations indexed

About

Tsvi Kopelowitz is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Tsvi Kopelowitz has authored 38 papers receiving a total of 229 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Artificial Intelligence, 18 papers in Computer Networks and Communications and 16 papers in Computational Theory and Mathematics. Recurrent topics in Tsvi Kopelowitz's work include Algorithms and Data Compression (21 papers), DNA and Biological Computing (10 papers) and Optimization and Search Problems (9 papers). Tsvi Kopelowitz is often cited by papers focused on Algorithms and Data Compression (21 papers), DNA and Biological Computing (10 papers) and Optimization and Search Problems (9 papers). Tsvi Kopelowitz collaborates with scholars based in United States, Israel and Denmark. Tsvi Kopelowitz's co-authors include Seth Pettie, Yi‐Jun Chang, Moshe Lewenstein, Ely Porat, Orgad Keller, Michael A. Bender, Maxwell Young, Amihood Amir, Ruosong Wang and Wei Zhan and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Tsvi Kopelowitz

35 papers receiving 219 citations

Peers

Tsvi Kopelowitz
Amr Elmasry Egypt
Jonathan F. Buss Canada
Manuela Fischer Switzerland
Milan Ružić Denmark
S. W. Song Brazil
Martti Penttonen Finland
Miki Hermann France
Virginia Vassilevska United States
Peter van Emde Boas Netherlands
Mark R. Brown United States
Amr Elmasry Egypt
Tsvi Kopelowitz
Citations per year, relative to Tsvi Kopelowitz Tsvi Kopelowitz (= 1×) peers Amr Elmasry

Countries citing papers authored by Tsvi Kopelowitz

Since Specialization
Citations

This map shows the geographic impact of Tsvi Kopelowitz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tsvi Kopelowitz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tsvi Kopelowitz more than expected).

Fields of papers citing papers by Tsvi Kopelowitz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tsvi Kopelowitz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tsvi Kopelowitz. The network helps show where Tsvi Kopelowitz may publish in the future.

Co-authorship network of co-authors of Tsvi Kopelowitz

This figure shows the co-authorship network connecting the top 25 collaborators of Tsvi Kopelowitz. A scholar is included among the top collaborators of Tsvi Kopelowitz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tsvi Kopelowitz. Tsvi Kopelowitz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Huang, Dawei, et al.. (2023). Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time. SHILAP Revista de lepidopterología. Volume 2.
2.
Kociumaka, Tomasz, et al.. (2023). An Improved Algorithm for The k -Dyck Edit Distance Problem. ACM Transactions on Algorithms. 20(3). 1–25. 1 indexed citations
3.
Bender, Michael A., et al.. (2021). Incremental Edge Orientation in Forests. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
4.
Kopelowitz, Tsvi & Virginia Vassilevska Williams. (2020). Towards optimal set-disjointness and set-intersection data structures. DSpace@MIT (Massachusetts Institute of Technology). 2 indexed citations
5.
Kopelowitz, Tsvi, et al.. (2020). AnO(log3/2n) Parallel Time Population Protocol for Majority withO(logn) States. 191–199. 3 indexed citations
6.
Chang, Yi‐Jun, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, & Wei Zhan. (2019). Exponential Separations in the Energy Complexity of Leader Election. ACM Transactions on Algorithms. 15(4). 1–31. 12 indexed citations
7.
Huang, Dawei, et al.. (2017). Fully dynamic connectivity in O(log n(log log n)2) amortized expected time. arXiv (Cornell University). 510–520. 7 indexed citations
8.
Bender, Michael A., Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, & Pablo Fernández. (2017). File maintenance: when in doubt, change the layout!. Symposium on Discrete Algorithms. 1503–1522. 2 indexed citations
9.
Bender, Michael A., Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, & Pablo Fernández. (2017). File Maintenance: When in Doubt, Change the Layout!. 4 indexed citations
10.
Kopelowitz, Tsvi, Seth Pettie, & Ely Porat. (2016). Higher lower bounds from the 3SUM conjecture. Symposium on Discrete Algorithms. 1272–1287. 16 indexed citations
11.
Bender, Michael A., Tsvi Kopelowitz, Seth Pettie, & Maxwell Young. (2016). Contention resolution with log-logstar channel accesses. 499–508. 15 indexed citations
12.
Chang, Yi‐Jun, Tsvi Kopelowitz, & Seth Pettie. (2016). Brief Announcement. 195–197. 1 indexed citations
13.
Kopelowitz, Tsvi & Ely Porat. (2015). Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. 48. 601–613. 1 indexed citations
14.
Kopelowitz, Tsvi, et al.. (2013). Cross-document pattern matching. Journal of Discrete Algorithms. 24. 40–47. 5 indexed citations
15.
Keller, Orgad, Tsvi Kopelowitz, Shir Landau Feibish, & Moshe Lewenstein. (2013). Generalized substring compression. Theoretical Computer Science. 525. 42–54. 7 indexed citations
16.
Bartal, Yair, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, & Liam Roditty. (2011). Fast, precise and dynamic distance queries. arXiv (Cornell University). 840–853. 3 indexed citations
17.
Keller, Orgad, Tsvi Kopelowitz, & Moshe Lewenstein. (2009). On the longest common parameterized subsequence. Theoretical Computer Science. 410(51). 5347–5353. 18 indexed citations
18.
Amir, Amihood, et al.. (2008). Property matching and weighted matching. Theoretical Computer Science. 395(2-3). 298–310. 16 indexed citations
19.
Kopelowitz, Tsvi & Moshe Lewenstein. (2007). Dynamic weighted ancestors. Symposium on Discrete Algorithms. 565–574. 9 indexed citations
20.
Kopelowitz, Tsvi & Ely Porat. (2007). Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. Theory of Computing Systems. 42(3). 349–365. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Amr Elmasry Breakdown of academic impact, for papers by Jonathan F. Buss Breakdown of academic impact, for papers by Manuela Fischer Breakdown of academic impact, for papers by Milan Ružić Breakdown of academic impact, for papers by S. W. Song Breakdown of academic impact, for papers by Martti Penttonen Breakdown of academic impact, for papers by Miki Hermann Breakdown of academic impact, for papers by Virginia Vassilevska Breakdown of academic impact, for papers by Peter van Emde Boas Breakdown of academic impact, for papers by Mark R. Brown
Rankless by CCL
2026