( en | de | ru )

 

Disambiguation of "Moser, Georg"

Author of the publication

copydeleteadd this publication to your clipboard
Proofs of Termination of Rewrite Systems for Polytime Functions.

, and . FSTTCS, volume 3821 of Lecture Notes in Computer Science, page 529-540. Springer, (2005)

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.

Georg Möser

Georg Moser

Georg Möser

Georg Andreas Moser

Georg-Heinrich Möser

 

Other publications of authors with the same name

Polynomial Path Orders: A Maximal Model, and . CoRR, (2012)Automated Complexity Analysis Based on the Dependency Pair Method, and . CoRR, (2011)The Hydra Battle Revisited., and . Rewriting, Computation and Proof, volume 4600 of Lecture Notes in Computer Science, page 1-27. Springer, (2007)Proofs of Termination of Rewrite Systems for Polytime Functions., and . FSTTCS, volume 3821 of Lecture Notes in Computer Science, page 529-540. Springer, (2005)Type-Based Analysis of Logarithmic Amortised Complexity., , , , and . CoRR, (2021)Derivational Complexity of Knuth-Bendix Orders Revisited.. LPAR, volume 4246 of Lecture Notes in Computer Science, page 75-89. Springer, (2006)Dependency Pairs and Polynomial Path Orders., and . RTA, volume 5595 of Lecture Notes in Computer Science, page 48-62. Springer, (2009)Automated Complexity Analysis Based on the Dependency Pair Method., and . IJCAR, volume 5195 of Lecture Notes in Computer Science, page 364-379. Springer, (2008)Leftmost Outermost Revisited., , and . RTA, volume 36 of LIPIcs, page 209-222. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)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)