Amihood Amir

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
149Closest Periodic Vectors in L p Spaces. Amihood Amir, Estrella Eisenberg, Avivit Levy, Noa Lewenstein. ISAAC 2011, 714-723. Web SearchBibTeXDownload
148Range LCP. Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat. ISAAC 2011, 683-692. Web SearchBibTeXDownload
147Blocked Pattern Matching Problem and Its Applications in Proteomics. Julio Ng, Amihood Amir, Pavel A. Pevzner. RECOMB 2011, 298-319. Web SearchBibTeXDownload
146Approximations and Partial Solutions for the Consensus Sequence Problem. Amihood Amir, Haim Parienty, Liam Roditty. SPIRE 2011, 168-173. Web SearchBibTeXDownload
145Weighted Shortest Common Supersequence. Amihood Amir, Zvi Gotthilf, B. Riva Shalom. SPIRE 2011, 44-54. Web SearchBibTeXDownload
144Efficient algorithms for consensus string problems minimizing both distance sum and radius. Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim. Theor. Comput. Sci. (412): 5239-5246 (2011). Web SearchBibTeXDownload
143Approximate string matching with stuck address bits. Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat. Theor. Comput. Sci. (412): 3537-3544 (2011). Web SearchBibTeXDownload
2010
142Faster Two Dimensional Scaled Matching. Amihood Amir, Eran Chencinski. Algorithmica (56): 214-234 (2010). Web SearchBibTeXDownload
141String Rearrangement Metrics: A Survey. Amihood Amir, Avivit Levy. Algorithms and Applications 2010, 1-33. Web SearchBibTeXDownload
140Cycle Detection and Correction. Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira. ICALP (1) 2010, 43-54. Web SearchBibTeXDownload
139Approximate Periodicity. Amihood Amir, Estrella Eisenberg, Avivit Levy. ISAAC (1) 2010, 25-36. Web SearchBibTeXDownload
138Weighted LCS. Amihood Amir, Zvi Gotthilf, B. Riva Shalom. J. Discrete Algorithms (8): 273-281 (2010). Web SearchBibTeXDownload
137A PTAS for the Square Tiling Problem. Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom. SPIRE 2010, 118-126. Web SearchBibTeXDownload
136Approximate String Matching with Stuck Address Bits. Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat. SPIRE 2010, 395-405. Web SearchBibTeXDownload
2009
135Real Two Dimensional Scaled Matching. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat. Algorithmica (53): 314-336 (2009). Web SearchBibTeXDownload
134Quasi-distinct Parsing and Optimal Compression Methods. Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko. CPM 2009, 12-25. Web SearchBibTeXDownload
133Parameterized matching on non-linear structures. Amihood Amir, Gonzalo Navarro. Inf. Process. Lett. (109): 864-867 (2009). Web SearchBibTeXDownload
132Weighted LCS. Amihood Amir, Zvi Gotthilf, B. Riva Shalom. IWOCA 2009, 36-47. Web SearchBibTeXDownload
131Pattern matching with address errors: Rearrangement distances. Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne. J. Comput. Syst. Sci. (75): 359-370 (2009). Web SearchBibTeXDownload
130On the Cost of Interchange Rearrangement in Strings. Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat. SIAM J. Comput. (39): 1444-1461 (2009). Web SearchBibTeXDownload
129Towards a Theory of Patches. Amihood Amir, Haim Parienty. SPIRE 2009, 254-265. Web SearchBibTeXDownload
128Consensus Optimizing Both Distance Sum and Radius. Amihood Amir, Gad M. Landau, Joong Chae Na, Heejin Park, Kunsoo Park, Jeong Seop Sim. SPIRE 2009, 234-242. Web SearchBibTeXDownload
127Approximate string matching with address bit errors. Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat. Theor. Comput. Sci. (410): 5334-5346 (2009). Web SearchBibTeXDownload
126Efficient computations of l1 and l INFINITY rearrangement distances. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat. Theor. Comput. Sci. (410): 4382-4390 (2009). Web SearchBibTeXDownload
2008
125Improved Deterministic Length Reduction. Amihood Amir, Klim Efremenko, Oren Kapah, Ely Porat, Amir Rothschild. CoRR (abs/0802.0017) (2008). Web SearchBibTeXDownload
124Approximate String Matching with Address Bit Errors. Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat. CPM 2008, 118-129. Web SearchBibTeXDownload
123Similarity between Compressed Strings. Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
122Multidimensional Compressed Pattern Matching. Amihood Amir. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
121Two-Dimensional Scaled Pattern Matching. Amihood Amir. Encyclopedia of Algorithms 2008. Web SearchBibTeXDownload
120The Practical Efficiency of Convolutions in Pattern Matching Algorithms. Amihood Amir, Avivit Levy, Liron Reuveni. Fundam. Inform. (84): 1-15 (2008). Web SearchBibTeXDownload
119Real-time indexing over fixed finite alphabets. Amihood Amir, Igor Nor. SODA 2008, 1086-1095. Web SearchBibTeXDownload
118Property matching and weighted matching. Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang. Theor. Comput. Sci. (395): 298-310 (2008). Web SearchBibTeXDownload
117Computing similarity of run-length encoded strings with affine gap penalty. Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park. Theor. Comput. Sci. (395): 268-282 (2008). Web SearchBibTeXDownload
116Generalized LCS. Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur. Theor. Comput. Sci. (409): 438-449 (2008). Web SearchBibTeXDownload
2007
115Dynamic text and static pattern matching. Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol. ACM Transactions on Algorithms (3) (2007). Web SearchBibTeXDownload
114Two-Dimensional Range Minimum Queries. Amihood Amir, Johannes Fischer, Moshe Lewenstein. CPM 2007, 286-294. Web SearchBibTeXDownload
113Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. Amihood Amir, Oren Kapah, Ely Porat. CPM 2007, 183-194. Web SearchBibTeXDownload
112On the Cost of Interchange Rearrangement in Strings. Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat. ESA 2007, 99-110. Web SearchBibTeXDownload
111Improved approximate common interval. Amihood Amir, Leszek Gasieniec, B. Riva Shalom. Inf. Process. Lett. (103): 142-149 (2007). Web SearchBibTeXDownload
110Generalized function matching. Amihood Amir, Igor Nor. J. Discrete Algorithms (5): 514-523 (2007). Web SearchBibTeXDownload
109Efficient one-dimensional real scaled matching. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur. J. Discrete Algorithms (5): 205-211 (2007). Web SearchBibTeXDownload
108Efficient Computations of l1 and linfinity Rearrangement Distances. Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat. SPIRE 2007, 39-49. Cited by 2Web SearchBibTeXDownload
107Generalized LCS. Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur. SPIRE 2007, 50-61. Web SearchBibTeXDownload
2006
106Swap and Mismatch Edit Distance. Amihood Amir, Estrella Eisenberg, Ely Porat. Algorithmica (45): 109-120 (2006). Web SearchBibTeXDownload
105Faster Two Dimensional Scaled Matching. Amihood Amir, Eran Chencinski. CPM 2006, 200-210. Web SearchBibTeXDownload
104Approximate Matching in Weighted Sequences. Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat. CPM 2006, 365-376. Web SearchBibTeXDownload
103Asynchronous Pattern Matching. Amihood Amir. CPM 2006, 1-10. Web SearchBibTeXDownload
102Property Matching and Weighted Matching. Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang. CPM 2006, 188-199. Web SearchBibTeXDownload
101Function Matching. Amihood Amir, Yonatan Aumann, Moshe Lewenstein, Ely Porat. SIAM J. Comput. (35): 1007-1022 (2006). Web SearchBibTeXDownload
100Pattern matching with address errors: rearrangement distances. Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne. SODA 2006, 1221-1229. Web SearchBibTeXDownload
99Faster two-dimensional pattern matching with rotations. Amihood Amir, Oren Kapah, Dekel Tsur. Theor. Comput. Sci. (368): 196-204 (2006). Web SearchBibTeXDownload
2005
98Approximate Matching in the L1 Metric. Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski. CPM 2005, 91-103. Web SearchBibTeXDownload
97Theoretical issues of searching aerial photographs: a bird's eye view. Amihood Amir. Int. J. Found. Comput. Sci. (16): 1075-1097 (2005). Web SearchBibTeXDownload
96Maximal Association Rules: A Tool for Mining Associations in Text. Amihood Amir, Yonatan Aumann, Ronen Feldman, Moshe Fresko. J. Intell. Inf. Syst. (25): 333-345 (2005). Web SearchBibTeXDownload
95Computing Similarity of Run-Length Encoded Strings with Affine Gap Penalty. Jin Wook Kim, Amihood Amir, Gad M. Landau, Kunsoo Park. SPIRE 2005, 315-326. Web SearchBibTeXDownload
94Towards Real-Time Suffix Tree Construction. Amihood Amir, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein. SPIRE 2005, 67-78. Web SearchBibTeXDownload
93Asynchronous pattern matching - Metrics. Amihood Amir. Stringology 2005, 31-36. Web SearchBibTeX
92Two Glass Balls and a Tower. Amihood Amir. We Will Show Them! (1) 2005, 57-76. Web SearchBibTeX
2004
91Faster Two Dimensional Pattern Matching with Rotations. Amihood Amir, Oren Kapah, Dekel Tsur. CPM 2004, 409-419. Web SearchBibTeXDownload
90Swap and Mismatch Edit Distance. Amihood Amir, Estrella Eisenberg, Ely Porat. ESA 2004, 16-27. Web SearchBibTeXDownload
89The submatrices character count problem: an efficient solution using separable values. Amihood Amir, Kenneth Ward Church, Emanuel Dar. Inf. Comput. (190): 100-116 (2004). Web SearchBibTeXDownload
88Text independent speaker recognition using speaker dependent word spotting. Hagai Aronowitz, David Burshtein, Amihood Amir. INTERSPEECH 2004. Web SearchBibTeXDownload
87Speaker indexing in audio archives using test utterance Gaussian mixture modeling. Hagai Aronowitz, David Burshtein, Amihood Amir. INTERSPEECH 2004. Web SearchBibTeXDownload
86Generalized Function Matching. Amihood Amir, Igor Nor. ISAAC 2004, 41-52. Web SearchBibTeXDownload
85Faster algorithms for string matching with k mismatches. Amihood Amir, Moshe Lewenstein, Ely Porat. J. Algorithms (50): 257-275 (2004). Web SearchBibTeXDownload
84Speaker Indexing in Audio Archives Using Gaussian Mixture Scoring Simulation. Hagai Aronowitz, David Burshtein, Amihood Amir. MLMI 2004, 243-252. Web SearchBibTeXDownload
83Efficient One Dimensional Real Scaled Matching. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur. SPIRE 2004, 1-9. Web SearchBibTeXDownload
82Theoretical Issues of Searching Aerial Photographs: A Bird's Eye View. Amihood Amir. Stringology 2004, 1-23. Web SearchBibTeXDownload
81Two-dimensional pattern matching with rotations. Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps. Theor. Comput. Sci. (314): 173-187 (2004). Web SearchBibTeXDownload
80Shape-Embedded-Histograms for Visual Data Mining. Amihood Amir, Reuven Kashi, Daniel A. Keim, Nathan S. Netanyahu, Markus Wawryniuk. VisSym 2004, 55-64, 341. Web SearchBibTeX
2003
79Two-Dimensional Pattern Matching with Rotations. Amihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps. CPM 2003, 17-31. Web SearchBibTeXDownload
78A rapid method for detection of putative RNAi target genes in genomic data. Yair Horesh, Amihood Amir, Shulamit Michaeli, Ron Unger. ECCB 2003, 73-80. Web SearchBibTeX
77Function Matching: Algorithms, Applications, and a Lower Bound. Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat. ICALP 2003, 929-942. Web SearchBibTeXDownload
76Analyzing High-Dimensional Data by Subspace Validity. Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, Daniel A. Keim, Markus Wawryniuk. ICDM 2003, 473-476. Cited by 2Web SearchBibTeXDownload
75Efficient Multidimensional Quantitative Hypotheses Generation. Amihood Amir, Reuven Kashi, Nathan S. Netanyahu. ICDM 2003, 3-10. Web SearchBibTeXDownload
74Overlap matching. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat. Inf. Comput. (181): 57-74 (2003). Web SearchBibTeXDownload
73Some connections between bounded query classes and non-uniform complexity. Amihood Amir, Richard Beigel, William I. Gasarch. Inf. Comput. (186): 104-139 (2003). Web SearchBibTeXDownload
72Efficient text fingerprinting via Parikh mapping. Amihood Amir, Alberto Apostolico, Gad M. Landau, Giorgio Satta. J. Discrete Algorithms (1): 409-421 (2003). Web SearchBibTeXDownload
71Inplace 2D matching in compressed images. Amihood Amir, Gad M. Landau, Dina Sokol. SODA (49): 240-261 (2003). Web SearchBibTeXDownload
70Inplace run-length 2d compressed search. Amihood Amir, Gad M. Landau, Dina Sokol. Theor. Comput. Sci. (290): 1361-1383 (2003). Web SearchBibTeXDownload
69Dynamic Text and Static Pattern Matching. Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol. WADS 2003, 340-352. Web SearchBibTeXDownload
68Real Two Dimensional Scaled Matching. Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat. WADS 2003, 353-364. Web SearchBibTeXDownload
2002
67Approximate swapped matching. Amihood Amir, Moshe Lewenstein, Ely Porat. Inf. Process. Lett. (83): 33-39 (2002). Web SearchBibTeXDownload
66Online timestamped text indexing. Amihood Amir, Gad M. Landau, Esko Ukkonen. Inf. Process. Lett. (82): 253-259 (2002). Web SearchBibTeXDownload
65Separable attributes: a technique for solving the sub matrices character count problem. Amihood Amir, Kenneth Ward Church, Emanuel Dar. SODA 2002, 400-401. Web SearchBibTeXDownload
2001
64Genetic Threading. Jacqueline Yadgari, Amihood Amir, Ron Unger. Constraints (6): 271-292 (2001). Web SearchBibTeXDownload
63Approximate subset matching with Don't Cares. Amihood Amir, Ely Porat, Moshe Lewenstein. SODA 2001, 305-306. Web SearchBibTeXDownload
62Overlap matching. Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat. SODA 2001, 279-288. Web SearchBibTeXDownload
61Analyzing Quantitative Databases: Image is Everything. Amihood Amir, Reuven Kashi, Nathan S. Netanyahu. VLDB 2001, 89-98. Web SearchBibTeXDownload
2000
60Some Connections between Bounded Query Classes and Non-Uniform Complexity. Amihood Amir, Richard Beigel, William I. Gasarch. Electronic Colloquium on Computational Complexity (ECCC) (7) (2000). Web SearchBibTeXDownload
59Approximate Swapped Matching. Amihood Amir, Moshe Lewenstein, Ely Porat. FSTTCS 2000, 302-311. Web SearchBibTeXDownload
58Alphabet-Independent and Scaled Dictionary Matching. Amihood Amir, Gruia Calinescu. J. Algorithms (36): 34-62 (2000). Web SearchBibTeXDownload
57Pattern Matching in Hypertext. Amihood Amir, Moshe Lewenstein, Noa Lewenstein. J. Algorithms (35): 82-99 (2000). Web SearchBibTeXDownload
56Text Indexing and Dictionary Matching with One Error. Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh. J. Algorithms (37): 309-325 (2000). Web SearchBibTeXDownload
55Pattern Matching with Swaps. Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein. J. Algorithms (37): 247-266 (2000). Web SearchBibTeXDownload
54The Power of Migration in Multiprocessor Scheduling of Real-Time Systems. Gilad Koren, Emanuel Dar, Amihood Amir. SIAM J. Comput. (30): 511-527 (2000). Web SearchBibTeXDownload
53Faster algorithms for string matching with k mismatches. Amihood Amir, Moshe Lewenstein, Ely Porat. SODA 2000, 794-803. Web SearchBibTeXDownload
52Real scaled matching. Amihood Amir, Ayelet Butman, Moshe Lewenstein. SODA 2000, 815-816. Web SearchBibTeXDownload
51Inplace run-length 2d compressed search. Amihood Amir, Gad M. Landau, Dina Sokol. SODA 2000, 817-818. Web SearchBibTeXDownload
1999
50A simple algorithm for detecting circular permutations in proteins. S. Uliel, A. Fliess, Amihood Amir, Ron Unger. Bioinformatics (15): 930-936 (1999). Web SearchBibTeXDownload
49Real Scaled Matching. Amihood Amir, Ayelet Butman, Moshe Lewenstein. Inf. Process. Lett. (70): 185-190 (1999). Web SearchBibTeXDownload
48Indexing and Dictionary Matching with One Error. Amihood Amir, Dmitry Keselman, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein, Michael Rodeh. WADS 1999, 181-192. Web SearchBibTeXDownload
1998
47Efficient Special Cases of Pattern Matching with Swaps. Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein. CPM (68): 125-132 (1998). Web SearchBibTeXDownload
46Optimal Parallel Two Dimensional Text Searching on a CREW PRAM. Amihood Amir, Gary Benson, Martin Farach. Inf. Comput. (144): 1-17 (1998). Web SearchBibTeXDownload
45Genetic Algorithms for Protein Threading. Jacqueline Yadgari, Amihood Amir, Ron Unger. ISMB 1998, 193-202. Web SearchBibTeX
44Two-Dimensional Periodicity in Rectangular Arrays. Amihood Amir, Gary Benson. SIAM J. Comput. (27): 90-106 (1998). Web SearchBibTeXDownload
43The Power of Migration in Multi-Processor Scheduling of Real-Time Systems. Gilad Koren, Amihood Amir, Emanuel Dar. SODA 1998, 226-235. Web SearchBibTeXDownload
1997
42An Improved Deterministic Algorithms for Generalized Random Sampling. Amihood Amir, Emanuel Dar. CIAC 1997, 159-170. Web SearchBibTeXDownload
41Efficient Algorithms for Discovering Frequent Sets in Incremental Databases. Ronen Feldman, Yonatan Aumann, Amihood Amir, Heikki Mannila. DMKD 1997. Cited by 89Web SearchBibTeX
40Pattern Matching with Swaps. Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein. FOCS 1997, 144-153. Web SearchBibTeXDownload
39An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples. Amihood Amir, Emanuel Dar. Inf. Process. Lett. (62): 95-101 (1997). Web SearchBibTeXDownload
38Inverse Pattern Matching. Amihood Amir, Alberto Apostolico, Moshe Lewenstein. J. Algorithms (24): 325-339 (1997). Web SearchBibTeXDownload
37Optimal Two-Dimensional Compressed Matching. Amihood Amir, Gary Benson, Martin Farach. J. Algorithms (24): 354-379 (1997). Web SearchBibTeXDownload
36Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections. Ronen Feldman, Yonatan Aumann, Amihood Amir, Amir Zilberstein, Willi Klösgen. KDD 1997, 167-170. Web SearchBibTeX
35A New and Versatile Method for Association Generation. Amihood Amir, Ronen Feldman, Reuven Kashi. PKDD (22): 333-347 (1997). Web SearchBibTeXDownload
34Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms. Amihood Amir, Dmitry Keselman. SIAM J. Comput. (26): 1656-1669 (1997). Web SearchBibTeXDownload
33Pattern Matching In Hypertext. Amihood Amir, Moshe Lewenstein, Noa Lewenstein. WADS 1997, 160-173. Web SearchBibTeXDownload
1996
32Alphabet Independent and Dictionary Scaled Matching. Amihood Amir, Gruia Calinescu. CPM 1996, 320-334. Web SearchBibTeXDownload
31Let Sleeping Files Lie: Pattern Matching in Z-Compressed Files. Amihood Amir, Gary Benson, Martin Farach. J. Comput. Syst. Sci. (52): 299-307 (1996). Web SearchBibTeXDownload
1995
30Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures. Amihood Amir, Martin Farach. Inf. Comput. (118): 1-11 (1995). Web SearchBibTeXDownload
29Improved Dynamic Dictionary Matching. Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer. Inf. Comput. (119): 258-282 (1995). Web SearchBibTeXDownload
28Contributions of theoretical computer science. Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith. SIGACT News (26): 2-4 (1995). Web SearchBibTeXDownload
1994
27Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms. Dmitry Keselman, Amihood Amir. FOCS 1994, 758-769. Web SearchBibTeXDownload
26Optimal Two-Dimensional Compressed Matching. Amihood Amir, Gary Benson, Martin Farach. ICALP 1994, 215-226. Web SearchBibTeXDownload
25Alphabet Dependence in Parameterized Matching. Amihood Amir, Martin Farach, S. Muthukrishnan. Inf. Process. Lett. (49): 111-115 (1994). Cited by 54Web SearchBibTeXDownload
24Dynamic Dictionary Matching. Amihood Amir, Martin Farach, Zvi Galil, Raffaele Giancarlo, Kunsoo Park. J. Comput. Syst. Sci. (49): 208-222 (1994). Web SearchBibTeXDownload
23An Alphabet Independent Approach to Two-Dimensional Pattern Matching. Amihood Amir, Gary Benson, Martin Farach. SIAM J. Comput. (23): 313-323 (1994). Web SearchBibTeXDownload
22Let Sleeping Files Lie: Pattern Matching in Z-compressed Files. Amihood Amir, Gary Benson, Martin Farach. SODA 1994, 705-714. Web SearchBibTeXDownload
1993
21The Syntax of Parallelism. Amihood Amir, Carl H. Smith. Fundam. Inform. (19): 383-402 (1993). Web SearchBibTeX
20Improved Dynamic Dictionary Matching. Amihood Amir, Martin Farach, Ramana M. Idury, Johannes A. La Poutré, Alejandro A. Schäffer. SODA 1993, 392-401. Web SearchBibTeXDownload
19Optimal Parallel Two Dimensional Pattern Matching. Amihood Amir, Gary Benson, Martin Farach. SPAA 1993, 79-85. Web SearchBibTeXDownload
1992
18Efficient Randomized Dictionary Matching Algorithms (Extended Abstract). Amihood Amir, Martin Farach, Yossi Matias. CPM 1992, 262-275. Cited by 35Web SearchBibTeXDownload
17Efficient Two-Dimensional Compressed Matching. Amihood Amir, Gary Benson. Data Compression Conference 1992, 279-288. Web SearchBibTeXDownload
16Two-Dimensional Dictionary Matching. Amihood Amir, Martin Farach. Inf. Process. Lett. (44): 233-239 (1992). Web SearchBibTeXDownload
15Efficient Pattern Matching with Scaling. Amihood Amir, Gad M. Landau, Uzi Vishkin. J. Algorithms (13): 2-32 (1992). Web SearchBibTeXDownload
14Two-Dimensional Periodicity and Its Applications. Amihood Amir, Gary Benson. SODA 1992, 440-452. Web SearchBibTeXDownload
13Alphabet Independent Two Dimensional Matching. Amihood Amir, Gary Benson, Martin Farach. STOC 1992, 59-68. Web SearchBibTeXDownload
1991
12Efficient matching of nonrectangular shapes. Amihood Amir, Martin Farach. Ann. Math. Artif. Intell. (4): 211-224 (1991). Web SearchBibTeXDownload
11Adaptive Dictionary Matching. Amihood Amir, Martin Farach. FOCS 1991, 760-766. Web SearchBibTeXDownload
10An efficient algorithm for generalized random sampling. Amihood Amir, Doron Mintz. Pattern Recognition Letters (12): 683-686 (1991). Web SearchBibTeXDownload
9Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures. Amihood Amir, Martin Farach. SODA 1991, 212-223. Web SearchBibTeXDownload
8Fast Parallel and Serial Multidimensional Aproximate Array Matching. Amihood Amir, Gad M. Landau. Theor. Comput. Sci. (81): 97-115 (1991). Web SearchBibTeXDownload
1990
7Optimal view caching. Amihood Amir, Nick Roussopoulos. Inf. Syst. (15): 169-171 (1990). Cited by 7Web SearchBibTeXDownload
6Efficient Pattern Matching with Scaling. Amihood Amir, Gad M. Landau, Uzi Vishkin. SODA 1990, 344-357. Web SearchBibTeXDownload
5Some Connections Between Bounded Query Classes and Non-Uniform Complexity. Amihood Amir, Richard Beigel, William I. Gasarch. Structure in Complexity Theory Conference 1990, 232-243. Web SearchBibTeX
1988
4Polynomial Terse Sets. Amihood Amir, William I. Gasarch. Inf. Comput. (77): 37-56 (1988). Web SearchBibTeXDownload
1987
3Preservation of Expressive Completeness in Temporal Models. Amihood Amir, Dov M. Gabbay. Inf. Comput. (72): 66-83 (1987). Web SearchBibTeXDownload
2Expressive Completeness Failure in Branching Time Structures. Amihood Amir. J. Comput. Syst. Sci. (34): 27-42 (1987). Web SearchBibTeX
1985
1Separation in Nonlinear Time Models. Amihood Amir. Information and Control (66): 177-203 (1985). Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research