DBLP: Hans Zantema

	2013
c46		Sebastiaan J. C. Joosten, Hans Zantema: Relaxation of 3-partition instances. CTW 2013: 133-136
	2012
j33		Aaron Stump, Hans Zantema, Garrin Kimmell, Roba El Haj Omar: A Rewriting View of Simple Typing. Logical Methods in Computer Science 9(1) (2012)
c45		Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema: Cinderella versus the Wicked Stepmother. IFIP TCS 2012: 57-71
c44		Vincent van Oostrom, Hans Zantema: Triangulation in Rewriting. RTA 2012: 240-255
c43		Erik P. de Vink, Hans Zantema, Dragan Bosnacki: Combining Insertion and Deletion in RNA-editing Preserves Regularity. MeCBIC 2012: 48-62
	2011
j32		Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema: Levels of undecidability in rewriting. Inf. Comput. 209(2): 227-245 (2011)
j31		Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema: Long-run order-independence of vector-based transition systems. IET Computers & Digital Techniques 5(6): 468-478 (2011)
c42		Hans Zantema, Jörg Endrullis: Proving Equality of Streams Automatically. RTA 2011: 393-408
c41		Hans Zantema: Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic. WRS 2011: 69-76
	2010
j30		M. Mousazadeh, B. T. Ladani, Hans Zantema: Liveness Verification in TRSs Using Tree Automata and Termination Analysis. Computing and Informatics 29(3): 407-426 (2010)
j29		Hans Zantema: Well-definedness of Streams by Transformation and Termination. Logical Methods in Computer Science 6(3) (2010)
j28		Olga Tveretina, Carsten Sinz, Hans Zantema: Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. JSAT 7(1): 35-58 (2010)
c40		Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema: Order-Independence of Vector-Based Transition Systems. ACSD 2010: 115-123
c39		Hans Zantema: Complexity of Guided Insertion-Deletion in RNA-Editing. LATA 2010: 608-619
c38		Hans Zantema, Matthias Raffelsieper: Proving Productivity in Infinite Data Structures. RTA 2010: 401-416
	2009
j27		Matthias Raffelsieper, Hans Zantema: A Transformational Approach to Prove Outermost Termination Automatically. Electr. Notes Theor. Comput. Sci. 237: 3-21 (2009)
c37		Hans Zantema: A Tool Proving Well-Definedness of Streams Using Termination Tools. CALCO 2009: 449-456
c36		Jörg Endrullis, Herman Geuvers, Hans Zantema: Degrees of Undecidability in Term Rewriting. CSL 2009: 255-270
c35		Matthias Raffelsieper, Mohammad Reza Mousavi, Jan-Willem Roorda, Chris W. H. Strolenberg, Hans Zantema: Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models. FMICS 2009: 133-148
c34		Hans Zantema: Well-Definedness of Streams by Termination. RTA 2009: 164-178
c33		Olga Tveretina, Carsten Sinz, Hans Zantema: An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas. ACAC 2009: 13-21
c32		Hans Zantema, Matthias Raffelsieper: Stream Productivity by Outermost Termination. WRS 2009: 83-95
i2		Jörg Endrullis, Herman Geuvers, Hans Zantema: Degrees of Undecidability in Rewriting. CoRR abs/0902.4723 (2009)
i1		Olga Tveretina, Carsten Sinz, Hans Zantema: Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. Electronic Colloquium on Computational Complexity (ECCC) 16: 87 (2009)
	2008
j26		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)
j25		Jörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reasoning 40(2-3): 195-220 (2008)
c31		Hans Zantema, Stefan Wagemans, Dragan Bosnacki: Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets. BIRD 2008: 303-317
c30		Hans Zantema: Normalization of Infinite Terms. RTA 2008: 441-455
c29		Adam Koprowski, Hans Zantema: Certification of Proving Termination of Term Rewriting by Matrix Interpretations. SOFSEM 2008: 328-339
	2007
j24		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)
j23		Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema: Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205(8): 1188-1211 (2007)
c28		Claude Marché, Hans Zantema: The Termination Competition. RTA 2007: 303-313
c27		Hans Zantema, Johannes Waldmann: Termination by Quasi-periodic Interpretations. RTA 2007: 404-418
	2006
c26		Adam Koprowski, Hans Zantema: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. IJCAR 2006: 332-346
c25		Jörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR 2006: 574-588
	2005
j22		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)
j21		Hans Zantema: Termination of String Rewriting Proved Automatically. J. Autom. Reasoning 34(2): 105-139 (2005)
c24		Hans Zantema: Reducing Right-Hand Sides for Termination. Processes, Terms and Cycles 2005: 173-197
c23		Adam Koprowski, Hans Zantema: Proving Liveness with Fairness Using Rewriting. FroCoS 2005: 232-247
c22		Jaco van de Pol, Hans Zantema: Generalized Innermost Rewriting. RTA 2005: 2-16
c21		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
c20		Olga Tveretina, Hans Zantema: A Proof System and a Decision Procedure for Equality Logic. LATIN 2004: 530-539
c19		Hans Zantema: TORPA: Termination of Rewriting Proved Automatically. RTA 2004: 95-104
c18		Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145
	2003
j20		Jan Friso Groote, Hans Zantema: Resolution and binary decision diagrams cannot simulate each other polynomially. Discrete Applied Mathematics 130(2): 157-171 (2003)
j19		Hans Zantema, Jan Friso Groote: Transforming equality logic to propositional logic. Electr. Notes Theor. Comput. Sci. 86(1): 162-173 (2003)
j18		Jürgen Giesl, Hans Zantema: Simulating liveness by reduction strategies. Electr. Notes Theor. Comput. Sci. 86(4): 641-656 (2003)
c17		Jürgen Giesl, Hans Zantema: Liveness in Rewriting. RTA 2003: 321-336
	2002
j17		Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002)
j16		Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002)
j15		Hans Zantema, Hans L. Bodlaender: Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13(3): 445-458 (2002)
	2001
j14		Hans Zantema: The Termination Hierarchy for Term Rewriting. Appl. Algebra Eng. Commun. Comput. 12(1/2): 3-19 (2001)
j13		Hans Zantema, Jaco van de Pol: A rewriting approach to binary decision diagrams. J. Log. Algebr. Program. 49(1-2): 61-86 (2001)
c16		Jan Friso Groote, Hans Zantema: Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially. Ershov Memorial Conference 2001: 33-38
	2000
j12		Hans Zantema, Alfons Geser: A Complete Characterization of Termination of 0^p 1^q-> 1^r 0^s. Appl. Algebra Eng. Commun. Comput. 11(1): 1-25 (2000)
j11		Hans Zantema, Hans L. Bodlaender: Finding Small Equivalent Decision Trees is Hard. Int. J. Found. Comput. Sci. 11(2): 343-354 (2000)
c15		Jaco van de Pol, Hans Zantema: Binary Decision Diagrams by Shard Rewriting. MFCS 2000: 609-618
	1999
j10		Alfons Geser, Hans Zantema: Non-looping string rewriting. ITA 33(3): 279-302 (1999)
	1997
j9		Aart Middeldorp, Hans Zantema: Simple Termination of Rewrite Systems. Theor. Comput. Sci. 175(1): 127-158 (1997)
j8		Wan Fokkink, Hans Zantema: Termination Modulo Equations by Abstract Commutation with an Application to Iteration. Theor. Comput. Sci. 177(2): 407-423 (1997)
c14		Hans Zantema: Termination of Context-Sensitive Rewriting. RTA 1997: 172-186
c13		Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248
	1996
j7		Maria C. F. Ferreira, Hans Zantema: Total termination of term rewriting. Appl. Algebra Eng. Commun. Comput. 7(2): 133-162 (1996)
c12		Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema: Transforming Termination by Self-Labelling. CADE 1996: 373-387
c11		Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. CSL 1996: 150-166
	1995
j6		Hans Zantema: Termination of Term Rewriting by Semantic Labelling. Fundam. Inform. 24(1/2): 89-105 (1995)
j5		Hans Zantema: Total Termination of Term Rewriting is Undecidable. J. Symb. Comput. 20(1): 43-60 (1995)
c10		Maria C. F. Ferreira, Hans Zantema: Dummy Elimination: Making Termination Easier. FCT 1995: 243-252
c9		Thomas Arts, Hans Zantema: Termination of Logic Programs Using Semantic Unification. LOPSTR 1995: 219-233
c8		Hans Zantema, Alfons Geser: A Complete Characterization of Termination of O^p 1^q -> 1^r O^s. RTA 1995: 41-55
c7		H. R. Walters, Hans Zantema: Rewrite Systems for Integer Arithmetic. RTA 1995: 324-338
	1994
j4		Wan Fokkink, Hans Zantema: Basic Process Algebra with Iteration: Completeness of its Equational Axioms. Comput. J. 37(4): 259-268 (1994)
j3		Hans Zantema: Termination of Term Rewriting: Interpretation and Type Elimination. J. Symb. Comput. 17(1): 23-50 (1994)
c6		Maria C. F. Ferreira, Hans Zantema: Syntactical Analysis of Total Termination. ALP 1994: 204-222
c5		Aart Middeldorp, Hans Zantema: Simple Termination Revisited. CADE 1994: 451-465
c4		Maria C. F. Ferreira, Hans Zantema: Well-foundedness of Term Orderings. CTRS 1994: 106-123
	1993
c3		Maria C. F. Ferreira, Hans Zantema: Total Termination of Term Rewriting. RTA 1993: 213-227
	1992
j2		Hans Zantema: Longest Segment Problems. Sci. Comput. Program. 18(1): 39-66 (1992)
c2		Hans Zantema: Type Removal in Term Rewriting. CTRS 1992: 148-154
c1		Hans Zantema: Termination of Term Rewriting by Interpretation. CTRS 1992: 155-167
	1991
j1		Hans Zantema: Minimizing Sums of Addition Chains. J. Algorithms 12(2): 281-307 (1991)

2013

c46

Sebastiaan J. C. Joosten, Hans Zantema: Relaxation of 3-partition instances. CTW 2013: 133-136

2012

j33

Aaron Stump, Hans Zantema, Garrin Kimmell, Roba El Haj Omar: A Rewriting View of Simple Typing. Logical Methods in Computer Science 9(1) (2012)

c45

Marijke H. L. Bodlaender, Cor A. J. Hurkens, Vincent J. J. Kusters, Frank Staals, Gerhard J. Woeginger, Hans Zantema: Cinderella versus the Wicked Stepmother. IFIP TCS 2012: 57-71

c44

Vincent van Oostrom, Hans Zantema: Triangulation in Rewriting. RTA 2012: 240-255

c43

Erik P. de Vink, Hans Zantema, Dragan Bosnacki: Combining Insertion and Deletion in RNA-editing Preserves Regularity. MeCBIC 2012: 48-62

2011

j32

Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema: Levels of undecidability in rewriting. Inf. Comput. 209(2): 227-245 (2011)

j31

Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema: Long-run order-independence of vector-based transition systems. IET Computers & Digital Techniques 5(6): 468-478 (2011)

c42

Hans Zantema, Jörg Endrullis: Proving Equality of Streams Automatically. RTA 2011: 393-408

c41

Hans Zantema: Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic. WRS 2011: 69-76

2010

j30

M. Mousazadeh, B. T. Ladani, Hans Zantema: Liveness Verification in TRSs Using Tree Automata and Termination Analysis. Computing and Informatics 29(3): 407-426 (2010)

j29

Hans Zantema: Well-definedness of Streams by Transformation and Termination. Logical Methods in Computer Science 6(3) (2010)

j28

Olga Tveretina, Carsten Sinz, Hans Zantema: Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. JSAT 7(1): 35-58 (2010)

c40

Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema: Order-Independence of Vector-Based Transition Systems. ACSD 2010: 115-123

c39

Hans Zantema: Complexity of Guided Insertion-Deletion in RNA-Editing. LATA 2010: 608-619

c38

Hans Zantema, Matthias Raffelsieper: Proving Productivity in Infinite Data Structures. RTA 2010: 401-416

2009

j27

Matthias Raffelsieper, Hans Zantema: A Transformational Approach to Prove Outermost Termination Automatically. Electr. Notes Theor. Comput. Sci. 237: 3-21 (2009)

c37

Hans Zantema: A Tool Proving Well-Definedness of Streams Using Termination Tools. CALCO 2009: 449-456

c36

Jörg Endrullis, Herman Geuvers, Hans Zantema: Degrees of Undecidability in Term Rewriting. CSL 2009: 255-270

c35

Matthias Raffelsieper, Mohammad Reza Mousavi, Jan-Willem Roorda, Chris W. H. Strolenberg, Hans Zantema: Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models. FMICS 2009: 133-148

c34

Hans Zantema: Well-Definedness of Streams by Termination. RTA 2009: 164-178

c33

Olga Tveretina, Carsten Sinz, Hans Zantema: An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas. ACAC 2009: 13-21

c32

Hans Zantema, Matthias Raffelsieper: Stream Productivity by Outermost Termination. WRS 2009: 83-95

Jörg Endrullis, Herman Geuvers, Hans Zantema: Degrees of Undecidability in Rewriting. CoRR abs/0902.4723 (2009)

Olga Tveretina, Carsten Sinz, Hans Zantema: Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. Electronic Colloquium on Computational Complexity (ECCC) 16: 87 (2009)

2008

j26

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)

j25

Jörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. J. Autom. Reasoning 40(2-3): 195-220 (2008)

c31

Hans Zantema, Stefan Wagemans, Dragan Bosnacki: Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets. BIRD 2008: 303-317

c30

Hans Zantema: Normalization of Infinite Terms. RTA 2008: 441-455

c29

Adam Koprowski, Hans Zantema: Certification of Proving Termination of Term Rewriting by Matrix Interpretations. SOFSEM 2008: 328-339

2007

j24

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)

j23

Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema: Generalizing DPLL and satisfiability for equalities. Inf. Comput. 205(8): 1188-1211 (2007)

c28

Claude Marché, Hans Zantema: The Termination Competition. RTA 2007: 303-313

c27

Hans Zantema, Johannes Waldmann: Termination by Quasi-periodic Interpretations. RTA 2007: 404-418

2006

c26

Adam Koprowski, Hans Zantema: Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. IJCAR 2006: 332-346

c25

Jörg Endrullis, Johannes Waldmann, Hans Zantema: Matrix Interpretations for Proving Termination of Term Rewriting. IJCAR 2006: 574-588

2005

j22

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)

j21

Hans Zantema: Termination of String Rewriting Proved Automatically. J. Autom. Reasoning 34(2): 105-139 (2005)

c24

Hans Zantema: Reducing Right-Hand Sides for Termination. Processes, Terms and Cycles 2005: 173-197

c23

Adam Koprowski, Hans Zantema: Proving Liveness with Fairness Using Rewriting. FroCoS 2005: 232-247

c22

Jaco van de Pol, Hans Zantema: Generalized Innermost Rewriting. RTA 2005: 2-16

c21

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

c20

Olga Tveretina, Hans Zantema: A Proof System and a Decision Procedure for Equality Logic. LATIN 2004: 530-539

c19

Hans Zantema: TORPA: Termination of Rewriting Proved Automatically. RTA 2004: 95-104

c18

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema: Finding Finite Automata That Certify Termination of String Rewriting. CIAA 2004: 134-145

2003

j20

Jan Friso Groote, Hans Zantema: Resolution and binary decision diagrams cannot simulate each other polynomially. Discrete Applied Mathematics 130(2): 157-171 (2003)

j19

Hans Zantema, Jan Friso Groote: Transforming equality logic to propositional logic. Electr. Notes Theor. Comput. Sci. 86(1): 162-173 (2003)

j18

Jürgen Giesl, Hans Zantema: Simulating liveness by reduction strategies. Electr. Notes Theor. Comput. Sci. 86(4): 641-656 (2003)

c17

Jürgen Giesl, Hans Zantema: Liveness in Rewriting. RTA 2003: 321-336

2002

j17

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002)

j16

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002)

j15

Hans Zantema, Hans L. Bodlaender: Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13(3): 445-458 (2002)

2001

j14

Hans Zantema: The Termination Hierarchy for Term Rewriting. Appl. Algebra Eng. Commun. Comput. 12(1/2): 3-19 (2001)

j13

Hans Zantema, Jaco van de Pol: A rewriting approach to binary decision diagrams. J. Log. Algebr. Program. 49(1-2): 61-86 (2001)

c16

Jan Friso Groote, Hans Zantema: Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially. Ershov Memorial Conference 2001: 33-38

2000

j12

Hans Zantema, Alfons Geser: A Complete Characterization of Termination of 0^p 1^q-> 1^r 0^s. Appl. Algebra Eng. Commun. Comput. 11(1): 1-25 (2000)

j11

Hans Zantema, Hans L. Bodlaender: Finding Small Equivalent Decision Trees is Hard. Int. J. Found. Comput. Sci. 11(2): 343-354 (2000)

c15

Jaco van de Pol, Hans Zantema: Binary Decision Diagrams by Shard Rewriting. MFCS 2000: 609-618

1999

j10

Alfons Geser, Hans Zantema: Non-looping string rewriting. ITA 33(3): 279-302 (1999)

1997

Aart Middeldorp, Hans Zantema: Simple Termination of Rewrite Systems. Theor. Comput. Sci. 175(1): 127-158 (1997)

Wan Fokkink, Hans Zantema: Termination Modulo Equations by Abstract Commutation with an Application to Iteration. Theor. Comput. Sci. 177(2): 407-423 (1997)

c14

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

c13

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

1996

Maria C. F. Ferreira, Hans Zantema: Total termination of term rewriting. Appl. Algebra Eng. Commun. Comput. 7(2): 133-162 (1996)

c12

Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema: Transforming Termination by Self-Labelling. CADE 1996: 373-387

c11

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. CSL 1996: 150-166

1995

Hans Zantema: Termination of Term Rewriting by Semantic Labelling. Fundam. Inform. 24(1/2): 89-105 (1995)

Hans Zantema: Total Termination of Term Rewriting is Undecidable. J. Symb. Comput. 20(1): 43-60 (1995)

c10

Maria C. F. Ferreira, Hans Zantema: Dummy Elimination: Making Termination Easier. FCT 1995: 243-252

Thomas Arts, Hans Zantema: Termination of Logic Programs Using Semantic Unification. LOPSTR 1995: 219-233

Hans Zantema, Alfons Geser: A Complete Characterization of Termination of O^p 1^q -> 1^r O^s. RTA 1995: 41-55

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

1994

Wan Fokkink, Hans Zantema: Basic Process Algebra with Iteration: Completeness of its Equational Axioms. Comput. J. 37(4): 259-268 (1994)

Hans Zantema: Termination of Term Rewriting: Interpretation and Type Elimination. J. Symb. Comput. 17(1): 23-50 (1994)

Maria C. F. Ferreira, Hans Zantema: Syntactical Analysis of Total Termination. ALP 1994: 204-222

Aart Middeldorp, Hans Zantema: Simple Termination Revisited. CADE 1994: 451-465

Maria C. F. Ferreira, Hans Zantema: Well-foundedness of Term Orderings. CTRS 1994: 106-123

1993

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

1992

Hans Zantema: Longest Segment Problems. Sci. Comput. Program. 18(1): 39-66 (1992)

Hans Zantema: Type Removal in Term Rewriting. CTRS 1992: 148-154

Hans Zantema: Termination of Term Rewriting by Interpretation. CTRS 1992: 155-167

1991

Hans Zantema: Minimizing Sums of Addition Chains. J. Algorithms 12(2): 281-307 (1991)

1	Thomas Arts	[c9]
2	Bahareh Badban	[j23]
3	Hans L. Bodlaender	[j15] [j11]
4	Marijke H. L. Bodlaender	[c45]
5	Dragan Bosnacki	[c43] [c31]
6	Jörg Endrullis	[j32] [c42] [c36] [i2] [j25] [c25]
7	Maria C. F. Ferreira	[j7] [c10] [c6] [c4] [c3]
8	Wan Fokkink	[j8] [j4]
9	Alfons Geser	[j24] [j22] [c21] [c18] [j17] [j16] [j12] [j10] [c13] [c11] [c8]
10	Herman Geuvers	[j32] [c36] [i2]
11	Jürgen Giesl	[j26] [j18] [c17]
12	Jan Friso Groote	[j20] [j19] [c16]
13	Dieter Hofbauer	[j24] [j22] [c21] [c18]
14	Cor A. J. Hurkens	[c45]
15	Sebastiaan J. C. Joosten	[c46]
16	Garrin Kimmell	[j33]
17	Adam Koprowski	[c29] [c26] [c23]
18	Vincent J. J. Kusters	[c45]
19	B. T. Ladani	[j30]
20	Claude Marché	[c28]
21	Aart Middeldorp	[j17] [j16] [j9] [c13] [c12] [c11] [c5]
22	Mohammad Reza Mousavi	[j31] [c40] [c35]
23	M. Mousazadeh	[j30]
24	Enno Ohlebusch	[j17] [j16] [c13] [c11]
25	Hitoshi Ohsaki	[c12]
26	Roba El Haj Omar	[j33]
27	Vincent van Oostrom	[c44]
28	Jaco van de Pol	[j23] [c22] [j13] [c15]
29	Matthias Raffelsieper	[j31] [c40] [c38] [j27] [c35] [c32]
30	Jan-Willem Roorda	[c35]
31	Peter Schneider-Kamp	[j26]
32	Jakob Grue Simonsen	[j32]
33	Carsten Sinz	[j28] [c33] [i1]
34	Frank Staals	[c45]
35	Chris W. H. Strolenberg	[c35]
36	Aaron Stump	[j33]
37	René Thiemann	[j26]
38	Olga Tveretina	[j28] [c33] [i1] [j23] [c20]
39	Erik P. de Vink	[c43]
40	Stefan Wagemans	[c31]
41	Johannes Waldmann	[j25] [j24] [c27] [c25] [j22] [c21] [c18]
42	H. R. Walters	[c7]
43	Gerhard J. Woeginger	[c45]

Hans Zantema

Coauthor Index