( en | de | ru )

 

Disambiguation of "Porat, Ely"

Author of the publication

copydeleteadd this publication to your clipboard
Overlap matching.

, , , , and . Inf. Comput., 181 (1): 57-74 (2003)

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

Abdulla Elyas

Senan Elyafi-Schulz

 

Other publications of authors with the same name

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)-1, 0, 1-APSP and (min, max)-Product Problems., , , and . CoRR, (2019)Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion., , and . STACS, volume 14 of LIPIcs, page 230-241. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Explicit Nonadaptive Combinatorial Group Testing Schemes., and . IEEE Trans. Inf. Theory, 57 (12): 7982-7989 (2011)A faster implementation of the Goemans-Williamson clustering algorithm., , , and . SODA, page 17-25. ACM/SIAM, (2001)Sharing Rewards in Cooperative Connectivity Games., , and . J. Artif. Intell. Res., (2013)Real Two Dimensional Scaled Matching., , , and . WADS, volume 2748 of Lecture Notes in Computer Science, page 353-364. Springer, (2003)LTS: The List-Traversal Synopses System., , and . NGITS, volume 4032 of Lecture Notes in Computer Science, page 353-354. Springer, (2006)Approximate Matching in the L1 Metric., , , and . CPM, volume 3537 of Lecture Notes in Computer Science, page 91-103. Springer, (2005)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)