Johannes Waldmann

From MaRDI portal
Revision as of 03:05, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:703574

Available identifiers

zbMath Open waldmann.johannesMaRDI QIDQ703574

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50890232022-07-18Paper
https://portal.mardi4nfdi.de/entity/Q50153792021-12-07Paper
Matrix Interpretations on Polyhedral Domains.2017-07-12Paper
https://portal.mardi4nfdi.de/entity/Q29583782017-02-01Paper
Termination Competition (termCOMP 2015)2015-12-02Paper
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations2012-10-19Paper
POLYNOMIALLY BOUNDED MATRIX INTERPRETATIONS2012-04-25Paper
Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems2011-07-08Paper
https://portal.mardi4nfdi.de/entity/Q30771872011-02-22Paper
https://portal.mardi4nfdi.de/entity/Q30771912011-02-22Paper
Local Termination: theory and practice2010-09-21Paper
Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)2010-01-18Paper
Automatic Termination2009-06-30Paper
Local Termination2009-06-30Paper
Matrix Interpretations for Proving Termination of Term Rewriting2009-03-12Paper
Termination of String Rewriting with Matrix Interpretations2008-09-25Paper
Arctic Termination ...Below Zero2008-08-28Paper
https://portal.mardi4nfdi.de/entity/Q35152272008-07-29Paper
Matrix interpretations for proving termination of term rewriting2008-06-11Paper
Termination by Quasi-periodic Interpretations2008-01-02Paper
Mathematical Foundations of Computer Science 20032007-12-07Paper
On tree automata that certify termination of left-linear term rewriting systems2007-04-16Paper
Termination proofs for string rewriting systems via inverse match-bounds2006-11-17Paper
Term Rewriting and Applications2005-11-11Paper
Implementation and Application of Automata2005-08-17Paper
FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS2005-08-01Paper
Match-bounded string rewriting systems2005-02-09Paper
Deleting string rewriting systems preserve regularity2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q48087442004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47379202004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44520742004-02-11Paper
The combinator S2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q42157651998-10-27Paper
https://portal.mardi4nfdi.de/entity/Q38387661998-10-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Johannes Waldmann