Hans Zantema
#22,685
Most Influential Person Now
Dutch mathematician and computer scientist.
Hans Zantema's AcademicInfluence.com Rankings
Hans Zantemacomputer-science Degrees
Computer Science
#1145
World Rank
#1185
Historical Rank
Automated Reasoning
#6
World Rank
#6
Historical Rank
Hans Zantemamathematics Degrees
Mathematics
#3160
World Rank
#4724
Historical Rank
Measure Theory
#3334
World Rank
#3938
Historical Rank
Download Badge
Computer Science Mathematics
Hans Zantema's Degrees
- PhD Mathematics Eindhoven University of Technology
Why Is Hans Zantema Influential?
(Suggest an Edit or Addition)According to Wikipedia, Hans Zantema is a Dutch mathematician and computer scientist, and professor at Radboud University in Nijmegen, known for his work on termination analysis. Biography Born in Goingarijp, The Netherlands, Zantema received his PhD in algebraic number theory in 1983 at the University of Amsterdam under supervision of Hendrik Lenstra Jr. for the thesis, entitled "Integer Valued Polynomials in Algebraic Number Theory."
Hans Zantema's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Termination of Term Rewriting by Semantic Labelling (1995) (219)
- Termination of Term Rewriting: Interpretation and Type Elimination (1994) (207)
- Matrix Interpretations for Proving Termination of Term Rewriting (2006) (183)
- Termination of Context-Sensitive Rewriting (1997) (76)
- Basic Process Algebra with Iteration: Completeness of its Equational Axioms (1993) (76)
- Finding Small Equivalent Decision Trees is Hard (2000) (71)
- The Termination Competition (2007) (65)
- On tree automata that certify termination of left-linear term rewriting systems (2005) (64)
- Resolution and binary decision diagrams cannot simulate each other polynomially (2001) (60)
- Integer valued polynomials over a number field (1982) (58)
- Simple Termination of Rewrite Systems (1997) (54)
- Termination of String Rewriting Proved Automatically (2005) (53)
- Transforming Termination by Self-Labelling (1996) (40)
- Termination of Logic Programs Using Semantic Unification (1995) (40)
- Dummy Elimination: Making Termination Easier (1995) (40)
- Termination of Term Rewriting by Interpretation (1992) (38)
- Well-foundedness of Term Orderings (1994) (34)
- Liveness in Rewriting (2003) (27)
- TORPA: Termination of Rewriting Proved Automatically (2004) (27)
- Rewrite Systems for Integer Arithmetic (1995) (25)
- Non-looping string rewriting (1999) (25)
- A Transformational Approach to Prove Outermost Termination Automatically (2009) (22)
- Levels of undecidability in rewriting (2011) (22)
- Termination Analysis for Graph Transformation Systems (2014) (22)
- Cinderella versus the Wicked Stepmother (2012) (21)
- Normalization of Infinite Terms (2008) (21)
- Proving Productivity in Infinite Data Structures (2010) (20)
- Simple Termination Revisited (1994) (19)
- Class numbers and units (1980) (19)
- A Complete Characterization of Termination of 0p 1q→ 1r 0s (2000) (19)
- The Termination Hierarchy for Term Rewriting (2001) (19)
- Non-looping rewriting (1996) (19)
- Proving non-termination by finite automata (2015) (18)
- Termination of logic programs via labelled term rewrite systems (1994) (18)
- Total Termination of Term Rewriting is Undecidable (1995) (18)
- A rewriting approach to binary decision diagrams (2001) (18)
- Well-Definedness of Streams by Termination (2009) (18)
- Syntactical Analysis of Total Termination (1994) (17)
- Lower Bounds for Synchronizing Word Lengths in Partial Automata (2018) (17)
- Degrees of Undecidability in Term Rewriting (2009) (16)
- Total termination of term rewriting (1993) (15)
- A Complete Characterization of Termination of Op 1q -> 1r Os (1995) (15)
- Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems (2006) (15)
- DFAs and PFAs with Long Shortest Synchronizing Word Length (2017) (14)
- Transforming equality logic to propositional logic (2003) (13)
- Longest Segment Problems (1992) (13)
- Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond (2010) (13)
- Finding DFAs with Maximal Shortest Synchronizing Word Length (2016) (12)
- Proving Liveness with Fairness Using Rewriting (2005) (12)
- Generalizing DPLL and satisfiability for equalities (2007) (12)
- Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (2015) (12)
- A computation concerning doubly transitive permutation groups. (1984) (11)
- Termination of Cycle Rewriting (2014) (11)
- Decision trees: equivalence and propositional operations (1998) (11)
- Termination by Quasi-periodic Interpretations (2007) (11)
- The Degree of Squares is an Atom (2015) (11)
- Reducing Right-Hand Sides for Termination (2005) (10)
- Stream Productivity by Outermost Termination (2010) (9)
- Finding finite automata that certify termination of string rewriting systems (2005) (9)
- Proving Equality of Streams Automatically (2011) (9)
- Relative Undecidability in Term Rewriting (1996) (9)
- A Proof System and a Decision Procedure for Equality Logic (2004) (8)
- Well-definedness of Streams by Transformation and Termination (2010) (8)
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations (2008) (8)
- Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models (2009) (8)
- Type Removal in Term Rewriting (1992) (8)
- Derivation lengths in term rewriting from interpretations in the naturals (1992) (8)
- Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules (1997) (8)
- Finding Finite Automata That Certify Termination of String Rewriting (2004) (8)
- Termination Modulo Equations by Abstract Commutation with an Application to Iteration (1997) (8)
- An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas (2009) (8)
- Prefix iteration in basic process algebra : applying termination techniques (1995) (7)
- Relative Undecidability in Term Rewriting: I. The Termination Hierarchy (2002) (7)
- Synchronizing non-deterministic finite automata (2017) (7)
- Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy (2002) (7)
- Complexity of Guided Insertion-Deletion in RNA-Editing (2010) (7)
- A Rewriting View of Simple Typing (2012) (6)
- Relaxation of 3-partition instances (2013) (6)
- Simulating liveness by reduction strategies (2003) (6)
- Slowly synchronizing automata with fixed alphabet size (2016) (6)
- Binary Decision Diagrams by Shared Rewriting Binary Decision Diagrams by Shared Rewriting (2000) (5)
- Minimizing Sums of Addition Chains (1991) (5)
- Triangulation in Rewriting (2012) (5)
- Generalized Innermost Rewriting (2005) (5)
- Shortest solutions for Sokoban (2003) (5)
- Sizes of decision tables and decision trees (1999) (5)
- Binary Decision Diagrams by Shard Rewriting (2000) (5)
- Sizes of Ordered Decision Trees (2002) (4)
- Adding constants to string rewriting (2008) (4)
- Transforming Cycle Rewriting into String Rewriting (2015) (4)
- Solving satisfiability of ground term algebras using DPLL and unification (2004) (4)
- Ordering sequences by permutation transducers (2017) (4)
- Liveness Verification in TRSs Using Tree Automata and Termination Analysis (2010) (4)
- Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets (2008) (4)
- Using SMT for Solving Fragments of Parameterised Boolean Equation Systems (2015) (4)
- Classifying termination of term rewriting (1991) (4)
- Termination of term rewriting, from many-sorted to one-sorted (1991) (4)
- The termination competition 2006 (2006) (3)
- A complete equational axiomatization for BPA-δε with prefix iteration (1995) (3)
- Relative termination in term rewriting (2004) (3)
- Transforming DPLL to resolution (2002) (3)
- Turtle graphics of morphic sequences (2016) (3)
- Termination of Cycle Rewriting by Transformation and Matrix Interpretation (2016) (3)
- Termination of constructor systems using semantic unification (1995) (3)
- A Tool Proving Well-Definedness of Streams Using Termination Tools (2009) (3)
- Global restrictions on ramification in number fields (1983) (3)
- Solving Computational Problems in the Theory of Word-Representable Graphs (2018) (2)
- A Probabilistic Analysis of the Game of the Goose (2016) (2)
- Integer valued polynomials in algebraic number theory (1983) (2)
- Order-Independence of Vector-Based Transition Systems (2010) (2)
- Automatically finding particular term rewriting systems (2013) (2)
- Combining Insertion and Deletion in RNA-editing Preserves Regularity (2012) (2)
- Binary structures in program transformations (1988) (2)
- Classifying Non-periodic Sequences by Permutation Transducers (2017) (1)
- Deadlock in packet switching networks (2021) (1)
- Counting symbol switches in synchronizing automata (2018) (1)
- Termination of Constructor Systems Using Semantic Uniication Termination of Constructor Systems Using Semantic Uniication Termination of Constructor Systems Using Semantic Uniication (1995) (1)
- Binary De ision Diagrams by Shared (2000) (1)
- Majority voting : characterization and algorithms (1988) (1)
- Transforming Cycle Rewriting into String Rewriting ( Extended Version ) (2015) (1)
- Transforming Termination by Self-Labelling(Theory of Rewriting Systems and Its Applications) (1995) (1)
- RNA-Editing with Combined Insertion and Deletion Preserves Regularity (2013) (1)
- Tree automata that certify termination of term rewriting systems (2004) (1)
- Erratum: Cinderella versus the Wicked Stepmother (2012) (1)
- The Degree of Squares is an Atom (Extended Version) (2015) (1)
- Complexity of Automatic Sequences (2020) (1)
- A problem from IMO 2010 (2011) (1)
- Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic (2012) (0)
- Non-termination using Regular Languages — International Workshop on Termination — (2014) (0)
- Complexity of Simon's problem in classical sense (2022) (0)
- Binary Decision Diagrams by Shared Rewriting Jaco van de Pol 1 ? (2014) (0)
- SAT techniques for knowledge base verification (2002) (0)
- Defense Technical Information Center Compilation Part Notice ADP 013964 TITLE : Comparing Techniques for Proving Unsatisfiability (0)
- Binary D ecis ion Diagrams by Shared Rewdting (2017) (0)
- Passive Automata Learning: DFAs and NFAs (2022) (0)
- Proving termination of rewriting automatically (2008) (0)
- Termination of extended string rewriting (2006) (0)
- A complete characterization of termination of $0%5Ep 1%5Eq \rightarrow 1%5Er 0%5Es$ (1994) (0)
- Non-termination using Regular Languages (2014) (0)
- SAT Techniques and Knowledge Base Verification (2002) (0)
- A complete equational axiomatization for BPAdelta-eta with prefix iteration (1998) (0)
- Proceedings 9th International Workshop on Computing with Terms and Graphs: Preface (2016) (0)
- TERMGRAPH 2016: Proceedings 9th International Workshop on Computing with Terms and Graphs Eindhoven, The Netherlands, April 8, 2016 (2016) (0)
- Book review: Selected papers on discrete mathematics (2005) (0)
- Degrees of Undecidability in Rewriting (2009) (0)
- Combinatorial problems by termination of rewriting (2010) (0)
- SMT-based analysis of a Boolean model of inflammation (2013) (0)
- A Complete Equational Axiomatization for BPA-delta-epsilon with Prefix Iteration (1995) (0)
- Turtle graphics of morphic streams (2014) (0)
- Comparing techniques for proving unsatisfiability (2002) (0)
- Long-run order-independence of vector-based transition systems (2011) (0)
- Proceedings 9th International Workshop on Computing with Terms and Graphs (2016) (0)
- Faith in Post-Conflict Rehabilitation; The Role and Impact of Religion in Post-war Liberia and the Church - NGO Relationship (2012) (0)
- RAPPORT Binary Decision Diagrams by Shared Rewriting (2000) (0)
- Total termination of rewriting (1993) (0)
- Program Termination Proofs (2012) (0)
- Proving Looping and Non-Looping Non-Termination by Finite Automata (2015) (0)
- Book review: Automatic Sequences. Theory, Applications, Generalizations (2010) (0)
- Defense Technical Information Center Compilation Part Notice ADP 013964 (0)
- Finding small counterexamples for abstract rewriting properties (2018) (0)
- 2 Liveness in Abstract Reduction (2011) (0)
- The k-Dimensional Cube is k-Representable (2019) (0)
- The k-cube is k-representable. (2018) (0)
- Proving liveness in ring protocols by termination (2003) (0)
This paper list is powered by the following services:
Other Resources About Hans Zantema
What Schools Are Affiliated With Hans Zantema?
Hans Zantema is affiliated with the following schools:
