Amihood Amir

4.6k total citations
159 papers, 1.9k citations indexed

About

Amihood Amir is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Amihood Amir has authored 159 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 128 papers in Artificial Intelligence, 68 papers in Molecular Biology and 68 papers in Computational Theory and Mathematics. Recurrent topics in Amihood Amir's work include Algorithms and Data Compression (110 papers), DNA and Biological Computing (60 papers) and semigroups and automata theory (47 papers). Amihood Amir is often cited by papers focused on Algorithms and Data Compression (110 papers), DNA and Biological Computing (60 papers) and semigroups and automata theory (47 papers). Amihood Amir collaborates with scholars based in United States, Israel and Indonesia. Amihood Amir's co-authors include Martı́n Farach-Colton, Gary Benson, Moshe Lewenstein, Gad M. Landau, Ely Porat, Yonatan Aumann, Ronen Feldman, Noa Lewenstein, William Gasarch and S. Muthukrishnan and has published in prestigious journals such as Bioinformatics, European Journal of Operational Research and Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences.

In The Last Decade

Amihood Amir

145 papers receiving 1.8k citations

Peers

Amihood Amir
Gad M. Landau Israel
Maxime Crochemore France
Alberto Apostolico United States
Raffaele Giancarlo Italy
Giovanni Manzini Italy
Roberto Grossi Italy
D. S. Hirschberg United States
Thomas G. Szymanski United States
Venkatesh Raman India
Moshe Lewenstein Israel
Gad M. Landau Israel
Amihood Amir
Citations per year, relative to Amihood Amir Amihood Amir (= 1×) peers Gad M. Landau

Countries citing papers authored by Amihood Amir

Since Specialization
Citations

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

Fields of papers citing papers by Amihood Amir

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Amihood Amir

This figure shows the co-authorship network connecting the top 25 collaborators of Amihood Amir. A scholar is included among the top collaborators of Amihood Amir 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 Amihood Amir. Amihood Amir 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.
Amir, Amihood, et al.. (2024). On the Practical Power of Automata in Pattern Matching. SN Computer Science. 5(4).
2.
Amir, Amihood, et al.. (2023). Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theoretical Computer Science. 981. 114230–114230.
3.
Amir, Amihood, et al.. (2020). Dynamic and Internal Longest Common Substring. Algorithmica. 82(12). 3707–3743. 13 indexed citations
4.
Amir, Amihood, et al.. (2019). Repetition Detection in a Dynamic String. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 18. 5 indexed citations
5.
Amir, Amihood & Laxmi Parida. (2010). Combinatorial pattern matching : 21st annual symposium, CPM 2010, New York, NY, USA, June 21 - 23, 2010 : proceedings. Springer eBooks. 2 indexed citations
6.
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
7.
Amir, Amihood, Gad M. Landau, & Dina Sokol. (2003). Inplace 2D matching in compressed images. Symposium on Discrete Algorithms. 853–862. 5 indexed citations
8.
Amir, Amihood, et al.. (2002). Separable attributes: a technique for solving the sub matrices character count problem. Symposium on Discrete Algorithms. 400–401. 4 indexed citations
9.
Amir, Amihood, et al.. (2001). Analyzing Quantitative Databases: Image is Everything. Very Large Data Bases. 89–98. 2 indexed citations
10.
Amir, Amihood, Ely Porat, & Moshe Lewenstein. (2001). Approximate subset matching with Don't Cares. Symposium on Discrete Algorithms. 305–306. 9 indexed citations
11.
Amir, Amihood, et al.. (2000). Real scaled matching. Symposium on Discrete Algorithms. 815–816. 2 indexed citations
12.
Amir, Amihood, Gad M. Landau, & Dina Sokol. (2000). Inplace run-length 2d compressed search. Symposium on Discrete Algorithms. 817–818. 6 indexed citations
13.
Amir, Amihood, Moshe Lewenstein, & Ely Porat. (2000). Faster algorithms for string matching with k mismatches. Symposium on Discrete Algorithms. 50(2). 794–803. 38 indexed citations
14.
Amir, Amihood, et al.. (1999). Indexing and Dictionary Matching with One Error. 181–192. 10 indexed citations
15.
Koren, G., et al.. (1998). The power of migration in multi-processor scheduling of real-time systems. Symposium on Discrete Algorithms. 226–235. 12 indexed citations
16.
Amir, Amihood, Gary Benson, & Martı́n Farach-Colton. (1994). Let sleeping files lie: pattern matching in Z-compressed files. Symposium on Discrete Algorithms. 705–714. 28 indexed citations
17.
Amir, Amihood, Martı́n Farach-Colton, Ramana M. Idury, J. A. La Poutré, & Alejandro A. Schäffer. (1993). Improved dynamic dictionary matching. Symposium on Discrete Algorithms. 392–401. 20 indexed citations
18.
Amir, Amihood & Gary Benson. (1992). Two-dimensional periodicity and its applications. Symposium on Discrete Algorithms. 440–452. 43 indexed citations
19.
Amir, Amihood & Martı́n Farach-Colton. (1991). Efficient 2-dimensional approximate matching of non-rectangular figures. Symposium on Discrete Algorithms. 212–223. 18 indexed citations
20.
Amir, Amihood & William Gasarch. (1987). Polynomial Terse Sets (Extended Abstract). 22–27. 1 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 Gad M. Landau Breakdown of academic impact, for papers by Maxime Crochemore Breakdown of academic impact, for papers by Alberto Apostolico Breakdown of academic impact, for papers by Raffaele Giancarlo Breakdown of academic impact, for papers by Giovanni Manzini Breakdown of academic impact, for papers by Roberto Grossi Breakdown of academic impact, for papers by D. S. Hirschberg Breakdown of academic impact, for papers by Thomas G. Szymanski Breakdown of academic impact, for papers by Venkatesh Raman Breakdown of academic impact, for papers by Moshe Lewenstein
Rankless by CCL
2026