default search action
Johannes Waldmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i5]Dieter Hofbauer, Johannes Waldmann:
Old and New Benchmarks for Relative Termination of String Rewrite Systems. CoRR abs/2307.14149 (2023) - 2020
- [i4]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Sparse Tiling through Overlap Closures for Termination of String Rewriting. CoRR abs/2003.01696 (2020) - [i3]Dennis Renz, Sibylle Schwarz, Johannes Waldmann:
Check Your (Students') Proofs-With Holes. CoRR abs/2009.01326 (2020)
2010 – 2019
- 2019
- [c28]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Sparse Tiling Through Overlap Closures for Termination of String Rewriting. FSCD 2019: 21:1-21:21 - [c27]Jürgen Giesl
, Albert Rubio, Christian Sternagel, Johannes Waldmann, Akihisa Yamada
The Termination and Complexity Competition. TACAS (3) 2019: 156-166 - 2018
- [i2]Johannes Waldmann:
When You Should Use Lists in Haskell (Mostly, You Should Not). CoRR abs/1808.08329 (2018) - 2017
- [c26]Johannes Waldmann:
Automatische Erzeugung und Bewertung von Aufgaben zu Algorithmen und Datenstrukturen(Generating and Grading Exercises on Algorithms and Data Structures Automatically). ABP 2017 - 2016
- [c25]Johannes Waldmann:
Efficient Completion of Weighted Automata. TERMGRAPH 2016: 55-62 - 2015
- [c24]Jürgen Giesl
Termination Competition (termCOMP 2015). CADE 2015: 105-108 - [c23]Johannes Waldmann:
Matrix Interpretations on Polyhedral Domains. RTA 2015: 318-333 - [e1]Stefan Brass, Johannes Waldmann:
Proceedings of the 28th Workshop on (Constraint) Logic Programming (WLP 2014) Proceedings of the 23rd International Workshop on Functional and (Constraint) Logic Programming, Wittenberg, Germany, September 15-17, 2014. CEUR Workshop Proceedings 1335, CEUR-WS.org 2015 [contents] - 2014
- [c22]Alexander Bau, Johannes Waldmann:
Describing and Measuring the Complexity of SAT encodings for Constraint Programs. WLP/WFLP 2014: 26-37 - [c21]Johannes Waldmann:
Automated Exercises for Constraint Programming. WLP/WFLP 2014: 66-80 - 2013
- [c20]Alexander Bau, Johannes Waldmann:
Propositional Encoding of Constraints over Tree-Shaped Data. KDPD 2013: 33-47 - [c19]Alexander Bau, Markus Lohrey, Eric Nöth, Johannes Waldmann:
Compression of Rewriting Systems for Termination Analysis. RTA 2013: 97-112 - [i1]Alexander Bau, Johannes Waldmann:
Propositional Encoding of Constraints over Tree-Shaped Data. CoRR abs/1305.4957 (2013) - 2012
- [c18]Michael Codish
Exotic Semi-Ring Constraints. SMT@IJCAR 2012: 88-97 - 2011
- [c17]Aart Middeldorp
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems. CAI 2011: 1-20 - 2010
- [j12]Jörg Endrullis, Roel C. de Vrijer, Johannes Waldmann:
Local Termination: theory and practice. Log. Methods Comput. Sci. 6(3) (2010) - [c16]Johannes Waldmann:
Polynomially Bounded Matrix Interpretations. RTA 2010: 357-372
2000 – 2009
- 2009
- [j11]Andreas Gebhardt, Johannes Waldmann:
Weighted Automata Define a Hierarchy of Terminating String Rewriting Systems. Acta Cybern. 19(2): 295-312 (2009) - [j10]Adam Koprowski, Johannes Waldmann:
Max/Plus Tree Automata for Termination of Term Rewriting. Acta Cybern. 19(2): 357-392 (2009) - [c15]Johannes Waldmann:
Automatic Termination. RTA 2009: 1-16 - [c14]Jörg Endrullis
Local Termination. RTA 2009: 270-284 - 2008
- [j9]Jörg Endrullis
Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reason. 40(2-3): 195-220 (2008) - [c13]Georg Moser, Andreas Schnabl, Johannes Waldmann:
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. FSTTCS 2008: 304-315 - [c12]Adam Koprowski, Johannes Waldmann:
Arctic Termination ...Below Zero. RTA 2008: 202-216 - 2007
- [j8]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On tree automata that certify termination of left-linear term rewriting systems. Inf. Comput. 205(4): 512-534 (2007) - [j7]Johannes Waldmann:
Weighted Automata for Proving Termination of String Rewriting. J. Autom. Lang. Comb. 12(4): 545-570 (2007) - [c11]Hans Zantema, Johannes Waldmann:
Termination by Quasi-periodic Interpretations. RTA 2007: 404-418 - 2006
- [j6]Dieter Hofbauer, Johannes Waldmann:
Termination of {aa->bc, bb->ac, cc->ab}. Inf. Process. Lett. 98(4): 156-158 (2006) - [c10]Jörg Endrullis
Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR 2006: 574-588 - [c9]Dieter Hofbauer, Johannes Waldmann:
Termination of String Rewriting with Matrix Interpretations. RTA 2006: 328-342 - 2005
- [j5]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci. 16(3): 471-486 (2005) - [j4]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. J. Autom. Reason. 34(4): 365-385 (2005) - [c8]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. RTA 2005: 353-367 - 2004
- [j3]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Match-Bounded String Rewriting Systems. Appl. Algebra Eng. Commun. Comput. 15(3-4): 149-171 (2004) - [j2]Dieter Hofbauer, Johannes Waldmann:
Deleting string rewriting systems preserve regularity. Theor. Comput. Sci. 327(3): 301-317 (2004) - [c7]Johannes Waldmann:
Matchbox: A Tool for Match-Bounded String Rewriting. RTA 2004: 85-94 - [c6]Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema:
Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145 - 2003
- [c5]Dieter Hofbauer, Johannes Waldmann:
Deleting String Rewriting Systems Preserve Regularity. Developments in Language Theory 2003: 337-348 - [c4]Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
Match-Bounded String Rewriting Systems. MFCS 2003: 449-459 - 2002
- [c3]Johannes Waldmann:
Rewrite Games. RTA 2002: 144-158 - 2001
- [c2]Gundula Niemann, Johannes Waldmann:
Some Regular Languages That Are Church-Rosser Congruential. Developments in Language Theory 2001: 330-339 - 2000
- [j1]Johannes Waldmann:
The Combinator S. Inf. Comput. 159(1-2): 2-21 (2000)
1990 – 1999
- 1998
- [b1]Johannes Waldmann:
The combinator S. University of Jena, Germany, 1998, pp. 1-118 - [c1]Johannes Waldmann:
Normalization of S-Terms is Decidable. RTA 1998: 138-150
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-04-25 05:47 CEST 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: