Author of the publication

Noisy Data Make the Partial Digest Problem NP-hard.

, , and . WABI, volume 2812 of Lecture Notes in Computer Science, page 111-123. Springer, (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.

 

Other publications of authors with the same name

On-line algorithms for the channel assignment problem in cellular networks., , and . DIAL-M, page 1-7. ACM, (2000)More Powerful and Simpler Cost-Sharing Methods., and . WAOA, volume 3351 of Lecture Notes in Computer Science, page 97-110. Springer, (2004)Sharing the Cost of Multicast Transmissions in Wireless Networks., and . SIROCCO, volume 3104 of Lecture Notes in Computer Science, page 255-266. Springer, (2004)On Computing Ad-hoc Selective Families., , , , and . RANDOM-APPROX, volume 2129 of Lecture Notes in Computer Science, page 211-222. Springer, (2001)Automated Optimal OSP Mechanisms for Set Systems - The Case of Small Domains., , , and . WINE, volume 11920 of Lecture Notes in Computer Science, page 171-185. Springer, (2019)The power of verification for one-parameter agents., , , and . J. Comput. Syst. Sci., 75 (3): 190-211 (2009)A response to "Mechanism Design with Partial Verification and Revelation Principle"., , , and . Auton. Agents Multi Agent Syst., 22 (1): 224 (2011)The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms., and . STACS, volume 3884 of Lecture Notes in Computer Science, page 337-348. Springer, (2006)Inversions from Sorting with Distance-Based Errors., and . SOFSEM, volume 10706 of Lecture Notes in Computer Science, page 508-522. Springer, (2018)On Designing Truthful Mechanisms for Online Scheduling., , , and . SIROCCO, volume 3499 of Lecture Notes in Computer Science, page 3-17. Springer, (2005)