default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRené Thiemann
Person information
SPARQL queries 
🛈 Please note that only 56% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j61]René Thiemann:
A Preprocessor for Linear Diophantine Equalities and Inequalities. Arch. Formal Proofs 2024 (2024)- [j60]René Thiemann, Fabian Mitterwallner, Aart Middeldorp:
Undecidability Results on Orienting Single Rewrite Rules. Arch. Formal Proofs 2024 (2024) - [j59]René Thiemann, Akihisa Yamada:
Verifying a Decision Procedure for Pattern Completeness. Arch. Formal Proofs 2024 (2024) - [j58]Akihisa Yamada, René Thiemann:
Sorted Terms. Arch. Formal Proofs 2024 (2024) - [c58]Nao Hirokawa, Dohan Kim
, Kiraku Shintani, René Thiemann:
Certification of Confluence- and Commutation-Proofs via Parallel Critical Pairs. CPP 2024: 147-161 - [c57]René Thiemann, Akihisa Yamada:
A Verified Algorithm for Deciding Pattern Completeness. FSCD 2024: 27:1-27:17 - [c56]Fabian Mitterwallner, Aart Middeldorp, René Thiemann:
Linear Termination is Undecidable. LICS 2024: 57:1-57:12 - 2023
- [j57]René Thiemann, Elias Wenninger:
A Verified Efficient Implementation of the Weighted Path Order. Arch. Formal Proofs 2023 (2023) - [e2]Adam Naumowicz, René Thiemann:
14th International Conference on Interactive Theorem Proving, ITP 2023, July 31 to August 4, 2023, Białystok, Poland. LIPIcs 268, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-284-6 [contents] - [i15]René Thiemann, Elias Wenninger:
A Verified Efficient Implementation of the Weighted Path Order. CoRR abs/2307.14671 (2023) - [i14]Fabian Mitterwallner, Aart Middeldorp, René Thiemann:
Linear Termination over N is Undecidable. CoRR abs/2307.14805 (2023) - 2022
- [j56]Christian Dalvit, René Thiemann:
A Verified Translation of Multitape Turing Machines into Singletape Turing Machines. Arch. Formal Proofs 2022 (2022) - [j55]René Thiemann:
Duality of Linear Programming. Arch. Formal Proofs 2022 (2022) - [j54]René Thiemann:
Clique is not solvable by monotone circuits of polynomial size. Arch. Formal Proofs 2022 (2022) - [j53]René Thiemann, Lukas Schmidinger:
The Generalized Multiset Ordering is NP-Complete. Arch. Formal Proofs 2022 (2022) - [j52]Jose Divasón, René Thiemann:
A Formalization of the Smith Normal Form in Higher-Order Logic. J. Autom. Reason. 66(4): 1065-1095 (2022) - [j51]Jose Divasón, René Thiemann:
Correction to: A Formalization of the Smith Normal Form in Higher-Order Logic. J. Autom. Reason. 66(4): 1097 (2022) - 2021
- [j50]Ralph Bottesch, Jose Divasón, René Thiemann:
Two algorithms based on modular arithmetic: lattice basis reduction and Hermite normal form computation. Arch. Formal Proofs 2021 (2021) - [j49]Manuel Eberl, René Thiemann:
Factorization of Polynomials with Algebraic Coefficients. Arch. Formal Proofs 2021 (2021) - [j48]Alexander Lochmann, Bertram Felgenhauer, Christian Sternagel, René Thiemann, Thomas Sternagel:
Regular Tree Relations. Arch. Formal Proofs 2021 (2021) - [j47]Christian Sternagel, René Thiemann, Akihisa Yamada:
A Formalization of Weighted Path Orders and Recursive Path Orders. Arch. Formal Proofs 2021 (2021) - [j46]René Thiemann:
The Sunflower Lemma of Erdős and Rado. Arch. Formal Proofs 2021 (2021) - [j45]René Thiemann:
Solving Cubic and Quartic Equations. Arch. Formal Proofs 2021 (2021) - [j44]René Thiemann:
A Perron-Frobenius theorem for deciding matrix growth. J. Log. Algebraic Methods Program. 123: 100699 (2021) - [c55]Max W. Haslbeck, René Thiemann:
An Isabelle/HOL formalization of AProVE's termination method for LLVM IR. CPP 2021: 238-249 - 2020
- [j43]Christian Sternagel, René Thiemann:
A Formalization of Knuth-Bendix Orders. Arch. Formal Proofs 2020 (2020) - [j42]Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
A Verified Implementation of Algebraic Numbers in Isabelle/HOL. J. Autom. Reason. 64(3): 363-389 (2020) - [j41]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
A Verified Implementation of the Berlekamp-Zassenhaus Factorization Algorithm. J. Autom. Reason. 64(4): 699-735 (2020) - [j40]René Thiemann, Ralph Bottesch, Jose Divasón, Max W. Haslbeck, Sebastiaan J. C. Joosten, Akihisa Yamada:
Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL. J. Autom. Reason. 64(5): 827-856 (2020) - [c54]René Thiemann, Jonas Schöpf, Christian Sternagel, Akihisa Yamada:
Certifying the Weighted Path Order (Invited Talk). FSCD 2020: 4:1-4:20 - [c53]Ralph Bottesch, Max W. Haslbeck, Alban Reynaud, René Thiemann:
Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL. NFM 2020: 233-250
2010 – 2019
- 2019
- [j39]Ralph Bottesch, Max W. Haslbeck, René Thiemann:
Farkas' Lemma and Motzkin's Transposition Theorem. Arch. Formal Proofs 2019 (2019) - [j38]Ralph Bottesch, Alban Reynaud, René Thiemann:
Linear Inequalities. Arch. Formal Proofs 2019 (2019) - [j37]Vivek Nigam, René Thiemann:
Logical and Semantic Frameworks with Applications. Theor. Comput. Sci. 781: 1-2 (2019) - [c52]Ralph Bottesch, Max W. Haslbeck, René Thiemann:
Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL. FroCos 2019: 223-239 - 2018
- [j36]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
A verified LLL algorithm. Arch. Formal Proofs 2018 (2018) - [j35]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
A verified factorization algorithm for integer polynomials with polynomial complexity. Arch. Formal Proofs 2018 (2018) - [j34]Filip Maric, Mirko Spasic, René Thiemann:
An Incremental Simplex Algorithm with Unsatisfiable Core Generation. Arch. Formal Proofs 2018 (2018) - [j33]Christian Sternagel, René Thiemann:
First-Order Terms. Arch. Formal Proofs 2018 (2018) - [c51]Jose Divasón, Sebastiaan J. C. Joosten, Ondrej Kuncar, René Thiemann, Akihisa Yamada:
Efficient certification of complexity proofs: formalizing the Perron-Frobenius theorem (invited talk paper). CPP 2018: 2-13 - [c50]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
A Formalization of the LLL Basis Reduction Algorithm. ITP 2018: 160-177 - [c49]René Thiemann:
Extending a Verified Simplex Algorithm. LPAR (Workshop and Short Papers) 2018: 37-48 - [c48]Ralph Bottesch, Max W. Haslbeck, René Thiemann:
A Verified Efficient Implementation of the LLL Basis Reduction Algorithm. LPAR 2018: 164-180 - 2017
- [j32]Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
Subresultants. Arch. Formal Proofs 2017 (2017) - [j31]René Thiemann:
Stochastic Matrices and the Perron-Frobenius Theorem. Arch. Formal Proofs 2017 (2017) - [j30]Bertram Felgenhauer, René Thiemann:
Reachability, confluence, and termination analysis with state-compatible automata. Inf. Comput. 253: 467-483 (2017) - [j29]Jürgen Giesl, Cornelius Aschermann, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Jera Hensel, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, René Thiemann:
Analyzing Program Termination and Complexity Automatically with AProVE. J. Autom. Reason. 58(1): 3-31 (2017) - [c47]Marc Brockschmidt, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
Certifying Safety and Termination Proofs for Integer Transition Systems. CADE 2017: 454-471 - [c46]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
A formalization of the Berlekamp-Zassenhaus factorization algorithm. CPP 2017: 17-29 - [c45]Julian Biendarra, Jasmin Christian Blanchette, Aymeric Bouzy, Martin Desharnais, Mathias Fleury, Johannes Hölzl, Ondrej Kuncar, Andreas Lochbihler, Fabian Meier, Lorenz Panny, Andrei Popescu, Christian Sternagel, René Thiemann, Dmitriy Traytel:
Foundational (Co)datatypes and (Co)recursion for Higher-Order Logic. FroCoS 2017: 3-21 - 2016
- [j28]Jose Divasón, Sebastiaan J. C. Joosten, René Thiemann, Akihisa Yamada:
The Factorization Algorithm of Berlekamp and Zassenhaus. Arch. Formal Proofs 2016 (2016) - [j27]Jose Divasón, Ondrej Kuncar, René Thiemann, Akihisa Yamada:
Perron-Frobenius Theorem for Spectral Radius Analysis. Arch. Formal Proofs 2016 (2016) - [j26]René Thiemann, Akihisa Yamada:
Polynomial Factorization. Arch. Formal Proofs 2016 (2016) - [j25]René Thiemann, Akihisa Yamada:
Polynomial Interpolation. Arch. Formal Proofs 2016 (2016) - [c44]René Thiemann, Akihisa Yamada:
Formalizing jordan normal forms in Isabelle/HOL. CPP 2016: 88-99 - [c43]Akihisa Yamada, Christian Sternagel, René Thiemann, Keiichirou Kusakari:
AC Dependency Pairs Revisited. CSL 2016: 8:1-8:16 - [c42]René Thiemann, Akihisa Yamada:
Algebraic Numbers in Isabelle/HOL. ITP 2016: 391-408 - [e1]Mario R. F. Benevides, René Thiemann:
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, LSFA 2015, Natal, Brazil, August 31 - September 1, 2015. Electronic Notes in Theoretical Computer Science 323, Elsevier 2016 [contents] - 2015
- [j24]Christian Sternagel, René Thiemann:
Deriving class instances for datatypes. Arch. Formal Proofs 2015 (2015) - [j23]René Thiemann, Akihisa Yamada:
Algebraic Numbers in Isabelle/HOL. Arch. Formal Proofs 2015 (2015) - [j22]René Thiemann, Akihisa Yamada:
Matrices, Jordan Normal Forms, and Spectral Radius Theory. Arch. Formal Proofs 2015 (2015) - [c41]Jürgen Giesl, Frédéric Mesnard, Albert Rubio, René Thiemann, Johannes Waldmann:
Termination Competition (termCOMP 2015). CADE 2015: 105-108 - [c40]Sarah Winkler, René Thiemann:
Formalizing Soundness and Completeness of Unravelings. FroCos 2015: 239-255 - [c39]Christian Sternagel, René Thiemann:
Deriving Comparators and Show Functions in Isabelle/HOL. ITP 2015: 421-437 - [c38]Martin Avanzini, Christian Sternagel, René Thiemann:
Certification of Complexity Proofs using CeTA. RTA 2015: 23-39 - [c37]Mario R. F. Benevides, René Thiemann:
Preface. LSFA 2015: 1-2 - [i13]Julian Nagele, René Thiemann:
Certification of Confluence Proofs using CeTA. CoRR abs/1505.01337 (2015) - 2014
- [j21]Christian Sternagel, René Thiemann:
Haskell's Show-Class in Isabelle/HOL. Arch. Formal Proofs 2014 (2014) - [j20]Christian Sternagel, René Thiemann:
XML. Arch. Formal Proofs 2014 (2014) - [j19]Christian Sternagel, René Thiemann:
Certification Monads. Arch. Formal Proofs 2014 (2014) - [j18]René Thiemann:
Implementing field extensions of the form Q[sqrt(b)]. Arch. Formal Proofs 2014 (2014) - [j17]René Thiemann:
Mutually Recursive Partial Functions. Arch. Formal Proofs 2014 (2014) - [j16]René Thiemann:
Lifting Definition Option. Arch. Formal Proofs 2014 (2014) - [c36]Jürgen Giesl, Marc Brockschmidt, Fabian Emmes, Florian Frohn, Carsten Fuhs, Carsten Otto, Martin Plücker, Peter Schneider-Kamp, Thomas Ströder, Stephanie Swiderski, René Thiemann:
Proving Termination of Programs Automatically with AProVE. IJCAR 2014: 184-191 - [c35]Bertram Felgenhauer, René Thiemann:
Reachability Analysis with State-Compatible Automata. LATA 2014: 347-359 - [c34]Christian Sternagel, René Thiemann:
Formalizing Monotone Algebras for Certification of Termination and Complexity Proofs. RTA-TLCA 2014: 441-455 - [c33]Julian Nagele, René Thiemann, Sarah Winkler:
Certification of Nontermination Proofs Using Strategies and Nonlooping Derivations. VSTTE 2014: 216-232 - [c32]Christian Sternagel, René Thiemann:
The Certification Problem Format. UITP 2014: 61-72 - [c31]Christian Sternagel, René Thiemann:
A Framework for Developing Stand-Alone Certifiers. LSFA 2014: 51-67 - 2013
- [j15]René Thiemann:
Computing Square Roots using the Babylonian Method. Arch. Formal Proofs 2013 (2013) - [c30]René Thiemann:
Formalizing Bounded Increase. ITP 2013: 245-260 - [c29]Christian Sternagel, René Thiemann:
Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion. RTA 2013: 287-302 - 2012
- [j14]René Thiemann:
Executable Transitive Closures. Arch. Formal Proofs 2012 (2012) - [j13]René Thiemann:
Generating linear orders for datatypes. Arch. Formal Proofs 2012 (2012) - [j12]Michael Codish, Jürgen Giesl, Peter Schneider-Kamp, René Thiemann:
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs. J. Autom. Reason. 49(1): 53-93 (2012) - [c28]Christian Sternagel, René Thiemann:
Certification of Nontermination Proofs. ITP 2012: 266-282 - [c27]René Thiemann, Guillaume Allais, Julian Nagele:
On the Formalization of Termination Techniques based on Multiset Orderings. RTA 2012: 339-354 - [i12]Christian Sternagel, René Thiemann, Sarah Winkler, Harald Zankl:
CeTA - A Tool for Certified Termination Analysis. CoRR abs/1208.1591 (2012) - [i11]Christian Sternagel, René Thiemann:
Certification extends Termination Techniques. CoRR abs/1208.1594 (2012) - [i10]Christian Sternagel, René Thiemann:
A Relative Dependency Pair Framework. CoRR abs/1208.1595 (2012) - [i9]Thomas Sternagel, René Thiemann, Harald Zankl, Christian Sternagel:
Recording Completion for Finding and Certifying Proofs in Equational Logic. CoRR abs/1208.1597 (2012) - [i8]René Thiemann:
Towards the Certification of Complexity Proofs. CoRR abs/1208.1609 (2012) - 2011
- [j11]Christian Sternagel, René Thiemann:
Executable Transitive Closures of Finite Relations. Arch. Formal Proofs 2011 (2011) - [j10]Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann:
Automated termination proofs for haskell by term rewriting. ACM Trans. Program. Lang. Syst. 33(2): 7:1-7:39 (2011) - [c26]Christian Sternagel, René Thiemann:
Generalized and Formalized Uncurrying. FroCoS 2011: 243-258 - [c25]Alexander Krauss, Christian Sternagel, René Thiemann, Carsten Fuhs, Jürgen Giesl:
Termination of Isabelle Functions via Termination of Rewriting. ITP 2011: 152-167 - [c24]Christian Sternagel, René Thiemann:
Modular and Certified Semantic Labeling and Unlabeling. RTA 2011: 329-344 - 2010
- [j9]Christian Sternagel, René Thiemann:
Abstract Rewriting. Arch. Formal Proofs 2010 (2010) - [j8]Christian Sternagel, René Thiemann:
Executable Matrix Operations on Matrices of Arbitrary Dimensions. Arch. Formal Proofs 2010 (2010) - [j7]Christian Sternagel, René Thiemann:
Executable Multivariate Polynomials. Arch. Formal Proofs 2010 (2010) - [j6]Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann:
Automated termination analysis for logic programs with cut. Theory Pract. Log. Program. 10(4-6): 365-381 (2010) - [c23]Christian Sternagel, René Thiemann:
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs. CSL 2010: 514-528 - [c22]Christian Sternagel, René Thiemann:
Certified Subterm Criterion and Certified Usable Rules. RTA 2010: 325-340 - [c21]René Thiemann, Christian Sternagel, Jürgen Giesl, Peter Schneider-Kamp:
Loops under Strategies ... Continued. IWS 2010: 51-65 - [i7]Peter Schneider-Kamp, Jürgen Giesl, Thomas Ströder, Alexander Serebrenik, René Thiemann:
Automated Termination Analysis for Logic Programs with Cut. CoRR abs/1007.4908 (2010)
2000 – 2009
- 2009
- [j5]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated termination proofs for logic programs by term rewriting. ACM Trans. Comput. Log. 11(1): 2:1-2:52 (2009) - [c20]René Thiemann, Christian Sternagel:
Loops under Strategies. RTA 2009: 17-31 - [c19]René Thiemann:
From Outermost Termination to Innermost Termination. SOFSEM 2009: 533-545 - [c18]René Thiemann, Christian Sternagel:
Certification of Termination Proofs Using CeTA. TPHOLs 2009: 452-468 - 2008
- [j4]René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp:
Adding constants to string rewriting. Appl. Algebra Eng. Commun. Comput. 19(1): 27-38 (2008) - [j3]Moritz de Greck, Michael Rotte, Rabea Paus, Diana Moritz, René Thiemann, U. Proesch, U. Bruer, S. Moerth, Claus Tempelmann, Bernhard Bogerts, Georg Northoff:
Is our self based on reward? Self-relatedness recruits neural activity in the reward system. NeuroImage 39(4): 2066-2075 (2008) - [c17]Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl, Raúl Gutiérrez, Salvador Lucas, Peter Schneider-Kamp, René Thiemann:
Improving Context-Sensitive Dependency Pairs. LPAR 2008: 636-651 - [c16]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
Maximal Termination. RTA 2008: 110-125 - [c15]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp:
Deciding Innermost Loops. RTA 2008: 366-380 - [i6]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated Termination Proofs for Logic Programs by Term Rewriting. CoRR abs/0803.0014 (2008) - 2007
- [b1]René Thiemann:
The DP framework for proving termination of term rewriting. RWTH Aachen University, Germany, 2007, pp. 1-211 - [c14]Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp:
Proving Termination by Bounded Increase. CADE 2007: 443-459 - [c13]Peter Schneider-Kamp, René Thiemann, Elena Annov, Michael Codish, Jürgen Giesl:
Proving Termination Using Recursive Path Orders and SAT Solving. FroCoS 2007: 267-282 - [c12]Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl:
SAT Solving for Termination Analysis with Polynomial Interpretations. SAT 2007: 340-354 - [c11]René Thiemann, Aart Middeldorp:
Innermost Termination of Rewrite Systems by Labeling. WRS@RDP 2007: 3-19 - [i5]Jürgen Giesl, Peter Schneider-Kamp, René Thiemann, Stephan Swiderski, Manh Thang Nguyen, Danny De Schreye, Alexander Serebrenik:
Termination of Programs using Term Rewriting and SAT Solving. Deduction and Decision Procedures 2007 - [i4]Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, Harald Zankl:
Implementing RPO and POLO using SAT. Deduction and Decision Procedures 2007 - [i3]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp:
Decision Procedures for Loop Detection. Deduction and Decision Procedures 2007 - 2006
- [j2]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Mechanizing and Improving Dependency Pairs. J. Autom. Reason. 37(3): 155-203 (2006) - [c10]Jürgen Giesl, Peter Schneider-Kamp, René Thiemann:
Automatic Termination Proofs in the Dependency Pair Framework. IJCAR 2006: 281-286 - [c9]Peter Schneider-Kamp, Jürgen Giesl, Alexander Serebrenik, René Thiemann:
Automated Termination Analysis for Logic Programs by Term Rewriting. LOPSTR 2006: 177-193 - [c8]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. LPAR 2006: 30-44 - [c7]Jürgen Giesl, Stephan Swiderski, Peter Schneider-Kamp, René Thiemann:
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages. RTA 2006: 297-312 - [i2]Michael Codish, Peter Schneider-Kamp, Vitaly Lagoon, René Thiemann, Jürgen Giesl:
SAT Solving for Argument Filterings. CoRR abs/cs/0605074 (2006) - 2005
- [j1]René Thiemann, Jürgen Giesl:
The size-change principle and dependency pairs for termination of term rewriting. Appl. Algebra Eng. Commun. Comput. 16(4): 229-270 (2005) - [c6]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp:
Proving and Disproving Termination of Higher-Order Functions. FroCoS 2005: 216-231 - [i1]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp:
Proving and Disproving Termination in the Dependency Pair Framework. Deduction and Applications 2005 - 2004
- [c5]René Thiemann, Jürgen Giesl, Peter Schneider-Kamp:
Improved Modular Termination Proofs Using Dependency Pairs. IJCAR 2004: 75-90 - [c4]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp:
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. LPAR 2004: 301-331 - [c3]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Automated Termination Proofs with AProVE. RTA 2004: 210-220 - 2003
- [c2]Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Improving Dependency Pairs. LPAR 2003: 167-182 - [c1]René Thiemann, Jürgen Giesl:
Size-Change Termination for Term Rewriting. RTA 2003: 264-278
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
