| Let sleeping files lie: Pattern matching in Z-compressed files A Amir, G Benson, M Farach Journal of Computer and System Sciences 52 (2), 299-307, 1996 | 298 | 1996 |
| Faster algorithms for string matching with k mismatches A Amir, M Lewenstein, E Porat Journal of Algorithms 50 (2), 257-275, 2004 | 277 | 2004 |
| Efficient two-dimensional compressed matching A Amir, C Benson 1992 Data Compression Conference, 279,280,281,282,283,284,285,286,287,288 …, 1992 | 238 | 1992 |
| Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms A Amir, D Keselman SIAM Journal on Computing 26 (6), 1656-1669, 1997 | 146 | 1997 |
| Improved dynamic dictionary matching A Amir, M Farach, RM Idury, JA Lapoutre, AA Schaffer Information and Computation 119 (2), 258-282, 1995 | 143 | 1995 |
| Two-dimensional periodicity and its applications A Amir, G Benson Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms …, 1992 | 142* | 1992 |
| Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. R Feldman, Y Aumann, A Amir, H Mannila DMKD, 0-, 1997 | 141 | 1997 |
| Dynamic dictionary matching A Amir, M Farach, Z Galil, R Giancarlo, K Park Journal of Computer and System Sciences 49 (2), 208-222, 1994 | 138 | 1994 |
| Some connections between bounded query classes and nonuniform complexity A Amir, R Beigel, WI Gasarch Proceedings Fifth Annual Structure in Complexity Theory Conference, 232-243, 1990 | 138 | 1990 |
| Alphabet dependence in parameterized matching A Amir, M Farach, S Muthukrishnan Information Processing Letters 49 (3), 111-115, 1994 | 127 | 1994 |
| A new and versatile method for association generation A Amir, R Feldman, R Kashi Principles of Data Mining and Knowledge Discovery: First European Symposium …, 1997 | 123 | 1997 |
| Efficient pattern matching with scaling A Amir, GM Landau, U Vishkin Journal of Algorithms 13 (1), 2-32, 1992 | 115 | 1992 |
| Pattern matching with swaps A Amir, Y Aumann, GM Landau, M Lewenstein, N Lewenstein Journal of algorithms 37 (2), 247-266, 2000 | 107 | 2000 |
| An alphabet independent approach to two-dimensional pattern matching A Amir, G Benson, M Farach SIAM Journal on Computing 23 (2), 313-323, 1994 | 97 | 1994 |
| Polynomial terse sets A Amir, WI Gasarch Information and Computation 77 (1), 37-56, 1988 | 94 | 1988 |
| On hardness of jumbled indexing A Amir, TM Chan, M Lewenstein, N Lewenstein International Colloquium on Automata, Languages, and Programming, 114-125, 2014 | 93 | 2014 |
| Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. R Feldman, Y Aumann, A Amir, A Zilberstein, W Kloesgen KDD, 167-170, 1997 | 92 | 1997 |
| Fast parallel and serial multidimensional approximate array matching A Amir, GM Landau Sequences: Combinatorics, Compression, Security, and Transmission, 3-24, 1990 | 89 | 1990 |
| Text indexing and dictionary matching with one error A Amir, D Keselman, GM Landau, M Lewenstein, N Lewenstein, M Rodeh Journal of Algorithms 37 (2), 309-325, 2000 | 87 | 2000 |
| Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms D Keselman, A Amir Proceedings 35th Annual Symposium on Foundations of Computer Science, 758-769, 1994 | 86 | 1994 |
