Author of the publication

On the Hardness of Analyzing Quantum Programs Quantitatively.

, , , and . ESOP (2), volume 14577 of Lecture Notes in Computer Science, page 31-58. Springer, (2024)

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

Automated Complexity Analysis Based on the Dependency Pair Method, and . CoRR, (2011)Dependency Pairs and Polynomial Path Orders., and . RTA, volume 5595 of Lecture Notes in Computer Science, page 48-62. Springer, (2009)The Hydra Battle Revisited., and . Rewriting, Computation and Proof, volume 4600 of Lecture Notes in Computer Science, page 1-27. Springer, (2007)Derivational Complexity of Knuth-Bendix Orders Revisited.. LPAR, volume 4246 of Lecture Notes in Computer Science, page 75-89. Springer, (2006)Proofs of Termination of Rewrite Systems for Polytime Functions., and . FSTTCS, volume 3821 of Lecture Notes in Computer Science, page 529-540. Springer, (2005)Polynomial Path Orders: A Maximal Model, and . CoRR, (2012)Automated Complexity Analysis Based on the Dependency Pair Method., and . IJCAR, volume 5195 of Lecture Notes in Computer Science, page 364-379. Springer, (2008)A Path Order for Rewrite Systems that Compute Exponential Time Functions., , and . RTA, volume 10 of LIPIcs, page 123-138. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)A Combination Framework for Complexity., and . RTA, volume 21 of LIPIcs, page 55-70. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Leftmost Outermost Revisited., , and . RTA, volume 36 of LIPIcs, page 209-222. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)