Amihood Amir

Amihood Amir, Haim Paryenty, Liam Roditty: On the hardness of the Consensus String problem. Inf. Process. Lett. 113(10-11): 371-374 (2013)

Amihood Amir, Laxmi Parida: Combinatorial Pattern Matching (CPM 2010). Inf. Comput. 213: 1 (2012)

Amihood Amir, Haim Parienty: Towards a theory of patches. J. Discrete Algorithms 12: 61-73 (2012)

Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira: Cycle detection and correction. ACM Transactions on Algorithms 9(1): 13 (2012)

Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko: Quasi-distinct parsing and optimal compression methods. Theor. Comput. Sci. 422: 1-14 (2012)

Amihood Amir, Alberto Apostolico, Estrella Eisenberg, Gad M. Landau, Avivit Levy, Noa Lewenstein: Detecting Approximate Periodic Patterns. MedAlg 2012: 1-12

Amihood Amir, Avivit Levy: Approximate Period Detection and Correction. SPIRE 2012: 1-15

Amihood Amir, Haim Paryenty, Liam Roditty: Configurations and Minority in the String Consensus Problem. SPIRE 2012: 42-53

Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat: Approximate string matching with stuck address bits. Theor. Comput. Sci. 412(29): 3537-3544 (2011)

Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim: Efficient algorithms for consensus string problems minimizing both distance sum and radius. Theor. Comput. Sci. 412(39): 5239-5246 (2011)

Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat: Range LCP. ISAAC 2011: 683-692

Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein: Closest Periodic Vectors in L p Spaces. ISAAC 2011: 714-723

Julio Ng, Amihood Amir, Pavel A. Pevzner: Blocked Pattern Matching Problem and Its Applications in Proteomics. RECOMB 2011: 298-319

Amihood Amir, Zvi Gotthilf, B. Riva Shalom: Weighted Shortest Common Supersequence. SPIRE 2011: 44-54

Amihood Amir, Haim Parienty, Liam Roditty: Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE 2011: 168-173

Amihood Amir, Eran Chencinski: Faster Two Dimensional Scaled Matching. Algorithmica 56(2): 214-234 (2010)

Amihood Amir, Zvi Gotthilf, B. Riva Shalom: Weighted LCS. J. Discrete Algorithms 8(3): 273-281 (2010)

Amihood Amir, Avivit Levy: String Rearrangement Metrics: A Survey. Algorithms and Applications 2010: 1-33

Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira: Cycle Detection and Correction. ICALP (1) 2010: 43-54

Amihood Amir, Estrella Eisenberg, Avivit Levy: Approximate Periodicity. ISAAC (1) 2010: 25-36

Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom: A PTAS for the Square Tiling Problem. SPIRE 2010: 118-126

Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat: Approximate String Matching with Stuck Address Bits. SPIRE 2010: 395-405

Amihood Amir, Laxmi Parida (Eds.): Combinatorial Pattern Matching, 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings. Lecture Notes in Computer Science 6129, Springer 2010, isbn 978-3-642-13508-8

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. Algorithmica 53(3): 314-336 (2009)

Amihood Amir, Gonzalo Navarro: Parameterized matching on non-linear structures. Inf. Process. Lett. 109(15): 864-867 (2009)

Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne: Pattern matching with address errors: Rearrangement distances. J. Comput. Syst. Sci. 75(6): 359-370 (2009)

Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat: On the Cost of Interchange Rearrangement in Strings. SIAM J. Comput. 39(4): 1444-1461 (2009)

Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient computations of l₁ and l _INFINITY rearrangement distances. Theor. Comput. Sci. 410(43): 4382-4390 (2009)

Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate string matching with address bit errors. Theor. Comput. Sci. 410(51): 5334-5346 (2009)

Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko: Quasi-distinct Parsing and Optimal Compression Methods. CPM 2009: 12-25

Amihood Amir, Zvi Gotthilf, B. Riva Shalom: Weighted LCS. IWOCA 2009: 36-47

Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim: Consensus Optimizing Both Distance Sum and Radius. SPIRE 2009: 234-242

Amihood Amir, Haim Parienty: Towards a Theory of Patches. SPIRE 2009: 254-265

Amihood Amir, Avivit Levy, Liron Reuveni: The Practical Efficiency of Convolutions in Pattern Matching Algorithms. Fundam. Inform. 84(1): 1-15 (2008)

Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park: Computing similarity of run-length encoded strings with affine gap penalty. Theor. Comput. Sci. 395(2-3): 268-282 (2008)

Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang: Property matching and weighted matching. Theor. Comput. Sci. 395(2-3): 298-310 (2008)

Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. Theor. Comput. Sci. 409(3): 438-449 (2008)

Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat: Approximate String Matching with Address Bit Errors. CPM 2008: 118-129

Amihood Amir, Igor Nor: Real-time indexing over fixed finite alphabets. SODA 2008: 1086-1095

Amihood Amir: Multidimensional Compressed Pattern Matching. Encyclopedia of Algorithms 2008

Amihood Amir: Two-Dimensional Scaled Pattern Matching. Encyclopedia of Algorithms 2008

Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park: Similarity between Compressed Strings. Encyclopedia of Algorithms 2008

Amihood Amir, Andrew Turpin, Alistair Moffat (Eds.): String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings. Lecture Notes in Computer Science 5280, Springer 2008, isbn 978-3-540-89096-6

Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild: Improved Deterministic Length Reduction. CoRR abs/0802.0017 (2008)

Amihood Amir, Leszek Gasieniec, B. Riva Shalom: Improved approximate common interval. Inf. Process. Lett. 103(4): 142-149 (2007)

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007)

Amihood Amir, Igor Nor: Generalized function matching. J. Discrete Algorithms 5(3): 514-523 (2007)

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol: Dynamic text and static pattern matching. ACM Transactions on Algorithms 3(2) (2007)

Amihood Amir, Oren Kapah, Ely Porat: Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194

Amihood Amir, Johannes Fischer, Moshe Lewenstein: Two-Dimensional Range Minimum Queries. CPM 2007: 286-294

Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat: On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110

Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l₁ and l_infinity Rearrangement Distances. SPIRE 2007: 39-49

Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. SPIRE 2007: 50-61

Amihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit Distance. Algorithmica 45(1): 109-120 (2006)

Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat: Function Matching. SIAM J. Comput. 35(5): 1007-1022 (2006)

Amihood Amir, Oren Kapah, Dekel Tsur: Faster two-dimensional pattern matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006)

Amihood Amir: Asynchronous Pattern Matching. CPM 2006: 1-10

Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang: Property Matching and Weighted Matching. CPM 2006: 188-199

Amihood Amir, Eran Chencinski: Faster Two Dimensional Scaled Matching. CPM 2006: 200-210

Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat: Approximate Matching in Weighted Sequences. CPM 2006: 365-376

Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne: Pattern matching with address errors: rearrangement distances. SODA 2006: 1221-1229

Amihood Amir, Gad M. Landau: Foreword. Discrete Applied Mathematics 146(2): 123 (2005)

Amihood Amir: Theoretical issues of searching aerial photographs: a bird's eye view. Int. J. Found. Comput. Sci. 16(6): 1075-1097 (2005)

Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko: Maximal Association Rules: A Tool for Mining Associations in Text. J. Intell. Inf. Syst. 25(3): 333-345 (2005)

Amihood Amir: Two Glass Balls and a Tower. We Will Show Them! (1) 2005: 57-76

Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski: Approximate Matching in the L₁ Metric. CPM 2005: 91-103

Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein: Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78

Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park: Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. SPIRE 2005: 315-326

Amihood Amir: Asynchronous pattern matching - Metrics. Stringology 2005: 31-36

Amihood Amir, Kenneth Ward Church, Emanuel Dar: The submatrices character count problem: an efficient solution using separable values. Inf. Comput. 190(1): 100-116 (2004)

Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2): 257-275 (2004)

Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps: Two-dimensional pattern matching with rotations. Theor. Comput. Sci. 314(1-2): 173-187 (2004)

Shlomo Argamon, Navot Akiva, Amihood Amir, Oren Kapah: Efficient Unsupervised Recursive Word Segmentation Using Minimum Description Length. COLING 2004

Amihood Amir, Oren Kapah, Dekel Tsur: Faster Two Dimensional Pattern Matching with Rotations. CPM 2004: 409-419

Amihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit Distance. ESA 2004: 16-27

Hagai Aronowitz, David Burshtein, Amihood Amir: Speaker indexing in audio archives using test utterance Gaussian mixture modeling. INTERSPEECH 2004

Hagai Aronowitz, David Burshtein, Amihood Amir: Text independent speaker recognition using speaker dependent word spotting. INTERSPEECH 2004

Amihood Amir, Igor Nor: Generalized Function Matching. ISAAC 2004: 41-52

Hagai Aronowitz, David Burshtein, Amihood Amir: Speaker Indexing in Audio Archives Using Gaussian Mixture Scoring Simulation. MLMI 2004: 243-252

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient One Dimensional Real Scaled Matching. SPIRE 2004: 1-9

Amihood Amir: Theoretical Issues of Searching Aerial Photographs: A Bird's Eye View. Stringology 2004: 1-23

Amihood Amir, Reuven Kashi, Daniel A. Keim, Nathan S. Netanyahu, Markus Wawryniuk: Shape-Embedded-Histograms for Visual Data Mining. VisSym 2004: 55-64, 341

Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. Inf. Comput. 181(1): 57-74 (2003)

Amihood Amir, Richard Beigel, William I. Gasarch: Some connections between bounded query classes and non-uniform complexity. Inf. Comput. 186(1): 104-139 (2003)

Amihood Amir, Gad M. Landau, Dina Sokol: Inplace 2D matching in compressed images. J. Algorithms 49(2): 240-261 (2003)

Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta: Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1(5-6): 409-421 (2003)

Amihood Amir, Gad M. Landau, Dina Sokol: Inplace run-length 2d compressed search. Theor. Comput. Sci. 290(3): 1361-1383 (2003)

Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps: Two-Dimensional Pattern Matching with Rotations. CPM 2003: 17-31

Yair Horesh, Amihood Amir, Shulamit Michaeli, Ron Unger: A rapid method for detection of putative RNAi target genes in genomic data. ECCB 2003: 73-80

Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat: Function Matching: Algorithms, Applications, and a Lower Bound. ICALP 2003: 929-942

Amihood Amir, Reuven Kashi, Nathan S. Netanyahu: Efficient Multidimensional Quantitative Hypotheses Generation. ICDM 2003: 3-10

Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, Daniel A. Keim, Markus Wawryniuk: Analyzing High-Dimensional Data by Subspace Validity. ICDM 2003: 473-476

Amihood Amir, Gad M. Landau, Dina Sokol: Inplace 2D matching in compressed images. SODA 2003: 853-862

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol: Dynamic Text and Static Pattern Matching. WADS 2003: 340-352

Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat: Real Two Dimensional Scaled Matching. WADS 2003: 353-364

Amihood Amir, Gad M. Landau, Esko Ukkonen: Online timestamped text indexing. Inf. Process. Lett. 82(5): 253-259 (2002)

Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate swapped matching. Inf. Process. Lett. 83(1): 33-39 (2002)

Amihood Amir, Kenneth Ward Church, Emanuel Dar: Separable attributes: a technique for solving the sub matrices character count problem. SODA 2002: 400-401

Jacqueline Yadgari, Amihood Amir, Ron Unger: Genetic Threading. Constraints 6(2/3): 271-292 (2001)

Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat: Overlap matching. SODA 2001: 279-288

Amihood Amir, Ely Porat, Moshe Lewenstein: Approximate subset matching with Don't Cares. SODA 2001: 305-306

Amihood Amir, Reuven Kashi, Nathan S. Netanyahu: Analyzing Quantitative Databases: Image is Everything. VLDB 2001: 89-98

Amihood Amir, Gad M. Landau (Eds.): Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings. Lecture Notes in Computer Science 2089, Springer 2001, isbn 3-540-42271-4

Amihood Amir, Moshe Lewenstein, Noa Lewenstein: Pattern Matching in Hypertext. J. Algorithms 35(1): 82-99 (2000)

Amihood Amir, Gruia Calinescu: Alphabet-Independent and Scaled Dictionary Matching. J. Algorithms 36(1): 34-62 (2000)

Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Pattern Matching with Swaps. J. Algorithms 37(2): 247-266 (2000)

Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh: Text Indexing and Dictionary Matching with One Error. J. Algorithms 37(2): 309-325 (2000)

Gilad Koren, Emanuel Dar, Amihood Amir: The Power of Migration in Multiprocessor Scheduling of Real-Time Systems. SIAM J. Comput. 30(2): 511-527 (2000)

Amihood Amir, Moshe Lewenstein, Ely Porat: Approximate Swapped Matching. FSTTCS 2000: 302-311

Amihood Amir, Moshe Lewenstein, Ely Porat: Faster algorithms for string matching with k mismatches. SODA 2000: 794-803

Amihood Amir, Ayelet Butman, Moshe Lewenstein: Real scaled matching. SODA 2000: 815-816

Amihood Amir, Gad M. Landau, Dina Sokol: Inplace run-length 2d compressed search. SODA 2000: 817-818

Amihood Amir, Richard Beigel, William I. Gasarch: Some Connections between Bounded Query Classes and Non-Uniform Complexity. Electronic Colloquium on Computational Complexity (ECCC) 7(24) (2000)

S. Uliel, A. Fliess, Amihood Amir, Ron Unger: A simple algorithm for detecting circular permutations in proteins. Bioinformatics 15(11): 930-936 (1999)

Amihood Amir, Ayelet Butman, Moshe Lewenstein: Real Scaled Matching. Inf. Process. Lett. 70(4): 185-190 (1999)

Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh: Indexing and Dictionary Matching with One Error. WADS 1999: 181-192

Amihood Amir, Gary Benson, Martin Farach: Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. Inf. Comput. 144(1): 1-17 (1998)

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Efficient Special Cases of Pattern Matching with Swaps. Inf. Process. Lett. 68(3): 125-132 (1998)

Amihood Amir, Gary Benson: Two-Dimensional Periodicity in Rectangular Arrays. SIAM J. Comput. 27(1): 90-106 (1998)

Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Efficient Special Cases of Pattern Matching with Swaps. CPM 1998: 209-220

Jacqueline Yadgari, Amihood Amir, Ron Unger: Genetic Algorithms for Protein Threading. ISMB 1998: 193-202

Gilad Koren, Amihood Amir, Emanuel Dar: The Power of Migration in Multi-Processor Scheduling of Real-Time Systems. SODA 1998: 226-235

Amihood Amir, Emanuel Dar: An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples. Inf. Process. Lett. 62(2): 95-101 (1997)

Amihood Amir, Ronen Feldman, Reuven Kashi: A New and Versatile Method for Association Generation. Inf. Syst. 22(6/7): 333-347 (1997)

Amihood Amir, Alberto Apostolico, Moshe Lewenstein: Inverse Pattern Matching. J. Algorithms 24(2): 325-339 (1997)

Amihood Amir, Gary Benson, Martin Farach: Optimal Two-Dimensional Compressed Matching. J. Algorithms 24(2): 354-379 (1997)

Amihood Amir, Dmitry Keselman: Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms. SIAM J. Comput. 26(6): 1656-1669 (1997)

Amihood Amir, Emanuel Dar: An Improved Deterministic Algorithms for Generalized Random Sampling. CIAC 1997: 159-170

Ronen Feldman, Yonatan Aumann, Amihood Amir, Heikki Mannila: Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. DMKD 1997: 0-

Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein: Pattern Matching with Swaps. FOCS 1997: 144-153

Ronen Feldman, Yonatan Aumann, Amihood Amir, Amir Zilberstein, Willi Klösgen: Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. KDD 1997: 167-170

Amihood Amir, Ronen Feldman, Reuven Kashi: A New and Versatile Method for Association Generation. PKDD 1997: 221-231

Amihood Amir, Moshe Lewenstein, Noa Lewenstein: Pattern Matching In Hypertext. WADS 1997: 160-173

Amihood Amir, Gary Benson, Martin Farach: Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. J. Comput. Syst. Sci. 52(2): 299-307 (1996)

Amihood Amir, Gruia Calinescu: Alphabet Independent and Dictionary Scaled Matching. CPM 1996: 320-334

Amihood Amir, Martin Farach: Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures. Inf. Comput. 118(1): 1-11 (1995)

Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer: Improved Dynamic Dictionary Matching. Inf. Comput. 119(2): 258-282 (1995)

Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith: Contributions of theoretical computer science. SIGACT News 26(4): 2-4 (1995)

Amihood Amir, Martin Farach, S. Muthukrishnan: Alphabet Dependence in Parameterized Matching. Inf. Process. Lett. 49(3): 111-115 (1994)

Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park: Dynamic Dictionary Matching. J. Comput. Syst. Sci. 49(2): 208-222 (1994)

Amihood Amir, Gary Benson, Martin Farach: An Alphabet Independent Approach to Two-Dimensional Pattern Matching. SIAM J. Comput. 23(2): 313-323 (1994)

Dmitry Keselman, Amihood Amir: Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms. FOCS 1994: 758-769

Amihood Amir, Gary Benson, Martin Farach: Optimal Two-Dimensional Compressed Matching. ICALP 1994: 215-226

Amihood Amir, Gary Benson, Martin Farach: Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. SODA 1994: 705-714

Amihood Amir, Carl H. Smith: The Syntax of Parallelism. Fundam. Inform. 19(3/4): 383-402 (1993)

Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer: Improved Dynamic Dictionary Matching. SODA 1993: 392-401

Amihood Amir, Gary Benson, Martin Farach: Optimal Parallel Two Dimensional Pattern Matching. SPAA 1993: 79-85

Amihood Amir, Martin Farach: Two-Dimensional Dictionary Matching. Inf. Process. Lett. 44(5): 233-239 (1992)

Amihood Amir, Gad M. Landau, Uzi Vishkin: Efficient Pattern Matching with Scaling. J. Algorithms 13(1): 2-32 (1992)

Amihood Amir, Martin Farach, Yossi Matias: Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). CPM 1992: 262-275

Amihood Amir, Gary Benson: Efficient Two-Dimensional Compressed Matching. Data Compression Conference 1992: 279-288

Amihood Amir, Gary Benson: Two-Dimensional Periodicity and Its Applications. SODA 1992: 440-452

Amihood Amir, Gary Benson, Martin Farach: Alphabet Independent Two Dimensional Matching. STOC 1992: 59-68

Amihood Amir, Martin Farach: Efficient matching of nonrectangular shapes. Ann. Math. Artif. Intell. 4: 211-224 (1991)

Amihood Amir, Doron Mintz: An efficient algorithm for generalized random sampling. Pattern Recognition Letters 12(11): 683-686 (1991)

Amihood Amir, Gad M. Landau: Fast Parallel and Serial Multidimensional Aproximate Array Matching. Theor. Comput. Sci. 81(1): 97-115 (1991)

Amihood Amir, Martin Farach: Adaptive Dictionary Matching. FOCS 1991: 760-766

Amihood Amir, Martin Farach: Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. SODA 1991: 212-223

Amihood Amir, Nick Roussopoulos: Optimal view caching. Inf. Syst. 15(2): 169-171 (1990)

Amihood Amir, Richard Beigel, William I. Gasarch: Some Connections Between Bounded Query Classes and Non-Uniform Complexity. Structure in Complexity Theory Conference 1990: 232-243

Amihood Amir, Gad M. Landau, Uzi Vishkin: Efficient Pattern Matching with Scaling. SODA 1990: 344-357

Amihood Amir, William I. Gasarch: Polynomial Terse Sets. Inf. Comput. 77(1): 37-56 (1988)

Amihood Amir, Dov M. Gabbay: Preservation of Expressive Completeness in Temporal Models. Inf. Comput. 72(1): 66-83 (1987)

Amihood Amir: Expressive Completeness Failure in Branching Time Structures. J. Comput. Syst. Sci. 34(1): 27-42 (1987)

Amihood Amir: Expressive Completeness Failure in Branching Time Structures. J. Comput. Syst. Sci. 34(1): 27-42 (1987)

Amihood Amir, William I. Gasarch: Polynomial terse sets. Structure in Complexity Theory Conference 1987

Amihood Amir: Separation in Nonlinear Time Models. Information and Control 66(3): 177-203 (1985)