Adding constants to string rewritingRené Thiemann; Hans Zantema; Jürgen Giesl; Peter Schneider-Kamp · 2008

Mechanizing and Improving Dependency PairsJürgen Giesl; René Thiemann; Peter Schneider-Kamp; Stephan Falke · 2006

Automated termination proofs for haskell by term rewritingGiesl, Jürgen; Raffelsieper, Matthias; Schneider-Kamp, Peter; Swiderski, Stephan; Thiemann, René · ACM Transactions on Programming Languages and Systems · 2011

Automated termination proofs for logic programs by term rewritingSchneider-Kamp, Peter; Giesl, Jürgen; Serebrenik, Alexander; Thiemann, René · ACM Transactions on Computational Logic · 2009

Automated termination analysis for logic programs with cutSCHNEIDER-KAMP, PETER; GIESL, JÜRGEN; STRÖDER, THOMAS; SEREBRENIK, ALEXANDER; THIEMANN, RENÉ · Theory and Practice of Logic Programming · 2010

SAT Solving for Termination Proofs with Recursive Path Orders and Dependency PairsMichael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann · 2012

The effective length of subcodesJuriaan Simonis · Applicable Algebra in Engineering, Communication and Computing · 1994

PrefaceGerhard O. Michler · Applicable Algebra in Engineering, Communication and Computing · 1996

ForewordHélène Kirchner; Giorgio Levi · Applicable Algebra in Engineering, Communication and Computing · 1994

Completeness results for basic narrowingAart Middeldorp; Erik Hamoen · Applicable Algebra in Engineering, Communication and Computing · 1994

Polynomial algorithms in computer algebraFranz Winkler · Applicable Algebra in Engineering, Communication and Computing · 1996

Weil bounds for singular curvesEric Bach · Applicable Algebra in Engineering, Communication and Computing · 1996

Finding irreducible and primitive polynomialsIgor E. Shparlinski · Applicable Algebra in Engineering, Communication and Computing · 1993

Symbolic homotopy constructionJan Verschelde; Ronald Cools · Applicable Algebra in Engineering, Communication and Computing · 1993