Author of the publication

ARRIVAL: Next Stop in CLS.

, , , , , and . ICALP, volume 107 of LIPIcs, page 60:1-60:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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

Random-Edge Is Slower Than Random-Facet on Abstract Cubes., and . ICALP, volume 55 of LIPIcs, page 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games., and . CiE, volume 7921 of Lecture Notes in Computer Science, page 252-262. Springer, (2013)Subtree Isomorphism Revisited., , , , and . SODA, page 1256-1271. SIAM, (2016)Decremental Data Structures for Connectivity and Dominators in Directed Graphs., , , , and . ICALP, volume 80 of LIPIcs, page 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Improved Bounds for Facility Location Games with Fair Cost Allocation., and . COCOA, volume 5573 of Lecture Notes in Computer Science, page 174-185. Springer, (2009)Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made., , , and . STOC, page 375-388. ACM, (2016)Approximability and Parameterized Complexity of Minmax Values., , , and . WINE, volume 5385 of Lecture Notes in Computer Science, page 684-695. Springer, (2008)Faster k-SAT algorithms using biased-PPSZ., , , and . STOC, page 578-589. ACM, (2019)Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles., and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 415-426. Springer, (2010)On Acyclicity of Games with Cycles., , and . AAIM, volume 5564 of Lecture Notes in Computer Science, page 15-28. Springer, (2009)