PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Schneider-Kamp, Peter"

Author of the publication

copydeleteadd this publication to your clipboard
When Six Gates are Not Enough.

, , , and . CoRR, (2015)

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.

Prof. iR Ph. D. Johan Kamp University of Stuttgart

Elke Peter University of Stuttgart

Bernd Peters University of Stuttgart

Alexander Peter University of Stuttgart

Sarah Peter University of Stuttgart

 

Other publications of authors with the same name

Static termination analysis for prolog using term rewriting and SAT solving.. RWTH Aachen University, (2008)Automated termination proofs for logic programs by term rewriting., , , and . ACM Trans. Comput. Log., 11 (1): 2:1-2:52 (2009)Sorting nine inputs requires twenty-five comparisons., , , and . J. Comput. Syst. Sci., 82 (3): 551-563 (2016)Sorting Networks: the End Game., , and . CoRR, (2014)repAIrC: A Tool for Ensuring Data Consistency by Means of Active Integrity Constraints., , , , , and . CoRR, (2015)Polytool: polynomial interpretations as a basis for termination analysis of Logic programs, , , and . CoRR, (2009)Mechanizing and Improving Dependency Pairs., , , and . J. Autom. Reasoning, 37 (3): 155-203 (2006)Analyzing Program Termination and Complexity Automatically with AProVE., , , , , , , , , and 3 other author(s). J. Autom. Reasoning, 58 (1): 3-31 (2017)Improving Context-Sensitive Dependency Pairs., , , , , , , and . LPAR, volume 5330 of Lecture Notes in Computer Science, page 636-651. Springer, (2008)SAT Solving for Termination Analysis with Polynomial Interpretations., , , , , and . SAT, volume 4501 of Lecture Notes in Computer Science, page 340-354. Springer, (2007)