Hans Zantema - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged rewriting

Degrees of Undecidability in Term RewritingJÃ¶rg Endrullis, Herman Geuvers, Hans Zantema. csl 2009: 255-270 [doi]

Rewriting Techniques and Applications, 20th International Conference, RTA 2009, Brasília, Brazil, June 29 - July 1, 2009, ProceedingsRalf Treinen, editor, Volume 5595 of Lecture Notes in Computer Science, Springer, 2009. [doi]

Matrix Interpretations for Proving Termination of Term RewritingJörg Endrullis, Johannes Waldmann, Hans Zantema. JAR, 40(2-3):195-220, 2008. [doi]

Certification of Proving Termination of Term Rewriting by Matrix InterpretationsAdam Koprowski, Hans Zantema. sofsem 2008: 328-339 [doi]

Adding constants to string rewritingRené Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp. aaecc, 19(1):27-38, 2008. [doi]

On tree automata that certify termination of left-linear term rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. iandc, 205(4):512-534, 2007. [doi]

Dynamic Multilevel Graph VisualizationTodd L. Veldhuizen. corr, abs/0712.1549, 2007. [doi]

Bytecode Rewriting in TomEmilie Balland, Pierre-Etienne Moreau, Antoine Reilles. ENTCS, 190(1):19-33, 2007. [doi]

Automation of Recursive Path Ordering for Infinite Labelled Rewrite SystemsAdam Koprowski, Hans Zantema. cade 2006: 332-346 [doi]

Matrix Interpretations for Proving Termination of Term RewritingJörg Endrullis, Johannes Waldmann, Hans Zantema. cade 2006: 574-588 [doi]

Reducibility of gene patterns in ciliates using the breakpoint graphRobert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg. TCS, 356(1-2):26-45, 2006. [doi]

Proving Liveness with Fairness Using RewritingAdam Koprowski, Hans Zantema. frocos 2005: 232-247 [doi]

Generalized Innermost RewritingJaco van de Pol, Hans Zantema. RTA 2005: 2-16 [doi]

On Tree Automata that Certify Termination of Left-Linear Term Rewriting SystemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. RTA 2005: 353-367 [doi]

Finding finite automata that certify termination of string rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. ijfcs, 16(3):471-486, 2005. [doi]

Termination of String Rewriting Proved AutomaticallyHans Zantema. JAR, 34(2):105-139, 2005. [doi]

Multi-way spatial join selectivity for the ring join graphJun-Ki Min, Ho-Hyun Park, Chin-Wan Chung. INFSOF, 47(12):785-795, 2005. [doi]

Finding Finite Automata That Certify Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. wia 2004: 134-145 [doi]

TORPA: Termination of Rewriting Proved AutomaticallyHans Zantema. RTA 2004: 95-104 [doi]

Hermitian matrices and graphs: singular values and discrepancyBéla Bollobás, Vladimir Nikiforov. DM, 285(1-3):17-32, 2004. [doi]

Liveness in RewritingJürgen Giesl, Hans Zantema. RTA 2003: 321-336 [doi]

Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, ProceedingsRobert Nieuwenhuis, editor, Volume 2706 of Lecture Notes in Computer Science, Springer, 2003.

Associative-Commutative Rewriting on Large TermsSteven Eker. RTA 2003: 14-29 [doi]

Relative Undecidability in Term Rewriting: I. The Termination HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):101-131, 2002. [doi]

Relative Undecidability in Term Rewriting: II. The Confluence HierarchyAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. iandc, 178(1):132-148, 2002. [doi]

The Termination Hierarchy for Term RewritingHans Zantema. aaecc, 12(1/2):3-19, 2001. [doi]

A rewriting approach to binary decision diagramsHans Zantema, Jaco van de Pol. jlp, 49(1-2):61-86, 2001.

Drawing Graphs on the TorusWilliam Kocay, Daniel Neilson, Ryan Szypowski. arscom, 59, 2001.

Binary Decision Diagrams by Shard RewritingJaco van de Pol, Hans Zantema. mfcs 2000: 609-618 [doi]

Rewriting Techniques and Applications, 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000, ProceedingsLeo Bachmair, editor, Volume 1833 of Lecture Notes in Computer Science, Springer, 2000.

Non-looping string rewritingAlfons Geser, Hans Zantema. ita, 33(3):279-302, 1999.

Neighborhood conditions for balanced independent sets in bipartite graphsDenise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz. DM, 181(1-3):31-36, 1998. [doi]

Within ARM s Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite SystemsWan Fokkink, Jasper Kamperman, Pum Walters. TOPLAS, 20(3):679-706, 1998. [doi]

Termination of Context-Sensitive RewritingHans Zantema. RTA 1997: 172-186

Simple Termination of Rewrite SystemsAart Middeldorp, Hans Zantema. TCS, 175(1):127-158, 1997. [doi]

Relative Undecidability in the Termination Hierarchy of Single Rewrite RulesAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. tapsoft 1997: 237-248

on Global Dynamics of Optimal Graph ReductionJulia L. Lawall, Harry G. Mairson. ICFP 1997: 188-195

Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. aaecc, 7(2):133-162, 1996. [doi]

Relative Undecidability in Term RewritingAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema. csl 1997: 150-166

Graph Drawing, Symposium on Graph Drawing, GD 95, Passau, Germany, September 20-22, 1995, ProceedingsFranz-Josef Brandenburg, editor, Volume 1027 of Lecture Notes in Computer Science, Springer, 1996.

Rewrite Systems for Integer ArithmeticH. R. Walters, Hans Zantema. RTA 1995: 324-338

Termination of Term Rewriting by Semantic LabellingHans Zantema. FUIN, 24(1/2):89-105, 1995.

Total Termination of Term Rewriting is UndecidableHans Zantema. JSC, 20(1):43-60, 1995.

Termination of Term Rewriting: Interpretation and Type EliminationHans Zantema. JSC, 17(1):23-50, 1994.

On m-centers in P::t::-free graphsOdile Favaron, Jean-Luc Fouquet. DM, 125(1-3):147-152, 1994. [doi]

Total Termination of Term RewritingMaria C. F. Ferreira, Hans Zantema. RTA 1993: 213-227

Graph TypesNils Klarlund, Michael I. Schwartzbach. POPL 1993: 196-205

Type Removal in Term RewritingHans Zantema. ctrs 1993: 148-154

Termination of Term Rewriting by InterpretationHans Zantema. ctrs 1993: 155-167

When m vertices in a k-connected graph cannot be walked round along a simple cycleAlexander K. Kelmans, M. V. Lomonosov. DM, 38(2-3):317-322, 1982. [doi]

runs on WebDSL