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.
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.
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.
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.
Let Sleeping Files Lie
Amihood Amir;Gary Benson;Martin Farach.
Journal of Computer and System Sciences (1996)
Efficient two-dimensional compressed matching
A. Amir;C. Benson.
data compression conference (1992)
Faster algorithms for string matching with k mismatches
Amihood Amir;Moshe Lewenstein;Ely Porat.
symposium on discrete algorithms (2000)
Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
Amihood Amir;Dmitry Keselman.
SIAM Journal on Computing (1997)
Efficient Algorithms for Discovering Frequent Sets in Incremental Databases.
Ronen Feldman;Yonatan Aumann;Amihood Amir;Heikki Mannila.
Improved Dynamic Dictionary Matching
A. Amir;M. Farach;R.M. Idury;J.A. Lapoutre.
Information & Computation (1995)
Some connections between bounded query classes and nonuniform complexity
A. Amir;R. Beigel;W.I. Gasarch.
structure in complexity theory annual conference (1990)
Dynamic dictionary matching
Amihood Amir;Martin Farach;Zvi Galil;Raffaele Giancarlo.
Journal of Computer and System Sciences (1994)
Alphabet dependence in parameterized matching
Amihood Amir;Martin Farach;S. Muthukrishnan.
Information Processing Letters (1994)
Efficient pattern matching with scaling
Amihood Amir;Gad M. Landau;Uzi Vishkin;Uzi Vishkin.
Journal of Algorithms (1992)
Logic Journal of the IGPL
(Impact Factor: 0.868)
If you think any of the details on this page are incorrect, let us know.
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: