( en | de | ru )

 

Disambiguation of "Amir, Amihood"

Author of the publication

copydeleteadd this publication to your clipboard
Property Matching and Weighted Matching.

, , , , and . CPM, volume 4009 of Lecture Notes in Computer Science, page 188-199. Springer, (2006)

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

Mansoor Anwer Ismail Amir

 

Other publications of authors with the same name

Approximate String Matching with Stuck Address Bits., , , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 395-405. Springer, (2010)Multidimensional Period Recovery., , , , and . SPIRE, volume 12303 of Lecture Notes in Computer Science, page 115-130. Springer, (2020)An Improved Deterministic Algorithm for Generating Different Many-Element Random Samples., and . Inf. Process. Lett., 62 (2): 95-101 (1997)Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing., , , , , and . SIAM J. Comput., 43 (4): 1396-1416 (2014)Mind the Gap! - Online Dictionary Matching with One Gap., , , , , and . Algorithmica, 81 (6): 2123-2157 (2019)Weighted Shortest Common Supersequence., , and . SPIRE, volume 7024 of Lecture Notes in Computer Science, page 44-54. Springer, (2011)Approximate Period Detection and Correction., and . SPIRE, volume 7608 of Lecture Notes in Computer Science, page 1-15. Springer, (2012)Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on Run-Length Encoded Strings., , , , , and . SPIRE, volume 8799 of Lecture Notes in Computer Science, page 45-51. Springer, (2014)Range LCP Queries Revisited., , and . SPIRE, volume 9309 of Lecture Notes in Computer Science, page 350-361. Springer, (2015)Period recovery of strings over the Hamming and edit distances., , , and . Theor. Comput. Sci., (2018)