World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
44
Citations
5990
World Ranking
7705
National Ranking
125

Overview

Amihood Amir is a researcher affiliated with Bar-Ilan University in Israel, with a focus primarily on computer science and related interdisciplinary fields. Their research involves areas intersecting algorithms, data compression, and biological computation, exploring both theoretical and applied domains.

The main fields of study in their work include:

  • Computer Science
  • Biochemistry, Genetics and Molecular Biology

Amihood Amir's subfields of study illustrate a diverse research portfolio, covering:

  • Artificial Intelligence
  • Molecular Biology
  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition

The main topics covered in their research emphasize specific technical and scientific areas:

  • Algorithms and Data Compression
  • DNA and Biological Computing
  • Network Packet Processing and Optimization
  • Semigroups and Automata Theory
  • Natural Language Processing Techniques
  • Genomics and Phylogenetic Studies
  • Cellular Automata and Applications

They have frequently collaborated with several researchers, including:

  • Eitan Kondratovsky
  • Dina Sokol
  • Gad M. Landau
  • Shoshana Marcus
  • Avivit Levy

Amihood Amir has contributed to a number of scientific publications in recognized venues. Their recent papers include:

  • Dynamic and Internal Longest Common Substring (2020), published in Algorithmica
  • Update Query Time Trade-Off for Dynamic Suffix Arrays (2020), published in Dagstuhl Research Online Publication Server
  • Settlement development based on land suitability (2020), published in IOP Conference Series Earth and Environmental Science
  • Finding patterns and periods in Cartesian tree matching (2020), published in Theoretical Computer Science
  • Double String Tandem Repeats (2022), published in Algorithmica

The scientist has been consistently published in the following frequent venues:

  • Theoretical Computer Science
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • Algorithmica
  • SSRN Electronic Journal

Best Publications

  • Let Sleeping Files Lie

    Amihood Amir;Gary Benson;Martin Farach

  • Efficient two-dimensional compressed matching

    A. Amir;C. Benson

  • Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms

    Amihood Amir;Dmitry Keselman

  • Improved Dynamic Dictionary Matching

    A. Amir;M. Farach;R.M. Idury;J.A. Lapoutre

  • Efficient Algorithms for Discovering Frequent Sets in Incremental Databases.

    Ronen Feldman;Yonatan Aumann;Amihood Amir;Heikki Mannila

  • Some connections between bounded query classes and nonuniform complexity

    A. Amir;R. Beigel;W.I. Gasarch

  • Dynamic dictionary matching

    Amihood Amir;Martin Farach;Zvi Galil;Raffaele Giancarlo

  • Alphabet dependence in parameterized matching

    Amihood Amir;Martin Farach;S. Muthukrishnan

  • Efficient pattern matching with scaling

    Amihood Amir;Gad M. Landau;Uzi Vishkin;Uzi Vishkin

  • Pattern Matching with Swaps

    Amihood Amir;Yonatan Aumann;Gad M. Landau;Moshe Lewenstein

  • Two-dimensional periodicity and its applications

    Amihood Amir;Gary Benson

  • Faster algorithms for string matching with k mismatches

    Amihood Amir;Moshe Lewenstein;Ely Porat

  • Polynomial terse sets

    Amihood Amir;William I. Gasarch

  • An Alphabet Independent Approach to Two-Dimensional Pattern Matching

    Amihood Amir;Gary Benson;Martin Farach

  • Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms

    D. Keselman;A. Amir

  • A new and versatile method for association generation

    Amihood Amir;Ronen Feldman;Reuven Kashi

  • Maximal association rules: a new tool for mining for keyword co-occurrences in document collections

    Ronen Feldman;Yonatan Aumann;Amihood Amir;Amir Zilberstein

  • Text Indexing and Dictionary Matching with One Error

    Amihood Amir;Dmitry Keselman;Gad M. Landau;Moshe Lewenstein

  • Adaptive dictionary matching

    A. Amir;M. Farach

  • Alphabet independent two dimensional matching

    Amihood Amir;Gary Benson;Martin Farach

  • Let sleeping files lie: pattern matching in Z-compressed files

    Amihood Amir;Gary Benson;Martin Farach

  • Improved dynamic dictionary matching

    Amihood Amir;Martin Farach;Ramana M. Idury;Johannes A. La Poutré

Frequent Co-Authors

Gad M. Landau
Gad M. Landau University of Haifa
Ely Porat
Ely Porat Bar-Ilan University
Martin Farach
Martin Farach New York University
Costas S. Iliopoulos
Costas S. Iliopoulos King's College London
Liam Roditty
Liam Roditty Bar-Ilan University
Ronen Feldman
Ronen Feldman Hebrew University of Jerusalem
Richard Beigel
Richard Beigel Temple University
Uzi Vishkin
Uzi Vishkin University of Maryland, College Park
Andrew Turpin
Andrew Turpin University of Melbourne

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science can open doors to many related fields through flexible online learning options. For students interested in the broader STEM landscape, you might wonder, can you get a physics degree online? Today, accredited programs make this possible, often at a lower cost and with more flexibility than ever before.

Another popular route is data science. Following a data science learning path online can provide in-demand technical skills and strong career prospects. Similarly, pursuing an online bachelor’s in electrical engineering offers the chance to gain a foundational engineering background while studying remotely.

For those aiming for quick entry into tech careers, consider looking into easy certifications to get online. These can offer specialized skills in less time, leading to well-paying jobs without years of study. Whatever your goals, online programs present flexible and affordable pathways across the computer science field and beyond.

Best Scientists Citing Amihood Amir

Trending Scientists