( en | de | ru )

 

Disambiguation of "Porat, Ely"

Author of the publication

copydeleteadd this publication to your clipboard
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance.

, and . SOSA, volume 61 of OASIcs, page 10:1-10:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

Ely Garcia

Pamela Ely

Philip Ely

Senan Elyafi-Schulz

Abdulla Elyas

 

Other publications of authors with the same name

Faster algorithms for string matching with k mismatches., , and . SODA, page 794-803. ACM/SIAM, (2000)Toward Real Time Internet Traffic Monitoring., and . Web Intelligence and Security - Advances in Data and Text Mining Techniques for Detecting and Preventing Terrorist Activities on the Web, volume 27 of NATO Science for Peace and Security Series - D: Information and Communication Security, IOS Press, (2010)A faster implementation of the Goemans-Williamson clustering algorithm., , , and . SODA, page 17-25. ACM/SIAM, (2001)Polynomials: a new tool for length reduction in binary discrete convolutions., , , and . CoRR, (2014)Fast Set Intersection and Two Patterns Matching, and . CoRR, (2009)Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets., , , and . CoRR, (2014)Explicit Non-Adaptive Combinatorial Group Testing Schemes, and . CoRR, (2007)Improved Deterministic Length Reduction, , , , and . CoRR, (2008)Approximate String Matching with Stuck Address Bits., , , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 395-405. Springer, (2010)Explicit Non-Adaptive Combinatorial Group Testing Schemes., and . Search Methodologies, volume 09281 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)