Prof. Amihood Amir

Prof.
Prof. Amihood Amir
Telephone: 
Fax: 
Office: 

Publications

  1. Amihood Amir, Oren Kapah, Ely Porat: Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. CPM 2007: 183-194
     
  2. Amihood Amir, Johannes Fischer, Moshe Lewenstein: Two-Dimensional Range Minimum Queries. CPM 2007: 286-294
     
  3. Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat: On the Cost of Interchange Rearrangement in Strings. ESA 2007: 99-110
     
  4. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat: Efficient Computations of l1 and linfinity Rearrangement Distances. SPIRE 2007: 39-49
     
  5. Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur: Generalized LCS. SPIRE 2007: 50-61
     
  6. Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol: Dynamic text and static pattern matching. ACM Transactions on Algorithms 3(2), 2007
     
  7. Amihood Amir, Leszek Gasieniec, B. Riva Shalom: Improved approximate common interval. Inf. Process. Lett. 103(4): 142-149 (2007)
     
  8. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur: Efficient one-dimensional real scaled matching. J. Discrete Algorithms 5(2): 205-211 (2007)
     
  9. Amihood Amir: Asynchronous Pattern Matching. CPM 2006: 1-10
     
  10. Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang: Property Matching and Weighted Matching. CPM 2006: 188-199
     
  11. Amihood Amir, Eran Chencinski: Faster Two Dimensional Scaled Matching. CPM 2006: 200-210
     
  12. Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat: Approximate
    Matching in Weighted Sequences. CPM 2006: 365-376
     
  13. 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                                                           
  14. Amihood Amir, Estrella Eisenberg, Ely Porat: Swap and Mismatch Edit
    Distance. Algorithmica 45(1): 109-120 (2006)
     
  15. Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat: Function
    Matching. SIAM J. Comput. 35(5): 1007-1022 (2006)
     
  16. Amihood Amir, Oren Kapah, Dekel Tsur: Faster two-dimensional pattern
    matching with rotations. Theor. Comput. Sci. 368(3): 196-204 (2006)
     
  17. Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski: Approximate
    Matching in the L1 Metric. CPM 2005: 91-103
     
  18. Jin Kim, Amihood Amir, Gad M. Landau, Kunsoo Park: Computing
    Similarity of Run-Length Encoded Strings with Affine Gap
    Penalty. SPIRE 2005: 315-326
     
  19. Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
    Towards Real-Time Suffix Tree Construction. SPIRE 2005: 67-78
     
  20. Amihood Amir: Asynchronous pattern matching - Metrics. Stringology
    2005: 31-36
     
  21.  Amihood Amir: Two Glass Balls and a Tower. We Will Show Them! (1)
    2005: 57-76
     
  22. Amihood Amir, Gad M. Landau: Foreword. Discrete Applied Mathematics
    146(2): 123 (2005)
     
  23. Amihood Amir: Theoretical issues of searching aerial photographs: a
    bird's eye view. Int. J. Found. Comput. Sci. 16(6): 1075-1097 (2005)
     
  24. 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)

     
  25. Hagai Aronowitz, David Burshtein, Amihood Amir: Speaker Indexing in
    Audio Archives Using Gaussian Mixture Scoring Simulation. MLMI 2004:
    243-252
     
  26. Amihood Amir: Theoretical Issues of Searching Aerial Photographs: A
    Bird's Eye View. Stringology 2004: 1-23
     
  27. Amir, Amihood, Eisenberg, Estrella, Porat, Ely. "Swap And Mismatch Edit Distance" European Symposium On Algorithms, 2004.
     
  28. Amir, Amihood, Kapah, Oren, Tzur, Dekel. "Faster Two Dimensional Pattern Matching With Rotations" Proc. Combinatorial PatternMatching, 2004.
     
  29. Argamon, Shlomo, Akiva, Navot, Amir, Amihood, Kapah, Oren. "Efficient Unsupervised Recursive Word Segmentation Using MDL" COLING, 2004.
     
  30. Amir, Amihood, Church, Kenneth W., Dar, Emanuel. "The Submatrices Character Count Problem: an Efficient Solution Using Separable Value" Information And Computation, vol. 190, 2004, p. 100-116.
     
  31. Amir, Amihood, Kashi, Reuven , Keim, Daniel A., Netanyahu, Natan, Wawryniuk, Markus. "Shape-Embedded-Histograms For Visual Data Mining" VisSym, 2004, p. 55-64.
     
  32. Amir, Amihood, Butman, A., Crochemore, M., Landau, G.M., Schaps, Malka. "Two-Dimensional Pattern Matching With Rotations" Theor. Comput. Sci., vol. 314, 2004, p. 173-187.
     
  33. Amir, Amihood, Lewenstein, M., Porat, Ely. "Faster Algorithms For String Matching With K Mismatches" J. Algorithm, vol. 50, 2004, p. 257-275.
     
  34. Amir, Amihood, Butman, Ayelet, Crochemore, Maxime , Landau, Gad M., Schaps, Malka. "Two-Dimensional Pattern Matching With Rotations" Combinatorial Pattern Matching, 2003, p. 17-31.
     
  35. Amir, Amihood, Kashi, Reuven, Netanyahu, Natan. "Efficient Multidimensional Quantitative Hypotheses Generation" ICDM, 2003, p. 3-10.
     
  36. Amir, Amihood, Landau, Gad M., Sokol, Dina. "Inplace 2D Matching in Compressed Images" SODA, 2003, p. 853-862.
     
  37. Amir, A.; Landau, G.M. and Sokol, D. "Inplace Run-Length 2d Compressed Search" Theoretical Computer Science, vol. 290, 2003, p. 1361-1383.
     
  38. Amir, Amihood, Apostolico, Alberto, Landau, Gad M., Satta, Giorgio. "Efficient Text Fingerprinting Via Parikh Mapping" Journal of Discrete Algorithms, vol. 1, 2003, p. 409-429.
     
  39. Amir, Amihood, Kashi, Reuven , Netanyahu, Natan, Keim, Daniel A., Wawryniuk, Markus. "Analyzing High-Dimensional Data By Subspace Validity" ICDM, 2003, p. 473-476.
     
  40. Amir, Amihood, Landau, G.M., Lewenstein, Moshe, Sokol, D.. "Dynamic Text And Static Pattern Matching" Lecture Notes On Computer Science, vol. 2748, 2003, p. 340-352.
     
  41. Amir, A.; Cole, R.; Hariharan, R.; Lewenstein, M. and Porat, E. "Overlap Matching" Information And Computation, vol. 181, 2003, p. 57-74.
     
  42. Amir, Amihood, Aumann, Yonatan, Cole, R., Lewenstein, Moshe, Porat, Ely. "Function Matching: Algorithms, Applications And a Lower Bound" ICALP, vol. 2719, 2003, p. 929-942.
     
  43. Amir, Amihood, Beigel, Richard, Gasarch, William I.. "Some Connections Between Bounded Query Classes And Non-Uniform Complexity" Information And Computation, vol. 186, 2003, p. 104-139.
     
  44. Porat, E. "Real Two Dimensional Scaled Matching" Lecture Notes On Computer Science, vol. 2748, 2003, p. 353-364.
     
  45. Amir, Amihood, Landau, Gad M., Sokol, Dina. "Inplace 2D Matching in Compressed Images" J. Algorithm, vol. 49, 2003, p. 240-261.
     
  46. Amir, A.; Lewenstein, M. and Porat, E. "Approximate Swapped Matching" Information Processing Letters, vol. 83, 2002, p. 33-39.
     
  47. Amir, Amihood, Landau, Gad M., Ukkonen, Esko. "Online Timestamped Text Indexing" Information Processing Letters, vol. 82, 2002, p. 253-259.
     
  48. Amir, Amihood, Church, Kenneth Ward, Dar, Emanuel. "Separable Attributes: a Technique For Solving the Sub Matrices Character Count Problem" SODA, 2002, p. 400-401.
     
  49. Amir, A.; Lewenstein, M. and Porat, E. "Approximate Subset Matching With Don't Care" Symposium On Discrete Algorithms (SODA), 2001, p. 305-306.
     
  50. Yadgari, Jaqueline, Amir, Amihood, Unger, Ron. "Genetic Threading" Constraints, vol. 6, 2001, p. 271-292.
     
  51. Amir, Amihood, Kashi, Reuven, Netanyahu, Natan. "Analyzing Quantitative Databases: Image Is Everything" VLDB, 2001, p. 89-98.
     
  52. Amir, Amihood, Cole, Richard, Hariharan, Ramesh, Lewenstein, Moshe, Porat, Ely. "Overlap Matching" Symposium On Discrete Algorithms (SODA), 2001, p. 279-288.
     
  53. Amir, Amihood, Landau, Gad M.. "12th Annual Symposium, CPM 2001" (ed.) Combinatorial Pattern Matching, 2001.
     
  54. Amir, A.; Lewenstein, N. and Lewenstein, N. "Pattern Matching in Hypertext" J. Algorithm, vol. 35, 2000, p. 82-99.
     
  55. Amir, A. and Calinescu, G. "Alphabet-Independent and Scaled Dictionary Pattern Matching" J. Algorithm., vol. 36, 2000, p. 34-62.
     
  56. Koren, G.; Dar, E. and Amir, A. "The Power of Migration in Multiprocessor Scheduling of Real-Time Systems" SIAM J. Comput., vol. 30, 2000, p. 511-527.
     
  57. Amir, Amihood, Keselman, D., Landau, G.M., Lewenstein, Moshe, Lewenstein, N., Rodeh, M.. "Text Indexing and Dictionary Matching with One Error" Journal of Algorithms, vol. 37, 2000, p. 309-325.
     
  58. Amir, A.; Gasarch, W.I. And Beigel, R. "Some Connections Between Bounded Query Classes and Non-Uniform Complexity" SIAM Journal of Computing, 2000.
     
  59. Amir, A. "Optimal Parallel Two Dimensional Text Searching on CREW" Information and Computation, vol. 144, 2000, p. 1-17.
     
  60. Amir, A. "Online Stamped Text Indexing" Information in Processing Letters, 2000.
     
  61. Amir, Amihood, Aumann, Yonatan, Landau, G.M., Lewenstein, Moshe, Lewenstein, N.. "Pattern Matching with Swaps" Journal of Algorithms, vol. 37, 2000, p. 247-266.
     
  62. Lewenstein, M.; Amir, A. and Porat, E. "Faster String Matching with K Mismatches" SODA, 2000, p. 794-803.
     
  63. Amir, Amihood, Butman, Ayelet, Lewenstein, Moshe. "Real Scaled Matching" SODA, 2000, p. 815-816.
     
  64. Porat, E.; Amir, A. and Lewenstein, M. "Approximate Swapped Matching" FSTTCS, 2000, p. 302-311.
     
  65. Porat, E.; Amir, A. and Lewenstein, M. "Faster Algorithms for String Matching with K Mismatches" Journal of Algorithms, 2000, p. 794-803.
     
  66. Amir, Amihood, Landau, Gad M., Sokol, Dina. "Inplace Run-Length 2d Compressed Search" SODA, 2000, p. 817-818.
     
  67. Uliel, S.; Fleiss, A.; Amir, A. and Unger, R. "A Simple Algorithm for Detecting Circular Permutation in Proteins" Bioinformatics, vol. 15, 1999, p. 930-936.
     
  68. Yadgari, J.; Amir, A. and Unger, R. "Genetic Threading" J. Of Constraints, vol. 6, 1999, p. 271-291.
     
  69. Amir, A.; Butman, A. and Lewenstein, N. "Real Scaled Matching" Information Processing Letters, vol. 70, 1999, p. 185-190.
     
  70. Amir, Amihood, Keselman, D., Landau, G., Lewenstein, Moshe, Lewenstein, N., Rodeh, M.. "Indexing and Dictionary Matching with One Error" Algorithms And Data Structures (WADS), vol. 1663, 1999, p. 181-192.
     
  71. Amir, A.; Farach, M. and Benson, G. "Optimal Parallel Two Dimensional Text Searching on a CREW PRAM" Information and Computation, vol. 144, 1998, p. 1-17.
     
  72. Amir, A.; Landau, G.; Lewenstein, M. and Lewenstein, N. "Efficient Special Cases of Pattern Matching with Swaps" Information Processing Letters, vol. 68, 1998, p. 125-132.
     
  73. Amir, A. and Benson, G. "Two Dimensional Periodicity" SIAM Journal of Computing, vol. 27, 1998, p. 90-106.
     
  74. Yadgari, Jaqueline, Amir, Amihood, Unger, Ron. "Genetic Algorithms For Protein Threading" ISMB, 1998, p. 193-202.
     
  75. Amir, A.; Landau, G. and Lewenstein, M. "Efficient Special Cases of Pattern Matching With Swaps" CPM, 1998, p. 209-220.
     
  76. Koren, Gilad, Amir, Amihood, Dar, Emanuel. "The Power of Migration in Multi-Processor Scheduling of Real-Time Systems" SODA, 1998, p. 226-235.
     
  77. Amir, A.; Apostolico, A. and Lewenstein, M. "Inverse Pattern Matching" J. Algorithms, vol. 24, 1997, p. 325-339.
     
  78. Amir, A. and Dar, E. "An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples" Information. Proc. Lett., vol. 62, 1997, p. 95-101.
     
  79. Amir, A. and Keselman, D. "Maximum Agreement Subtree of a Set of Evolutionary Trees - Metrics and Efficient Algorithms" SIAM J. Comput., vol. 26, 1997, p. 1656-1669.
     
  80. Amir, A.; Benson, G. and Farach, M. "Optimal Two-Dimensional Compressed Matching" J. Of Algorithms, vol. 24, 1997, p. 354-379.
     
  81. Amir, A.; Feldman, R. and Kashi, R. "A New and Versatile Method for Association Generation" Information Systems, vol. 22, 1997, p. 333-347.
     
  82. Amir, A.; Feldman, R. and Kashi, R. "New and Versatile Method for Association" Principles of Data Mining and Knowledge Discovery, vol. 1263, 1997, p. 221-231.
     
  83. Amir, Amihood, Lewenstein, N., Lewenstein, Moshe. "Pattern Matching in Hypertext" Algorithms And Data Structures (WADS), 1997, p. 160-173.
     
  84. Amir, Amihood, Aumann, Yonatan, Landau, G., Lewenstein, N., Lewenstein, Moshe. "Pattern Matching With Swaps" Foundations of Computer Science (FOCS), 1997, p. 148-153.
     
  85. Lewenstein, M. "Inverse Pattern Matching" Journal of Algorithms, vol. 24, 1997, p. 325-339.
     
  86. Feldman, R.; Aumann, Y.; Amir, A. and Mannila, H. "Efficient Algorithms for Discovering Frequent Sets in Incremenal Databases" DMKD, 1997.
     
  87. Amir, A. and Kashi, R. "A New Versatile Method for Association Generation" PKDD, 1997, p. 221-231.
     
  88. Feldman, R.; Aumann, Y.; Amir, A.; Zilberstein, A. and Klosgen, W. "Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections" KDD, 1997, p. 167-170.
     
  89. Amir, Amihood, Feldman, Ronen, Kashi, Reuven. "A New Versatile Method For Association Generation" PKDD, 1997, p. 221-231.
     
  90. Amir, Amihood, Dar, Emmanuel. "An Improved Deterministic Algorithms For Generalized Random Sampling" CIAC, 1997, p. 159-170.
     
  91. Amir, A. and Farach, M. "Two Dimensional Matching" In: Apostolico, A.X. and Galil, Z. (eds.) Pattern Matching Algorithms, p. 267-292.Oxford, Oxford University Press, 1997.
     
  92. Amir, A. "Efficient Randomized Dictionary Matching Algorithms" J. Algorithms, 1996.
     
  93. Amir, A.; Feldman, R.; Aumann, Y.; Zilberstein, A. and Hirsh, H. "Incremental Algorithms for Association Generation" Proc., 1st Pacific Conference on Knowledge Discovery, 1996.
     
  94. Amir, A. "Alphabet Independent and Dictionary Scaled Pattern Matching" Proc. 7th Annual Symposium on Combinatorial Pattern Matching, 1996, p. 320-334.
     
  95. Amir, A.; Farach, M. and Benson, G. "Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files" J. Computer and System Sciences, vol. 52, 1996, p. 299-307.
     
  96. Amir, A. and Farach, M. "Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures" Information and Computation, vol. 118, 1995, p. 1-11.
     
  97. Amir, A. "Improved Dynamic Dictionary Matching" Information and Computation, vol. 119, 1995, p. 258-282.
     
  98. Amir, A. "Pattern Matching on Z-Compressed Files" J. Computer and System Sciences, vol. 52, 1995, p. 299-307.
     
  99. Amir, A.; Benson, G. and Farach, M. "An Alphabet Independent Approach to Two Dimensional Pattern Matching" SIAM Journal of Computing, vol. 23, 1994, p. 313-323.
     
  100. Amir, A.; Farach, M.; Galil, Z.; Giancarlo, R. and Park, K. "Dynamic Dictionary Matching" J. Computer and System Sciences, vol. 49, 1994, p. 208-222.
     
  101. Amir, A.; Farach, M. and Muthukrishnan, S. "Alphabet Dependence in Parameterized Matching" Information Processing Letters, vol. 49, 1994, p. 111-115.
     
  102. Amir, A. "Optimal Two-Dimensional Compressed Matching" Proc., 21st International Colloqium on Automata, Languages and Programming (ICALP), 1994, p. 215-226.
     
  103. Amir, A. "Some Connections Between Bounded Query Classes and Non-Uniform Complexity" SIAM Journal of Computing, 1994.
     
  104. Amir, A.; Farach, M. and Benson, G. "Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files" J. Computer and System Sciences, vol. 52, 1994, p. 299-307.
     
  105. Amir, A. and Keselman, D. "Maximum Agreement Subtree of a Set of Evolutionary Trees - Metrics and Efficient Algorithms" Proc., 36th Annual IEEE Conference on Foundations of Computer Science (FOCS), 1994, p. 758-769.
     
  106. Amir, A.; Farach, M. and Benson, G. "Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files" Proc., 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994, p. 705-714.
     
  107. Amir, A. "A Pearl Diver Deals a Poker Hand" International J. Computer Mathematics, vol. 47, 1993, p. 11-14.
     
  108. Amir, A. and Smith, C.H. "The Syntax of Parallelism" Fundamenta Informatica, vol. 19, 1993, p. 383-402.
     
  109. Amir, A.; Farach, M. and Benson, G. "Optimal Parallel Two Dimensional Pattern Matching" Proc., 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1993, p. 79-85.
     
  110. Amir, A.; Farach, M.; Idury, R.M.; La Poutre, J.A. and Schaffer, A.A. "Improved Dynamic Dictionary Matching" Proc., 4th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1993, p. 392-401.
     
  111. Amir, A.; Landau, G. and Vishkin, U. "Efficient Pattern Matching with Scaling" J. Algorithms, vol. 13, 1992, p. 2-32.
     
  112. Amir, A. and Farach, M. "Two Dimensional Dictionary Matching" Information Processing Letters, vol. 44, 1992, p. 233-239.
     
  113. Amir, A. "Two Dimensional Compressed Matching" Proc., Date Compression Conference (DCC), 1992, p. 279-288.
     
  114. Amir, A.; Farach, M. and Matias, Y. "Efficient Randomized Dictionary Matching Algorithms" Proc., 4th Annual Combinatorial Pattern Matching Conference (CPM), 1992, p. 259-272.
     
  115. Amir, A.; Bension, G. and Farach, M. "Alphabet-Independent Two Dimensional Matching" Proc., 24th Annual ACM Symposium on the Theory of Computation (STOC), 1992, p. 59-68.
     
  116. Amir, A. and Benson, G. "Two Dimensional Periodicity And Its Application" SODA, 1992, p. 440-452.
     
  117. Amir, A. and Landau, G. "Fast Parallel and Serial Approximate Array Matching" Theoretical Computer Science, vol. 81, 1991, p. 97-115.
     
  118. Amir, A. and Farach, M. "Efficient Matching of Nonrectangular Shapes" Ann. Mathematics and Artif. Intell., 1991, p. 211-224.
     
  119. Amir, A. and Mintz, D. "Generalized Random Sampling" Pattern Recognition Letters, vol. 12, 1991, p. 683-686.
     
  120. Amir, A. and Farach, M. "Efficient 2-Dimensional Approximate Matching of Non-Rectangular Figures" Proc., 2nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1991, p. 212-223.
     
  121. Amir, A. and Farach, M. "Adaptive Dictionary Matching" Proc., 32nd Annual IEEE Conference on Foundations of Computer Science (FOCS), 1991.
     
  122. Amir, A. and Mintz, D. "An Efficient Algorithm for Point Selection for Image Surface Recovery Computation" In: Feldman, Y. A. and Bruckstein, A. (eds.) Artificial Intelligence and Computer Vision, p. 169-173.Amsterdam, Elsevier, 1991.
     
  123. Amir, A. and Roussopoulos, N. "Optimal View Caching" Information Systems, vol. 15, 1990, p. 169-171.
     
  124. Amir, A.; Landau, G.M. and Vishkin, U. "Efficient Pattern Matching with Scaling" Proc., 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1990, p. 344-357.
     
  125. Amir, A.; Gasarch, W.I. and Beigel, R. "Some Connections Between Bounded Query Classes and Non-Uniform Complexity" Proc., 5th Annual Structures in Complexity Theory Conference, 1990, p. 232-243.
     
  126. Amir, A. and Smith, C. "The Syntax of Parallelism" Proc., 5th International Workshop on Parallel Processing by Cellular Automata and Arrays, 1990, p. 173-182.
     
  127. Amir, A. and Mintz, D. "An Efficient Alogrithm for Point Selection for Image Surface Recovery Computation" Proc., 7th Israeli Symposium on Artificial Intelligence, Vision and Pattern Recognition, 1990, p. 173-176.
     
  128. Amir, A. and Landau, G.M. "Fast Parallel and Serial Multidimensional Approximate Array Matching" In: Capocelli, R. (eds.) Sequences, p. 3-24., Springer-Verlag, 1990.
     
  129. Amir, A. and Farach, M. "The Whole is Faster Than Its Parts" 1st Bar-Ilan Conference on the Foundation of Artificial Intelligence, 1989.
     
  130. Amir, A. "Scaled Pattern Matching" Proc., 5th Israeli Symposium on Artificial Intelligence, Vision, and Pattern Recognition, 1988, p. 425-440.
     
  131. Amir, A. and Gasarch, W.I. "Polynomial Terse Sets" Information and Computation, vol. 77, 1988, p. 37-56.
     
  132. Amir, A. and Kaplan, E.H. "Relocation Problems Are Hard" International J. Computer Mathematics, vol. 25, 1988, p. 101-109.
     
  133. Amir, A. "A Direct Linear Time Planitary Test for Unflippable Modules" Internaitonal J. Computer Mathematics, vol. 21, 1987, p. 277-290.
     
  134. Amir, A. "Expressive Completeness Failure in Branching Time Structures" J. Computer and System Sciences, vol. 34, 1987, p. 27-42.
     
  135. Amir, A. and Gabbay, D.M. "Preservation of Expressive Completeness in Temporal Models" Information and Computation, vol. 72, 1987, p. 66-83.
     
  136. Amir, A. "The Martian Chronicles or to Build a Tense System" Journal for the Integrated Study of AI, Cognitive Science and Applied Epistemology, vol. 3, 1986, p. 59-83.
     
  137. Choueka, Y. and Amir, A. "A Syntactical Definition of the P = NP Problem" Int. J. Comput. Math., vol. 17, 1985, p. 217-228.
     
  138. Amir, A. "Seperation in Nonlinear Time Models" Information and Control, vol. 66, 1985, p. 177-203.
     
  139. Amir, A. and Choueka, Y. "Polynomial Computations in Non-Deterministic Loop-Programs and PL-Programs" International J. Computer Mathematics, vol. 14, 1983, p. 209-221.
     
  140. Choueka, Y. and Amir, A. "Loop-Programs and Polynominally Computable Functions" Int. J. Comput. Math., vol. 9, 1981, p. 195-205.

Research

Multidimensional pattern matching as applied to text processing, computer vision and multimedia, computational biology