Conference Proceedings of Amihood Amir

1. A. Amir and W. I .Gasarch.
   Polynomial Terse Sets.
   Proceedings 2nd Annual Structure in Complexity Theory Conference (STRUCTURES), Cornell, 1987, pp. 22-27.
   
   
2. A. Amir and G. Landau.
   Fast Parallel and Serial Approximate Array Matching.
   Sequences: Combinatorics, Compression, Security and Transmission, Positano, Italy, June 1988, pp. 3-94.
   
   
3. A. Amir.
   Scaled Pattern Matching.
   Proceedings, 5th Israeli Symposium on Artificial Intelligence, Vision, and Pattern Recognition, Tel-Aviv, Israel, 1988, pp. 425-440.
   
   
4. A. Amir, G. M. Landau and U. Vishkin.
   Efficient Pattern Matching with Scaling.
   Proceedings, 1st Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), San Francisco, CA, 1990, pp. 344-357.
   
   
5. A. Amir, W. I. Gasarch and R. Beigel.
   Some Connections between Bounded Query Classes and Non-Uniform Complexity.
   Proceedings, 5th Annual Structures in Complexity Theory Conference (STRUCTURES), Barcelona, Spain, 1990, pp. 232-243.
   
   
6. A. Amir and C. Smith.
   The Syntax of Parallelism.
   Proceedings, 5th International Workshop on Parallel Processing by Cellular Automata and Arrays, Berlin, DDR, 1990, pp. 173-182.
   
   
7. A. Amir and D. Mintz.
   An Efficient Algorithm for Point Selection for Image Surface Recovery Computation.
   Proceedings, 7th Israeli Symposium on Artificial Intelligence, Vision, and Pattern Recognition, Tel-Aviv, Israel, 1990, pp. 173-176.
   
   
8. A. Amir and M. Farach.
   Efficient 2-dimensional Approximate Matching of Non-rectangular Figures.
   Proceedings, 2nd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), San Francisco, CA, 1991, pp. 212-223.
   
   
9. A. Amir and M. Farach.
   Adaptive Dictionary Matching.
   Proceedings, 32nd Annual IEEE Conference on Foundations of Computer Science (FOCS), San Juan, Puerto Rico, 1991.
   
   
10. A. Amir and G. Benson.
    Two Dimensional Periodicity and its Application.
    Proceedings, 3rd Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), Orlando, Florida, 1992, pp. 440-452.
    
    
11. A. Amir and G. Benson.
    Two Dimensional Compressed Matching.
    Proceedings, Data Compression Conference (DCC), Snowbird, Utah, 1992, pp. 279-288.
    
    
12. A. Amir, G. Benson and M. Farach.
    Alphabet-Independent Two Dimensional Matching.
    Proceedings, 24th Annual ACM Symposium on the Theory of Computation (STOC), Victoria, Alberta, 1992, pp. 59-68.
    
    
13. A. Amir, M. Farach and Y. Matias.
    Efficient Randomized Dictionary Matching Algorithms.
    Proceedings, 4th Annual Combinatorial Pattern Matching Conference (CPM), Tucson, Arizona, 1992, 259-272.
    
    
14. A. Amir, M. Farach, R. M. Idury, J. A. La Poutr\'{e}, and A. A. Schäffer.
    Improved Dynamic Dictionary Matching.
    Proceedings, 4th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), Austin, Texas, 1993, pp. 392-401.
    
    
15. A. Amir, M. Farach and G. Benson.
    Optimal Parallel Two dimensional Pattern Matching.
    Proceedings, 5th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Velen, Germany, 1993, pp. 79-85.
    
    
16. A. Amir, M. Farach and G. Benson.
    Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files.
    Proceedings, 5th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), Arlington, Virginia, 1994, pp. 705-714.
    
    
17. A. Amir, M. Farach and G. Benson.
    Optimal Two-Dimensional Compressed Matching.
    Proceedings, 21st International Colloquium on Automata, Languages and Programming (ICALP), Jerusalem, Israel, 1994, pp. 215-226.
    
    
18. D. Keselman and A. Amir.
    Maximum Agreement Subtree of a set of Evolutionary Trees - Metrics and Efficient Algorithms.
    Proceedings, 36th Annual IEEE Conference on Foundations of Computer Science (FOCS), Santa Fe, New Mexico, 1994, pp. 758-769.
    
    
19. A. Amir and G. Calinescu.
    Alphabet Independent and Dictionary Scaled Pattern Matching.
    Proceedings, 7th Annual Symposium on Combinatorial Pattern Matching, Laguna Beach, California, June, 1996, pp. 320-334.
    
    
20. A. Amir and E. Dar.
    A Practical Algorithm for Generalized Random Sampling.
    Proceedings, 3rd Italian Conference on Algorithms and Complexity, Rome, March, 1997.
    
    
21. R. Feldman, A. Amir, Y. Aumann, A. Zilberstein, and H. Hirsh.
    Incremental Algorithms for Association Generation.
    Proceedings, 1st Pacific Conference on Knowledge Discovery, Singapore, July 1996.
    
    
22. A. Amir, R. Feldman and R. Kashi.
    A New and Versatile Method for Association Generation.
    Proceedings, 1st European Symposium on Data Mining and Knowledge Discovery (PKDD),
    Komorowski and Zytkow (eds.), Springer LNAI 1263. Trondheim, Norway, June 1997, pp. 221-231.
    
    
23. R. Feldman, Y. Aumann, A. Amir and H. Mannila.
    Efficient Algorithms for Discovering Frequent Sets in Incremental Databases.
    SIGMOD'97 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'97), Tucson, Arizona, 1997.
    
    
24. R. Feldman, Y. Aumann, A. Amir, W. Kloesgen and A. Zilberstien.
    Maximal Association Rules: a New Tool for Mining for Keyword co-occurrences in Document Collections.
    Proceedings of the 3rd International Conference on Knowledge Discovery (KDD-97), Newport Beach, California, August 1997, pp. 167-170.
    
    
25. A. Amir, M. Lewenstein and N. Lewenstein.
    Pattern Matching in Hypertext.
    Proceedings, 5th Workshop on Algorithms and Data Structures (WADS), Halifax, Canada, August 1997, pp. 160-173.
    
    
26. A. Amir, Y. Aumann, G. Landau, M. Lewenstein and N. Lewenstein.
    Pattern Matching with Swaps.
    Proceedings, 38th Annual IEEE Conference on Foundations of Computer Science (FOCS), Miami Beach, Florida, October 1997, pp. 144-153.
    
    
27. A. Amir, E. Dar and G. Koren.
    The Power of Migration in Multi-Processor Scheduling of Real-Time Systems.
    Proceedings, 8th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), San Francisco, CA, January 1998, pp. 226-235.
    
    
28. A. Amir, G. Landau, M. Lewenstein and N. Lewenstein.
    Efficient Special Cases of Pattern Matching with Swaps.
    Proceedings, 9th Annual Combinatorial Pattern Matching Conference (CPM), Rutgers, New Jersey, 1998, pp. 209-220.
    
    
29. A. Amir, D. Keselman, G. Landau, M. Lewenstein, N. Lewenstein and M. Rodeh.
    Indexing and Dictionary Matching with One Error.
    Proceedings, 6th Workshop on Algorithms and Data Structures (WADS), Vancouver, Canada, August 1999, pp. 181-192.
    
    
30. A. Amir, A. Butman and M. Lewenstein.
    Real Scaled Pattern Matching.
    Proceedings, 11th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), San Francisco, CA, January 2000, pp. 815-816.
    
    
31. A. Amir, G. Landau and D. Sokol.
    Inplace Run-Length 2d Compressed Search.
    Proceedings, 11th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), San Francisco, CA, January 2000, pp. 817-818.
    
    
32. A. Amir, M. Lewenstein and E. Porat.
    Faster Algorithms for String Matching with k Mismatches.
    Proceedings, 11th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), San Francisco, CA, January 2000, pp. 794-803.
    
    
33. A. Amir, M. Lewenstein and E. Porat.
    Approximate Swapped Matching.
    Proceedings, 20th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), New Delhi, India, December 2000, pp. 302-311.
    
    
34. A. Amir, M. Lewenstein and E. Porat.
    Approximate Subset Matching with Don't Cares.
    Proceedings, 12th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), Washington, D.C., January 2001, pp. 279-288.
    
    
35. A. Amir, R. Cole, R. Hariharan, M. Lewenstein and E. Porat.
    Overlap Matching.
    Proceedings, 12th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), Washington, D.C., January 2001, pp. 305-306.
    
    
36. A. Amir, R. Kashi and N. Netanyahu.
    Analyzing Quantitative Databases: Image is Everything.
    Proceedings, 27th International Conference on Very Large Data Bases (VLDB), Roma, Italy, September 2001, pp. 89-98.
    
    
37. A. Amir, K. W. Church and E. Dar.
    Separable Attributes: a Techinque for Solving the Submatrices Character Count Problem.
    Proceedings, 13th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA), San Francisco, CA, January 2002, to appear.