Author of the publication

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

Two-phase Algorithms for the Parametric Shortest Path Problem., , , and . STACS, volume 5 of LIPIcs, page 167-178. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2010)Query Complexity Lower Bounds for Reconstruction of Codes., , and . ICS, page 264-274. Tsinghua University Press, (2011)Some properties are not even partially testable., , and . Electron. Colloquium Comput. Complex., (2013)Query Complexity Lower Bounds for Reconstruction of Codes., , and . Electron. Colloquium Comput. Complex., (2010)Ordered Graph Limits and Their Applications., , , and . ITCS, volume 185 of LIPIcs, page 42:1-42:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Earthmover Resilience and Testing in Ordered Structures., and . CCC, volume 102 of LIPIcs, page 18:1-18:35. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Extensions and Limits of the Specker-Blatter Theorem., and . CSL, volume 288 of LIPIcs, page 26:1-26:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Query Complexity of Testing Orientations for Being Eulerian., , , , and . APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, page 402-415. Springer, (2008)Testing versus estimation of graph properties., and . STOC, page 138-146. ACM, (2005)Query Complexity Lower Bounds for Reconstruction of Codes., , and . Theory of Computing, (2014)