Journal Papers of Amihood Amir

Published Journal Papers of Amihood Amir


  1. A. Amir and Y. Choueka.
    Loop Programs and Polynomially Computable Functions.
    International Journal of Computer Mathematics, 1981, Vol. 9, pp. 195-205.

  2. A. Amir and Y. Choueka.
    Polynomial Computations in Nondeterministic Loop Programs and PL-Programs.
    International Journal of Computer Mathematics, 1983, Vol. 14, pp. 209-221.

  3. A. Amir.
    Separation in Nonlinear Time Models.
    Information and Control, 1985, Vol. 66, pp. 177-203.

  4. A. Amir and Y. Choueka.
    A Syntactical Definition of the P=?NP Problem.
    International Journal of Computer Mathematics, 1985, Vol. 17, pp. 217-228.

  5. A. Amir.
    The Martian Chronicles or To Build a Tense System.
    Journal for the Integrated Study of AI, Cognitive Science and Applied Epistemology, 1986, Vol. 3, No. 1, pp. 59-83.

  6. A. Amir.
    A Direct Linear Time Planarity Test for Unflippable Modules.
    International Journal of Computer Mathematics, 1987, Vol. 21, No. 3+4, pp. 277-290.

  7. A. Amir.
    Expressive Completeness Failure in Branching Time Structures.
    Journal of Computer and System Sciences, 1987, Vol. 34, No. 1, pp. 27-42.

  8. A. Amir and D. M. Gabbay.
    Preservation of Expressive Completeness in Temporal Models.
    Information and Computation, 1987, Vol. 72, No. 1, pp. 66-83.

  9. E. H. Kaplan and A. Amir.
    A Fast Feasibility Test for Relocation Problems.
    European Journal of Operational Research, 1988, Vol. 35, No. 2, pp. 201-206.

  10. A. Amir and W. I. Gasarch.
    Polynomial Terse Sets.
    Information and Computation, 1988, Vol. 77, No. 1, pp. 37-56.

  11. A. Amir and E. H. Kaplan.
    Relocation Problems are Hard.
    International Journal of Computer Mathematics, 1988, Vol. 25, No. 2, pp. 101-109.

  12. A. Amir and N. Roussopoulos.
    Optimal View Caching.
    Information Systems, 1990, Vol. 15, No. 2, pp. 169-171.

  13. A. Amir and G. Landau.
    Fast Parallel and Serial Approximate Array Matching.
    Theoretical Computer Science, 1991, Vol. 81, No. 1, pp. 97-115.

  14. A. Amir and M. Farach.
    Efficient Matching of Nonrectangular Shapes.
    Annals of Mathematics and Artificial Intelligence, special issue on the Foundations of Artificial Intelligence, 1991, No. 4, pp. 211-224.

  15. A. Amir and D. Mintz.
    Generalized Random Sampling.
    Pattern Recognition Letters, 1991, Vol. 12, No. 11, pp. 683-686.

  16. A. Amir, G. Landau and U. Vishkin.
    Efficient Pattern Matching with Scaling.
    Journal of Algorithms, invited submission to special edition on SODA90, 1992, Vol. 13, No. 1, pp. 2-32.

  17. A. Amir and M. Farach.
    Two Dimensional Dictionary Matching.
    Information Processing Letters, 1992, Vol. 44, pp. 233-239.

  18. A. Amir.
    A Pearl Diver Deals a Poker Hand.
    International Journal of Computer Mathematics, 1993, Vol. 47, No. 1+2, pp. 11-14.

  19. A. Amir, G. Benson, and M. Farach.
    An Alphabet Independent Approach to Two Dimensional Pattern Matching.
    SIAM Journal of Computing, 1994, Vol. 23, No. 2, pp. 313-323, (preliminary version appeared in STOC 92).

  20. A. Amir and C. H. Smith.
    The Syntax of Parallelism.
    Fundamaenta Informatica, 1993, Vol. 19, No. 3+4, pp. 383-402. (preliminary version appeared in PARCELLA 90).

  21. A. Amir, M. Farach, Z. Galil, R. Giancarlo, and K. Park.
    Dynamic Dictionary Matching.
    Journal of Computer and System Sciences, 1994, Vol. 49, No. 2, pp. 208-222, (preliminary version (Amir-Farach) appeared in FOCS 91).

  22. A. Amir and M. Farach.
    Efficient 2-dimensional Approximate Matching of Half-rectangular Figures.
    Information and Computation, 1995, Vol. 118, No. 1, pp. 1-11, (preliminary version appeared in SODA 91).

  23. A. Amir, M. Farach and S. Muthukrishnan.
    Alphabet Dependence in Parameterized Matching.
    Information Processing Letters, 1994, Vol. 49, pp. 111-115.

  24. A. Amir, M. Farach, R. M. Idury, J. A. La Poutré, and A. A. Schäffer.
    Improved Dynamic Dictionary Matching.
    Information and Computation, 1995, Vol. 119, No. 2, pp. 258-282, (preliminary version appeared in SODA 93).

  25. A. Amir, M. Farach and G. Benson.
    Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files.
    Journal of Computer and System Sciences, 1996, Vol. 52, No. 2, pp. 299-307, (preliminary version appeared in SODA 94).

  26. A. Amir and G. Benson.
    Two Dimensional Periodicity.
    SIAM Journal of Computing, 1998, Vol. 27, No. 1, pp. 90-106. (preliminary version appeared in SODA 92).

  27. A. Amir and D. Keselman.
    Maximum Agreement Subtree of a set of Evolutionary Trees - Metrics and Efficient Algorithms.
    SIAM J. Computing, 1997, Vol. 26, No. 6, pp. 1656-1669. (preliminary version appeared in FOCS 94).

  28. A. Amir, A. Apostolico and M. Lewenstein.
    Inverse Pattern Matching.
    J. of Algorithms, 1997, Vol. 24, No. 2, pp. 325-339.

  29. A. Amir and E. Dar.
    An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples.
    Information Proc. Letters, 1997, Vol. 62, No. 2, pp. 95-101 (preliminary version appeared CIAC 97).

  30. A. Amir, M. Farach and G. Benson.
    Optimal Parallel Two dimensional Text Searching on a CREW.
    Information and Computation, 1998, Vol. 144, No. 1, pp. 1-17. (preliminary version appeared in SPAA 93).

  31. A. Amir, M. Farach and G. Benson.
    Optimal Two-dimensional Compressed Matching.
    Journal of Algorithms, 1997, Vol. 24, No. 2, pp. 354-379. (preliminary version appeared in ICALP 94).

  32. A. Amir, R. Feldman and R. Kashi.
    A New and Versatile Method for Association Generation.
    Information Systems, 1997, Vo. 22, No. 6, pp. 333-347. (preliminary version appeared in PKDD 97).

  33. A. Amir, G. M. Landau, N. Lewenstein and M. Lewenstein.
    Efficient Special Cases of Pattern Matching with Swaps.
    Information Processing Letters, 1998, Vol. 68, No. 3, pp. 125-132. (preliminary version appeared in CPM 98).

  34. A. Amir, A. Butman, and M. Lewenstein.
    Real Scaled Matching.
    Information Processing Letters, 1999, Vol. 70, No. 4, pp. 185-190.

  35. S. Uliel, A. Fliess, A. Amir and R. Unger.
    A Simple Algorithm for Detecting Circular Permutations in Proteins.
    Bioinformatics, 1999, Vol. 15, No. 11, pp. 930-936.

  36. A. Amir, M. Lewenstein and N. Lewenstein.
    Pattern Matching in Hypertext.
    Journal of Algorithms, 2000, Vol. 35, pp. 82-99. (preliminary version appeared in WADS 97).

  37. A. Amir, G. Calinescu.
    Alphabet Independent and Scaled Dictionary Matching.
    Journal of Algorithms, 2000, Vol. 36, pp. 34-62. (preliminary version appeared in CPM 96).

  38. G. Koren, E. Dar and A. Amir.
    The Power of Migration in Multiprocessor Scheduling of Real-Time Systems.
    SIAM Journal of Computing, 2000, Vol. 30, No. 2, pp. 511-520. (preliminary version appeared in SODA 98).

  39. A. Amir, G. Landau, D. Keselman, M. Lewenstein, N. Lewenstein and M. Rodeh.
    Text Indexing and Dictionary Matching with One Error.
    Journal of Algorithms, 2000, Vol. 37, pp. 309-325. (preliminary version appeared in WADS 99).

  40. A. Amir, A. Aumann, G. Landau, M. Lewenstein and N. Lewenstein.
    Pattern Matching with Swaps.
    Journal of Algorithms, 2000, Vol. 37, pp. 247-266. (preliminary version appeared in FOCS 97).

  41. J. Yadgary, A. Amir and R. Unger.
    Genetic Threading.
    Constraints: An International Journal, 2001, Vol. 6, No. 2/3, pp. 271-292. (preliminary version appeared in CP 97).

  42. A. Amir, G. M. Landau and E. Ukkonen.
    Online Time Stamped Text Indexing.
    Information Processing Letters, to appear. (preliminary version appeared in CP 97).

  43. A. Amir, G. M. Landau and D. Sokol.
    Inplace Run-Length 2d Compressed Search.
    Theoretical Computer Science, to appear. (preliminary version appeared in CP 97).

  44. A. Amir, M. Lewenstein and E. Porat.
    Faster Algorithms for String Matching with k Mismatches.
    Journal of Algorithms, Special Issue for SODA 2000, to appear.

  45. A. Amir, M. Lewenstein and E. Porat.
    Approximate Swapped Matching.
    Information Processing Letters, to appear. (preliminary version appeared in FSTTCS 2000).



Back to Amihood Amir's homepage.