D-Index & Metrics Best Publications

D-Index & Metrics

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Computer Science D-index 42 Citations 5,349 189 World Ranking 4144 National Ranking 77

Overview

What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Artificial intelligence
  • Algebra

His scientific interests lie mostly in Matching, Algorithm, Combinatorics, Pattern matching and Discrete mathematics. His 3-dimensional matching study, which is part of a larger body of work in Matching, is frequently linked to Bounded function, bridging the gap between disciplines. The concepts of his Algorithm study are interwoven with issues in Substring, Permutation and Character.

His study on Time complexity is often connected to SIMPLE algorithm as part of broader study in Combinatorics. His research in Pattern matching tackles topics such as Compressed pattern matching which are related to areas like Data compression. Parameterized complexity, Order, Analysis of algorithms and Polynomial is closely connected to Algorithmics in his research, which is encompassed under the umbrella topic of Discrete mathematics.

His most cited work include:

  • Let Sleeping Files Lie (153 citations)
  • Efficient two-dimensional compressed matching (150 citations)
  • Alphabet dependence in parameterized matching (101 citations)

What are the main themes of his work throughout his whole career to date?

Amihood Amir mainly investigates Combinatorics, Pattern matching, Algorithm, Discrete mathematics and Time complexity. In the subject of general Combinatorics, his work in Hamming distance, Binary logarithm and Approximation algorithm is often linked to Bounded function, thereby combining diverse domains of study. His Pattern matching study incorporates themes from Matching, Approximate string matching, 3-dimensional matching and String searching algorithm.

His work in Matching addresses subjects such as Compressed pattern matching, which are connected to disciplines such as Data compression. His studies deal with areas such as Preprocessor, Theoretical computer science and Type as well as Algorithm. His Discrete mathematics research integrates issues from String metric, Computational complexity theory, Jaro–Winkler distance, Dynamic programming and Order.

He most often published in these fields:

  • Combinatorics (51.58%)
  • Pattern matching (46.67%)
  • Algorithm (33.68%)

What were the highlights of his more recent work (between 2013-2021)?

  • Combinatorics (51.58%)
  • Pattern matching (46.67%)
  • Discrete mathematics (32.63%)

In recent papers he was focusing on the following fields of study:

Combinatorics, Pattern matching, Discrete mathematics, Matching and Substring are his primary areas of study. In the field of Combinatorics, his study on Hamming distance and Time complexity overlaps with subjects such as Bounded function. His Pattern matching research is multidisciplinary, relying on both Algorithm and Bipartite graph.

His Discrete mathematics research incorporates themes from Formal language and Relaxation. The study incorporates disciplines such as Constant, Parameterized complexity, String searching algorithm and Character in addition to Matching. His Substring study integrates concerns from other disciplines, such as Theoretical computer science and Line.

Between 2013 and 2021, his most popular works were:

  • On Hardness of Jumbled Indexing (55 citations)
  • On Hardness of Jumbled Indexing (55 citations)
  • On the relationship between histogram indexing and block-mass indexing. (11 citations)

In his most recent research, the most cited papers focused on:

  • Artificial intelligence
  • Algorithm
  • Algebra

His primary areas of investigation include Combinatorics, Pattern matching, Matching, Discrete mathematics and Algorithm. The Combinatorics study combines topics in areas such as String searching algorithm, Position and Suffix tree. He combines Pattern matching and Prefix in his research.

His Discrete mathematics research is multidisciplinary, incorporating elements of Relaxation and Formal language. His Algorithm study combines topics in areas such as Search engine indexing, Permutation and Substring. He interconnects Theoretical computer science and Palindrome in the investigation of issues within Substring.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Let Sleeping Files Lie

Amihood Amir;Gary Benson;Martin Farach.
Journal of Computer and System Sciences (1996)

234 Citations

Efficient two-dimensional compressed matching

A. Amir;C. Benson.
data compression conference (1992)

227 Citations

Faster algorithms for string matching with k mismatches

Amihood Amir;Moshe Lewenstein;Ely Porat.
symposium on discrete algorithms (2000)

168 Citations

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

Amihood Amir;Dmitry Keselman.
SIAM Journal on Computing (1997)

144 Citations

Efficient Algorithms for Discovering Frequent Sets in Incremental Databases.

Ronen Feldman;Yonatan Aumann;Amihood Amir;Heikki Mannila.
DMKD (1997)

143 Citations

Improved Dynamic Dictionary Matching

A. Amir;M. Farach;R.M. Idury;J.A. Lapoutre.
Information & Computation (1995)

139 Citations

Some connections between bounded query classes and nonuniform complexity

A. Amir;R. Beigel;W.I. Gasarch.
structure in complexity theory annual conference (1990)

139 Citations

Dynamic dictionary matching

Amihood Amir;Martin Farach;Zvi Galil;Raffaele Giancarlo.
Journal of Computer and System Sciences (1994)

137 Citations

Alphabet dependence in parameterized matching

Amihood Amir;Martin Farach;S. Muthukrishnan.
Information Processing Letters (1994)

121 Citations

Efficient pattern matching with scaling

Amihood Amir;Gad M. Landau;Uzi Vishkin;Uzi Vishkin.
Journal of Algorithms (1992)

119 Citations

Editorial Boards

Logic Journal of the IGPL
(Impact Factor: 0.868)

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

Contact us

Best Scientists Citing Amihood Amir

Costas S. Iliopoulos

Costas S. Iliopoulos

King's College London

Publications: 47

Gonzalo Navarro

Gonzalo Navarro

University of Chile

Publications: 40

Gad M. Landau

Gad M. Landau

University of Haifa

Publications: 38

Maxime Crochemore

Maxime Crochemore

King's College London

Publications: 38

Kunsoo Park

Kunsoo Park

Seoul National University

Publications: 28

Tak-Wah Lam

Tak-Wah Lam

University of Hong Kong

Publications: 28

Wojciech Rytter

Wojciech Rytter

University of Warsaw

Publications: 27

Wing-Kin Sung

Wing-Kin Sung

National University of Singapore

Publications: 22

Paolo Ferragina

Paolo Ferragina

University of Pisa

Publications: 22

Richard Beigel

Richard Beigel

Temple University

Publications: 21

Veli Mäkinen

Veli Mäkinen

University of Helsinki

Publications: 20

Lane A. Hemaspaandra

Lane A. Hemaspaandra

University of Rochester

Publications: 15

Kunihiko Sadakane

Kunihiko Sadakane

University of Tokyo

Publications: 13

Jeffrey Scott Vitter

Jeffrey Scott Vitter

University of Mississippi

Publications: 13

Ronen Feldman

Ronen Feldman

Hebrew University of Jerusalem

Publications: 10

Piotr Indyk

Piotr Indyk

MIT

Publications: 10

Something went wrong. Please try again later.