2009 |
130 | EE | Amihood Amir,
Ayelet Butman,
Moshe Lewenstein,
Ely Porat:
Real Two Dimensional Scaled Matching.
Algorithmica 53(3): 314-336 (2009) |
2008 |
129 | | Amihood Amir,
Andrew Turpin,
Alistair Moffat:
String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008, Melbourne, Australia, November 10-12, 2008. Proceedings
Springer 2008 |
128 | EE | Amihood Amir,
Yonatan Aumann,
Oren Kapah,
Avivit Levy,
Ely Porat:
Approximate String Matching with Address Bit Errors.
CPM 2008: 118-129 |
127 | EE | Amihood Amir,
Igor Nor:
Real-time indexing over fixed finite alphabets.
SODA 2008: 1086-1095 |
126 | EE | Amihood Amir:
Multidimensional Compressed Pattern Matching.
Encyclopedia of Algorithms 2008 |
125 | EE | Jin Wook Kim,
Amihood Amir,
Gad M. Landau,
Kunsoo Park:
Similarity between Compressed Strings.
Encyclopedia of Algorithms 2008 |
124 | EE | Amihood Amir:
Two-Dimensional Scaled Pattern Matching.
Encyclopedia of Algorithms 2008 |
123 | EE | Amihood Amir,
Klim Efremenko,
Oren Kapah,
Ely Porat,
Amir Rothschild:
Improved Deterministic Length Reduction
CoRR abs/0802.0017: (2008) |
122 | EE | Amihood Amir,
Avivit Levy,
Liron Reuveni:
The Practical Efficiency of Convolutions in Pattern Matching Algorithms.
Fundam. Inform. 84(1): 1-15 (2008) |
121 | EE | 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) |
120 | EE | 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) |
119 | EE | Amihood Amir,
Tzvika Hartman,
Oren Kapah,
B. Riva Shalom,
Dekel Tsur:
Generalized LCS.
Theor. Comput. Sci. 409(3): 438-449 (2008) |
2007 |
118 | EE | Amihood Amir,
Oren Kapah,
Ely Porat:
Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications.
CPM 2007: 183-194 |
117 | EE | Amihood Amir,
Johannes Fischer,
Moshe Lewenstein:
Two-Dimensional Range Minimum Queries.
CPM 2007: 286-294 |
116 | EE | Amihood Amir,
Tzvika Hartman,
Oren Kapah,
Avivit Levy,
Ely Porat:
On the Cost of Interchange Rearrangement in Strings.
ESA 2007: 99-110 |
115 | EE | Amihood Amir,
Yonatan Aumann,
Piotr Indyk,
Avivit Levy,
Ely Porat:
Efficient Computations of l1 and linfinity Rearrangement Distances.
SPIRE 2007: 39-49 |
114 | EE | Amihood Amir,
Tzvika Hartman,
Oren Kapah,
B. Riva Shalom,
Dekel Tsur:
Generalized LCS.
SPIRE 2007: 50-61 |
113 | EE | Amihood Amir,
Gad M. Landau,
Moshe Lewenstein,
Dina Sokol:
Dynamic text and static pattern matching.
ACM Transactions on Algorithms 3(2): (2007) |
112 | EE | Amihood Amir,
Leszek Gasieniec,
B. Riva Shalom:
Improved approximate common interval.
Inf. Process. Lett. 103(4): 142-149 (2007) |
111 | EE | Amihood Amir,
Ayelet Butman,
Moshe Lewenstein,
Ely Porat,
Dekel Tsur:
Efficient one-dimensional real scaled matching.
J. Discrete Algorithms 5(2): 205-211 (2007) |
110 | EE | Amihood Amir,
Igor Nor:
Generalized function matching.
J. Discrete Algorithms 5(3): 514-523 (2007) |
2006 |
109 | EE | Amihood Amir:
Asynchronous Pattern Matching.
CPM 2006: 1-10 |
108 | EE | Amihood Amir,
Eran Chencinski,
Costas S. Iliopoulos,
Tsvi Kopelowitz,
Hui Zhang:
Property Matching and Weighted Matching.
CPM 2006: 188-199 |
107 | EE | Amihood Amir,
Eran Chencinski:
Faster Two Dimensional Scaled Matching.
CPM 2006: 200-210 |
106 | EE | Amihood Amir,
Costas S. Iliopoulos,
Oren Kapah,
Ely Porat:
Approximate Matching in Weighted Sequences.
CPM 2006: 365-376 |
105 | EE | 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 |
104 | EE | Amihood Amir,
Estrella Eisenberg,
Ely Porat:
Swap and Mismatch Edit Distance.
Algorithmica 45(1): 109-120 (2006) |
103 | EE | Amihood Amir,
Yonatan Aumann,
Moshe Lewenstein,
Ely Porat:
Function Matching.
SIAM J. Comput. 35(5): 1007-1022 (2006) |
102 | EE | Amihood Amir,
Oren Kapah,
Dekel Tsur:
Faster two-dimensional pattern matching with rotations.
Theor. Comput. Sci. 368(3): 196-204 (2006) |
2005 |
101 | EE | Amihood Amir,
Ohad Lipsky,
Ely Porat,
Julia Umanski:
Approximate Matching in the L1 Metric.
CPM 2005: 91-103 |
100 | EE | 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 |
99 | EE | Amihood Amir,
Tsvi Kopelowitz,
Moshe Lewenstein,
Noa Lewenstein:
Towards Real-Time Suffix Tree Construction.
SPIRE 2005: 67-78 |
98 | | Amihood Amir:
Asynchronous pattern matching - Metrics.
Stringology 2005: 31-36 |
97 | | Amihood Amir:
Two Glass Balls and a Tower.
We Will Show Them! (1) 2005: 57-76 |
96 | EE | Amihood Amir,
Gad M. Landau:
Foreword.
Discrete Applied Mathematics 146(2): 123 (2005) |
95 | EE | Amihood Amir:
Theoretical issues of searching aerial photographs: a bird's eye view.
Int. J. Found. Comput. Sci. 16(6): 1075-1097 (2005) |
94 | EE | 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) |
2004 |
93 | EE | Amihood Amir,
Oren Kapah,
Dekel Tsur:
Faster Two Dimensional Pattern Matching with Rotations.
CPM 2004: 409-419 |
92 | EE | Amihood Amir,
Estrella Eisenberg,
Ely Porat:
Swap and Mismatch Edit Distance.
ESA 2004: 16-27 |
91 | EE | Amihood Amir,
Igor Nor:
Generalized Function Matching.
ISAAC 2004: 41-52 |
90 | EE | Hagai Aronowitz,
David Burshtein,
Amihood Amir:
Speaker Indexing in Audio Archives Using Gaussian Mixture Scoring Simulation.
MLMI 2004: 243-252 |
89 | EE | Amihood Amir,
Ayelet Butman,
Moshe Lewenstein,
Ely Porat,
Dekel Tsur:
Efficient One Dimensional Real Scaled Matching.
SPIRE 2004: 1-9 |
88 | EE | Amihood Amir:
Theoretical Issues of Searching Aerial Photographs: A Bird's Eye View.
Stringology 2004: 1-23 |
87 | | Amihood Amir,
Reuven Kashi,
Daniel A. Keim,
Nathan S. Netanyahu,
Markus Wawryniuk:
Shape-Embedded-Histograms for Visual Data Mining.
VisSym 2004: 55-64, 341 |
86 | EE | 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) |
85 | EE | Amihood Amir,
Moshe Lewenstein,
Ely Porat:
Faster algorithms for string matching with k mismatches.
J. Algorithms 50(2): 257-275 (2004) |
84 | EE | 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) |
2003 |
83 | EE | Amihood Amir,
Ayelet Butman,
Maxime Crochemore,
Gad M. Landau,
Malka Schaps:
Two-Dimensional Pattern Matching with Rotations.
CPM 2003: 17-31 |
82 | | 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 |
81 | EE | Amihood Amir,
Yonatan Aumann,
Richard Cole,
Moshe Lewenstein,
Ely Porat:
Function Matching: Algorithms, Applications, and a Lower Bound.
ICALP 2003: 929-942 |
80 | EE | Amihood Amir,
Reuven Kashi,
Nathan S. Netanyahu:
Efficient Multidimensional Quantitative Hypotheses Generation.
ICDM 2003: 3-10 |
79 | EE | Amihood Amir,
Reuven Kashi,
Nathan S. Netanyahu,
Daniel A. Keim,
Markus Wawryniuk:
Analyzing High-Dimensional Data by Subspace Validity.
ICDM 2003: 473-476 |
78 | EE | Amihood Amir,
Gad M. Landau,
Dina Sokol:
Inplace 2D matching in compressed images.
SODA 2003: 853-862 |
77 | EE | Amihood Amir,
Gad M. Landau,
Moshe Lewenstein,
Dina Sokol:
Dynamic Text and Static Pattern Matching.
WADS 2003: 340-352 |
76 | EE | Amihood Amir,
Ayelet Butman,
Moshe Lewenstein,
Ely Porat:
Real Two Dimensional Scaled Matching.
WADS 2003: 353-364 |
75 | EE | Amihood Amir,
Richard Cole,
Ramesh Hariharan,
Moshe Lewenstein,
Ely Porat:
Overlap matching.
Inf. Comput. 181(1): 57-74 (2003) |
74 | EE | Amihood Amir,
Richard Beigel,
William I. Gasarch:
Some connections between bounded query classes and non-uniform complexity.
Inf. Comput. 186(1): 104-139 (2003) |
73 | EE | Amihood Amir,
Gad M. Landau,
Dina Sokol:
Inplace 2D matching in compressed images.
J. Algorithms 49(2): 240-261 (2003) |
72 | EE | Amihood Amir,
Alberto Apostolico,
Gad M. Landau,
Giorgio Satta:
Efficient text fingerprinting via Parikh mapping.
J. Discrete Algorithms 1(5-6): 409-421 (2003) |
71 | | Amihood Amir,
Gad M. Landau,
Dina Sokol:
Inplace run-length 2d compressed search.
Theor. Comput. Sci. 290(3): 1361-1383 (2003) |
2002 |
70 | EE | Amihood Amir,
Kenneth Ward Church,
Emanuel Dar:
Separable attributes: a technique for solving the sub matrices character count problem.
SODA 2002: 400-401 |
69 | EE | Amihood Amir,
Gad M. Landau,
Esko Ukkonen:
Online timestamped text indexing.
Inf. Process. Lett. 82(5): 253-259 (2002) |
68 | EE | Amihood Amir,
Moshe Lewenstein,
Ely Porat:
Approximate swapped matching.
Inf. Process. Lett. 83(1): 33-39 (2002) |
2001 |
67 | | Amihood Amir,
Gad M. Landau:
Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings
Springer 2001 |
66 | EE | Amihood Amir,
Richard Cole,
Ramesh Hariharan,
Moshe Lewenstein,
Ely Porat:
Overlap matching.
SODA 2001: 279-288 |
65 | EE | Amihood Amir,
Ely Porat,
Moshe Lewenstein:
Approximate subset matching with Don't Cares.
SODA 2001: 305-306 |
64 | EE | Amihood Amir,
Reuven Kashi,
Nathan S. Netanyahu:
Analyzing Quantitative Databases: Image is Everything.
VLDB 2001: 89-98 |
63 | | Jacqueline Yadgari,
Amihood Amir,
Ron Unger:
Genetic Threading.
Constraints 6(2/3): 271-292 (2001) |
2000 |
62 | EE | Amihood Amir,
Moshe Lewenstein,
Ely Porat:
Approximate Swapped Matching.
FSTTCS 2000: 302-311 |
61 | EE | Amihood Amir,
Moshe Lewenstein,
Ely Porat:
Faster algorithms for string matching with k mismatches.
SODA 2000: 794-803 |
60 | EE | Amihood Amir,
Ayelet Butman,
Moshe Lewenstein:
Real scaled matching.
SODA 2000: 815-816 |
59 | EE | Amihood Amir,
Gad M. Landau,
Dina Sokol:
Inplace run-length 2d compressed search.
SODA 2000: 817-818 |
58 | EE | 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) |
57 | | Amihood Amir,
Moshe Lewenstein,
Noa Lewenstein:
Pattern Matching in Hypertext.
J. Algorithms 35(1): 82-99 (2000) |
56 | | Amihood Amir,
Gruia Calinescu:
Alphabet-Independent and Scaled Dictionary Matching.
J. Algorithms 36(1): 34-62 (2000) |
55 | | Amihood Amir,
Yonatan Aumann,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein:
Pattern Matching with Swaps.
J. Algorithms 37(2): 247-266 (2000) |
54 | | 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) |
53 | | 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) |
1999 |
52 | EE | Amihood Amir,
Dmitry Keselman,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein,
Michael Rodeh:
Indexing and Dictionary Matching with One Error.
WADS 1999: 181-192 |
51 | | S. Uliel,
A. Fliess,
Amihood Amir,
Ron Unger:
A simple algorithm for detecting circular permutations in proteins.
Bioinformatics 15(11): 930-936 (1999) |
50 | EE | Amihood Amir,
Ayelet Butman,
Moshe Lewenstein:
Real Scaled Matching.
Inf. Process. Lett. 70(4): 185-190 (1999) |
1998 |
49 | | Amihood Amir,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps.
CPM 1998: 209-220 |
48 | | Jacqueline Yadgari,
Amihood Amir,
Ron Unger:
Genetic Algorithms for Protein Threading.
ISMB 1998: 193-202 |
47 | | Gilad Koren,
Amihood Amir,
Emanuel Dar:
The Power of Migration in Multi-Processor Scheduling of Real-Time Systems.
SODA 1998: 226-235 |
46 | | Amihood Amir,
Gary Benson,
Martin Farach:
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM.
Inf. Comput. 144(1): 1-17 (1998) |
45 | EE | 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) |
44 | | Amihood Amir,
Gary Benson:
Two-Dimensional Periodicity in Rectangular Arrays.
SIAM J. Comput. 27(1): 90-106 (1998) |
1997 |
43 | | Amihood Amir,
Emanuel Dar:
An Improved Deterministic Algorithms for Generalized Random Sampling.
CIAC 1997: 159-170 |
42 | | Ronen Feldman,
Yonatan Aumann,
Amihood Amir,
Heikki Mannila:
Efficient Algorithms for Discovering Frequent Sets in Incremental Databases.
DMKD 1997: 0- |
41 | EE | Amihood Amir,
Yonatan Aumann,
Gad M. Landau,
Moshe Lewenstein,
Noa Lewenstein:
Pattern Matching with Swaps.
FOCS 1997: 144-153 |
40 | | 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 |
39 | | Amihood Amir,
Ronen Feldman,
Reuven Kashi:
A New and Versatile Method for Association Generation.
PKDD 1997: 221-231 |
38 | | Amihood Amir,
Moshe Lewenstein,
Noa Lewenstein:
Pattern Matching In Hypertext.
WADS 1997: 160-173 |
37 | EE | Amihood Amir,
Emanuel Dar:
An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples.
Inf. Process. Lett. 62(2): 95-101 (1997) |
36 | EE | Amihood Amir,
Ronen Feldman,
Reuven Kashi:
A New and Versatile Method for Association Generation.
Inf. Syst. 22(6/7): 333-347 (1997) |
35 | | Amihood Amir,
Alberto Apostolico,
Moshe Lewenstein:
Inverse Pattern Matching.
J. Algorithms 24(2): 325-339 (1997) |
34 | | Amihood Amir,
Gary Benson,
Martin Farach:
Optimal Two-Dimensional Compressed Matching.
J. Algorithms 24(2): 354-379 (1997) |
33 | | 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) |
1996 |
32 | | Amihood Amir,
Gruia Calinescu:
Alphabet Independent and Dictionary Scaled Matching.
CPM 1996: 320-334 |
31 | | 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) |
1995 |
30 | | Amihood Amir,
Martin Farach:
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures
Inf. Comput. 118(1): 1-11 (1995) |
29 | | 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) |
1994 |
28 | | Dmitry Keselman,
Amihood Amir:
Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms
FOCS 1994: 758-769 |
27 | | Amihood Amir,
Gary Benson,
Martin Farach:
Optimal Two-Dimensional Compressed Matching.
ICALP 1994: 215-226 |
26 | | Amihood Amir,
Gary Benson,
Martin Farach:
Let Sleeping Files Lie: Pattern Matching in Z-compressed Files.
SODA 1994: 705-714 |
25 | | Amihood Amir,
Martin Farach,
S. Muthukrishnan:
Alphabet Dependence in Parameterized Matching.
Inf. Process. Lett. 49(3): 111-115 (1994) |
24 | | Amihood Amir,
Martin Farach,
Zvi Galil,
Raffaele Giancarlo,
Kunsoo Park:
Dynamic Dictionary Matching.
J. Comput. Syst. Sci. 49(2): 208-222 (1994) |
23 | | Amihood Amir,
Gary Benson,
Martin Farach:
An Alphabet Independent Approach to Two-Dimensional Pattern Matching.
SIAM J. Comput. 23(2): 313-323 (1994) |
1993 |
22 | | Amihood Amir,
Martin Farach,
Ramana M. Idury,
Johannes A. La Poutré,
Alejandro A. Schäffer:
Improved Dynamic Dictionary Matching.
SODA 1993: 392-401 |
21 | EE | Amihood Amir,
Gary Benson,
Martin Farach:
Optimal Parallel Two Dimensional Pattern Matching.
SPAA 1993: 79-85 |
20 | | Amihood Amir,
Carl H. Smith:
The Syntax of Parallelism.
Fundam. Inform. 19(3/4): 383-402 (1993) |
1992 |
19 | | Amihood Amir,
Martin Farach,
Yossi Matias:
Efficient Randomized Dictionary Matching Algorithms (Extended Abstract).
CPM 1992: 262-275 |
18 | | Amihood Amir,
Gary Benson:
Efficient Two-Dimensional Compressed Matching.
Data Compression Conference 1992: 279-288 |
17 | EE | Amihood Amir,
Gary Benson:
Two-Dimensional Periodicity and Its Applications.
SODA 1992: 440-452 |
16 | | Amihood Amir,
Gary Benson,
Martin Farach:
Alphabet Independent Two Dimensional Matching
STOC 1992: 59-68 |
15 | | Amihood Amir,
Martin Farach:
Two-Dimensional Dictionary Matching.
Inf. Process. Lett. 44(5): 233-239 (1992) |
14 | | Amihood Amir,
Gad M. Landau,
Uzi Vishkin:
Efficient Pattern Matching with Scaling.
J. Algorithms 13(1): 2-32 (1992) |
1991 |
13 | | Amihood Amir,
Martin Farach:
Adaptive Dictionary Matching
FOCS 1991: 760-766 |
12 | | Amihood Amir,
Martin Farach:
Efficient 2-dimensional Approximate Matching of Non-Rectangular Figures.
SODA 1991: 212-223 |
11 | | Amihood Amir,
Martin Farach:
Efficient matching of nonrectangular shapes.
Ann. Math. Artif. Intell. 4: 211-224 (1991) |
10 | EE | Amihood Amir,
Doron Mintz:
An efficient algorithm for generalized random sampling.
Pattern Recognition Letters 12(11): 683-686 (1991) |
9 | | Amihood Amir,
Gad M. Landau:
Fast Parallel and Serial Multidimensional Aproximate Array Matching.
Theor. Comput. Sci. 81(1): 97-115 (1991) |
1990 |
8 | | Amihood Amir,
Gad M. Landau,
Uzi Vishkin:
Efficient Pattern Matching with Scaling.
SODA 1990: 344-357 |
7 | | 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 |
6 | | Amihood Amir,
Nick Roussopoulos:
Optimal view caching.
Inf. Syst. 15(2): 169-171 (1990) |
1988 |
5 | | Amihood Amir,
William I. Gasarch:
Polynomial Terse Sets
Inf. Comput. 77(1): 37-56 (1988) |
1987 |
4 | | Amihood Amir,
Dov M. Gabbay:
Preservation of Expressive Completeness in Temporal Models
Inf. Comput. 72(1): 66-83 (1987) |
3 | | Amihood Amir:
Expressive Completeness Failure in Branching Time Structures.
J. Comput. Syst. Sci. 34(1): 27-42 (1987) |
2 | | Amihood Amir:
Expressive Completeness Failure in Branching Time Structures.
J. Comput. Syst. Sci. 34(1): 27-42 (1987) |
1985 |
1 | | Amihood Amir:
Separation in Nonlinear Time Models
Information and Control 66(3): 177-203 (1985) |