( en | de | ru )

 

Disambiguation of "Amir, Amihood"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Randomized Dictionary Matching Algorithms (Extended Abstract).

, , and . CPM, volume 644 of Lecture Notes in Computer Science, page 262-275. Springer, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Patrick Amihood

Manutschehr Amirfeyz

Iradj Amirzadeh-Asl

Mahmud Amirian-Khaffadjeh

Belal Amireh

 

Other publications of authors with the same name

On Representations of Ternary Order Relations in Numeric Strings., , , , and . Math. Comput. Sci., 11 (2): 127-136 (2017)Faster algorithms for string matching with k mismatches., , and . J. Algorithms, 50 (2): 257-275 (2004)On the Cost of Interchange Rearrangement in Strings., , , , and . SIAM J. Comput., 39 (4): 1444-1461 (2009)Cartesian Tree Matching and Indexing., , , and . CPM, volume 128 of LIPIcs, page 16:1-16:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Can We Recover the Cover?., , , , and . CPM, volume 78 of LIPIcs, page 25:1-25:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Two-Dimensional Maximal Repetitions., , , and . ESA, volume 112 of LIPIcs, page 2:1-2:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Efficient Two-Dimensional Compressed Matching., and . Data Compression Conference, page 279-288. IEEE Computer Society, (1992)Dynamic and Internal Longest Common Substring., , , and . Algorithmica, 82 (12): 3707-3743 (2020)Double String Tandem Repeats., , , , and . Algorithmica, 85 (1): 170-187 (2023)Towards a real time algorithm for parameterized longest common prefix computation., and . Theor. Comput. Sci., (2021)