( en | de | ru )

 

Disambiguation of "Porat, Ely"

Author of the publication

copydeleteadd this publication to your clipboard
Fast set intersection and two-patterns matching.

, and . Theor. Comput. Sci., 411 (40-42): 3795-3800 (2010)

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

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)Faster algorithms for string matching with k mismatches., , and . SODA, page 794-803. ACM/SIAM, (2000)A faster implementation of the Goemans-Williamson clustering algorithm., , , and . SODA, page 17-25. ACM/SIAM, (2001)Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract)., , and . ICALP (1), volume 6755 of Lecture Notes in Computer Science, page 557-568. Springer, (2011)Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints., and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 459-471. Springer, (2013)Function Matching: Algorithms, Applications, and a Lower Bound., , , , and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 929-942. Springer, (2003)Approximate Matching in the L1 Metric., , , and . CPM, volume 3537 of Lecture Notes in Computer Science, page 91-103. Springer, (2005)Approximate cover of strings., , , and . Theor. Comput. Sci., (2019)-1, 0, 1-APSP and (min, max)-Product Problems., , , and . CoRR, (2019)On the Hardness of Set Disjointness and Set Intersection with Bounded Universe., , and . ISAAC, volume 149 of LIPIcs, page 7:1-7:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)