Avivit Levy

467 total citations
32 papers, 125 citations indexed

About

Avivit Levy is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Avivit Levy has authored 32 papers receiving a total of 125 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Artificial Intelligence, 16 papers in Molecular Biology and 16 papers in Computational Theory and Mathematics. Recurrent topics in Avivit Levy's work include Algorithms and Data Compression (29 papers), DNA and Biological Computing (16 papers) and semigroups and automata theory (13 papers). Avivit Levy is often cited by papers focused on Algorithms and Data Compression (29 papers), DNA and Biological Computing (16 papers) and semigroups and automata theory (13 papers). Avivit Levy collaborates with scholars based in Israel, United States and Italy. Avivit Levy's co-authors include Amihood Amir, Ely Porat, Yonatan Aumann, Gary Benson, Steven Skiena, Gad M. Landau, Uzi Vishne, Moshe Lewenstein, Alberto Apostolico and David Pritchard and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Avivit Levy

29 papers receiving 124 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Avivit Levy Israel 7 110 60 49 24 18 32 125
Paweł Gawrychowski Poland 9 134 1.2× 68 1.1× 71 1.4× 13 0.5× 35 1.9× 46 180
Jakub Radoszewski Poland 8 171 1.6× 85 1.4× 85 1.7× 8 0.3× 50 2.8× 46 191
I Tomohiro Japan 7 144 1.3× 75 1.3× 52 1.1× 6 0.3× 40 2.2× 37 156
Tomasz Waleń Poland 10 182 1.7× 213 3.5× 90 1.8× 28 1.2× 52 2.9× 40 334
Sabrina Mantaci Italy 8 183 1.7× 103 1.7× 111 2.3× 8 0.3× 20 1.1× 23 222
Dina Sokol United States 7 163 1.5× 165 2.8× 65 1.3× 18 0.8× 40 2.2× 21 248
Dominik Kempa Finland 7 108 1.0× 54 0.9× 19 0.4× 7 0.3× 47 2.6× 24 114
Gheorghe Ştefănescu Romania 9 100 0.9× 35 0.6× 82 1.7× 41 1.7× 30 1.7× 30 214
Noa Lewenstein Israel 7 132 1.2× 83 1.4× 72 1.5× 8 0.3× 37 2.1× 14 152
Markus L. Schmid Germany 6 72 0.7× 25 0.4× 61 1.2× 4 0.2× 8 0.4× 34 98

Countries citing papers authored by Avivit Levy

Since Specialization
Citations

This map shows the geographic impact of Avivit Levy'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 Avivit Levy with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Avivit Levy more than expected).

Fields of papers citing papers by Avivit Levy

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Avivit Levy. 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 Avivit Levy. The network helps show where Avivit Levy may publish in the future.

Co-authorship network of co-authors of Avivit Levy

This figure shows the co-authorship network connecting the top 25 collaborators of Avivit Levy. A scholar is included among the top collaborators of Avivit Levy 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 Avivit Levy. Avivit Levy 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.
Levy, Avivit, et al.. (2025). A guide to similarity measures and their data science applications. Journal Of Big Data. 12(1). 1 indexed citations
2.
Levy, Avivit & Dana Shapira. (2024). Computation over APT compressed data. Information Systems. 129. 102504–102504.
3.
Levy, Avivit, et al.. (2021). A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges. Algorithmica. 84(3). 590–638.
4.
Amir, Amihood, et al.. (2019). Can We Recover the Cover?. Algorithmica. 81(7). 2857–2875. 3 indexed citations
5.
Amir, Amihood, et al.. (2015). Dictionary matching with a few gaps. Theoretical Computer Science. 589. 34–46. 5 indexed citations
6.
Benson, Gary, et al.. (2015). LCSk: A refined similarity measure. Theoretical Computer Science. 638. 11–26. 5 indexed citations
7.
Amir, Amihood, et al.. (2015). Approximate periodicity. Information and Computation. 241. 215–226. 3 indexed citations
8.
Amir, Amihood, Alberto Apostolico, Gad M. Landau, et al.. (2014). Range LCP. Journal of Computer and System Sciences. 80(7). 1245–1253. 7 indexed citations
9.
Amir, Amihood, et al.. (2014). Closest periodic vectors inLpspaces. Theoretical Computer Science. 533. 26–36. 2 indexed citations
10.
Boucher, Christina, Gad M. Landau, Avivit Levy, David Pritchard, & Oren Weimann. (2013). On approximating string selection problems with outliers. Theoretical Computer Science. 498. 107–114. 6 indexed citations
11.
Amir, Amihood, et al.. (2013). Detecting approximate periodic patterns. Theoretical Computer Science. 525. 60–67. 4 indexed citations
12.
Amir, Amihood, et al.. (2012). Cycle detection and correction. ACM Transactions on Algorithms. 9(1). 1–20. 6 indexed citations
13.
Amir, Amihood, et al.. (2011). Quasi-distinct parsing and optimal compression methods. Theoretical Computer Science. 422. 1–14. 5 indexed citations
14.
Amir, Amihood, et al.. (2011). Approximate string matching with stuck address bits. Theoretical Computer Science. 412(29). 3537–3544. 2 indexed citations
15.
Landau, Gad M., Avivit Levy, & Ilan Newman. (2010). LCS approximation via embedding into locally non-repetitive strings. Information and Computation. 209(4). 705–716. 4 indexed citations
16.
Amir, Amihood, et al.. (2009). Approximate string matching with address bit errors. Theoretical Computer Science. 410(51). 5334–5346. 2 indexed citations
17.
Amir, Amihood, Yonatan Aumann, Piotr Indyk, Avivit Levy, & Ely Porat. (2009). Efficient computations ofℓ1 andℓ∞ rearrangement distances. Theoretical Computer Science. 410(43). 4382–4390. 4 indexed citations
18.
Amir, Amihood, Yonatan Aumann, Gary Benson, et al.. (2009). Pattern matching with address errors: Rearrangement distances. Journal of Computer and System Sciences. 75(6). 359–370. 13 indexed citations
19.
Landau, Gad M., et al.. (2009). Interchange rearrangement: The element-cost model. Theoretical Computer Science. 410(43). 4315–4326. 3 indexed citations
20.
Amir, Amihood, Yonatan Aumann, Gary Benson, et al.. (2006). Pattern matching with address errors: rearrangement distances. Symposium on Discrete Algorithms. 1221–1229. 15 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 Paweł Gawrychowski Breakdown of academic impact, for papers by Jakub Radoszewski Breakdown of academic impact, for papers by I Tomohiro Breakdown of academic impact, for papers by Tomasz Waleń Breakdown of academic impact, for papers by Sabrina Mantaci Breakdown of academic impact, for papers by Dina Sokol Breakdown of academic impact, for papers by Dominik Kempa Breakdown of academic impact, for papers by Gheorghe Ştefănescu Breakdown of academic impact, for papers by Noa Lewenstein Breakdown of academic impact, for papers by Markus L. Schmid
Rankless by CCL
2026