Author of the publication

Decision trees for entity identification: approximation algorithms and hardness results.

, , , , and . PODS, page 53-62. ACM, (2007)

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.

 

Other publications of authors with the same name

Decision trees for entity identification: approximation algorithms and hardness results., , , , and . PODS, page 53-62. ACM, (2007)On the Complexity of Join Predicates., , , and . PODS, ACM, (2001)Finding Irrefutable Certificates for S2p via Arthur and Merlin., and . STACS, volume 1 of LIPIcs, page 157-168. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)Scheduling Resources for Throughput Maximization., , , , and . APPROX-RANDOM, volume 6845 of Lecture Notes in Computer Science, page 111-122. Springer, (2011)Maximizing throughput of jobs with multiple resource requirements., , , and . HiPC, page 1-9. IEEE Computer Society, (2011)Mapping strategies for the PERCS architecture., , , , , and . HiPC, page 1-10. IEEE Computer Society, (2012)SMS based Interface for FAQ Retrieval., , , , and . ACL/IJCNLP, page 852-860. The Association for Computer Linguistics, (2009)Reusable Resource Scheduling via Colored Interval Covering., , , , and . IPDPS, page 1003-1012. IEEE Computer Society, (2016)Scalable Single Source Shortest Path Algorithms for Massively Parallel Systems., , , and . IPDPS, page 889-901. IEEE Computer Society, (2014)Scheduling Resources for Executing a Partial Set of Jobs., , , and . FSTTCS, volume 18 of LIPIcs, page 199-210. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)