Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Hans Zantema" ( http://dblp.L3S.de/Authors/Hans_Zantema )

URL (Homepage):  http://www.win.tue.nl/~hzantema/  Author page on DBLP  Author page in RDF  Community of Hans Zantema in ASPL-2

Publication years (Num. hits)
1991-1995 (16) 1996-2002 (17) 2003-2006 (15) 2007-2009 (18) 2010-2011 (10)
Publication types (Num. hits)
article(34) inproceedings(42)
Venues (Conferences, Journals, ...)
RTA(14) Inf. Comput.(5) Appl. Algebra Eng. Commun. Com...(4) CTRS(3) Electr. Notes Theor. Comput. S...(3) Int. J. Found. Comput. Sci.(3) CADE(2) CSL(2) IJCAR(2) J. Autom. Reasoning(2) J. Symb. Comput.(2) Theor. Comput. Sci.(2) WRS(2) ACAC(1) ACSD(1) ALP(1) More (+10 of total 43)
Authors
Hans Zantema(76) Alfons Geser(11) Aart Middeldorp(7) Johannes Waldmann(7) Jörg Endrullis(6) Matthias Raffelsieper(6) Maria C. F. Ferreira(5) Olga Tveretina(5) Dieter Hofbauer(4) Enno Ohlebusch(4) Jaco van de Pol(4) Adam Koprowski(3) Carsten Sinz(3) Herman Geuvers(3) Jan Friso Groote(3) Jürgen Giesl(3) More (+10 of total 33)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 22 occurrences of 8 keywords
Results
Found 76 publication records. Showing 76 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Jörg Endrullis, Herman Geuvers, Jakob Grue Simonsen, Hans Zantema Levels of undecidability in rewriting. Search on Bibsonomy Inf. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans Zantema Strategy Independent Reduction Lengths in Rewriting and Binary Arithmetic Search on Bibsonomy WRS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema Long-run order-independence of vector-based transition systems. Search on Bibsonomy IET Computers & Digital Techniques The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Hans Zantema, Jörg Endrullis Proving Equality of Streams Automatically. Search on Bibsonomy RTA The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1M. Mousazadeh, B. T. Ladani, Hans Zantema Liveness Verification in TRSs Using Tree Automata and Termination Analysis. Search on Bibsonomy Computing and Informatics The full citation details ... 2010 DBLP  BibTeX  RDF
1Olga Tveretina, Carsten Sinz, Hans Zantema Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. Search on Bibsonomy JSAT The full citation details ... 2010 DBLP  BibTeX  RDF
1Hans Zantema Well-definedness of Streams by Transformation and Termination Search on Bibsonomy Logical Methods in Computer Science The full citation details ... 2010 DBLP  BibTeX  RDF
1Hans Zantema Complexity of Guided Insertion-Deletion in RNA-Editing. Search on Bibsonomy LATA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Matthias Raffelsieper, Mohammad Reza Mousavi, Hans Zantema Order-Independence of Vector-Based Transition Systems. Search on Bibsonomy ACSD The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Vector-based transition systems, Moore machines, Order independence, Model checking, Partial order reduction
1Hans Zantema, Matthias Raffelsieper Proving Productivity in Infinite Data Structures. Search on Bibsonomy RTA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Olga Tveretina, Carsten Sinz, Hans Zantema Ordered Binary Decision Diagrams, Pigeonhole Formulas and Beyond. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Matthias Raffelsieper, Hans Zantema A Transformational Approach to Prove Outermost Termination Automatically. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hans Zantema, Matthias Raffelsieper Stream Productivity by Outermost Termination Search on Bibsonomy WRS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Olga Tveretina, Carsten Sinz, Hans Zantema An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas Search on Bibsonomy ACAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jörg Endrullis, Herman Geuvers, Hans Zantema Degrees of Undecidability in Rewriting Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Matthias Raffelsieper, Mohammad Reza Mousavi, Jan-Willem Roorda, Chris W. H. Strolenberg, Hans Zantema Formal Analysis of Non-determinism in Verilog Cell Library Simulation Models. Search on Bibsonomy FMICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hans Zantema Well-Definedness of Streams by Termination. Search on Bibsonomy RTA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hans Zantema A Tool Proving Well-Definedness of Streams Using Termination Tools. Search on Bibsonomy CALCO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jörg Endrullis, Herman Geuvers, Hans Zantema Degrees of Undecidability in Term Rewriting. Search on Bibsonomy CSL The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Jörg Endrullis, Johannes Waldmann, Hans Zantema Matrix Interpretations for Proving Termination of Term Rewriting. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Matrix interpretations, Satisfiability, Termination, Term rewriting
1René Thiemann, Hans Zantema, Jürgen Giesl, Peter Schneider-Kamp Adding constants to string rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Termination, Term rewriting, Confluence, String rewriting
1Hans Zantema, Stefan Wagemans, Dragan Bosnacki Finding Frequent Subgraphs in Biological Networks Via Maximal Item Sets. Search on Bibsonomy BIRD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Hans Zantema Normalization of Infinite Terms. Search on Bibsonomy RTA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Adam Koprowski, Hans Zantema Certification of Proving Termination of Term Rewriting by Matrix Interpretations. Search on Bibsonomy SOFSEM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema On tree automata that certify termination of left-linear term rewriting systems. Search on Bibsonomy Inf. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Bahareh Badban, Jaco van de Pol, Olga Tveretina, Hans Zantema Generalizing DPLL and satisfiability for equalities. Search on Bibsonomy Inf. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Claude Marché, Hans Zantema The Termination Competition. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Hans Zantema, Johannes Waldmann Termination by Quasi-periodic Interpretations. Search on Bibsonomy RTA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Adam Koprowski, Hans Zantema Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jörg Endrullis, Johannes Waldmann, Hans Zantema Matrix Interpretations for Proving Termination of Term Rewriting. Search on Bibsonomy IJCAR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema Finding finite automata that certify termination of string rewriting systems. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hans Zantema Termination of String Rewriting Proved Automatically. Search on Bibsonomy J. Autom. Reasoning The full citation details ... 2005 DBLP  DOI  BibTeX  RDF semantic labelling, relative termination, match-bounds, termination, string rewriting
1Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jaco van de Pol, Hans Zantema Generalized Innermost Rewriting. Search on Bibsonomy RTA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Adam Koprowski, Hans Zantema Proving Liveness with Fairness Using Rewriting. Search on Bibsonomy FroCos The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Hans Zantema Reducing Right-Hand Sides for Termination. Search on Bibsonomy Processes, Terms and Cycles The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Olga Tveretina, Hans Zantema A Proof System and a Decision Procedure for Equality Logic. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Equality logic, satisfiability, resolution
1Hans Zantema TORPA: Termination of Rewriting Proved Automatically. Search on Bibsonomy RTA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema Finding Finite Automata That Certify Termination of String Rewriting. Search on Bibsonomy CIAA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Hans Zantema, Jan Friso Groote Transforming equality logic to propositional logic. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jürgen Giesl, Hans Zantema Simulating liveness by reduction strategies. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jan Friso Groote, Hans Zantema Resolution and binary decision diagrams cannot simulate each other polynomially. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jürgen Giesl, Hans Zantema Liveness in Rewriting. Search on Bibsonomy RTA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Hans Zantema, Hans L. Bodlaender Sizes of Ordered Decision Trees. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Hans Zantema, Jaco van de Pol A rewriting approach to binary decision diagrams. Search on Bibsonomy J. Log. Algebr. Program. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Hans Zantema The Termination Hierarchy for Term Rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Monotone algebras, Termination, Term rewriting, String rewriting
1Jan Friso Groote, Hans Zantema Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially. Search on Bibsonomy Ershov Memorial Conference The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Hans Zantema, Hans L. Bodlaender Finding Small Equivalent Decision Trees is Hard. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2000 DBLP  BibTeX  RDF
1Hans Zantema, Alfons Geser A Complete Characterization of Termination of 0p 1q-> 1r 0s. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Simple termination, Transformation ordering, Dummy elimination, Derivation length, Termination, Term rewriting, String rewriting
1Jaco van de Pol, Hans Zantema Binary Decision Diagrams by Shard Rewriting. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Hans Zantema Non-looping string rewriting. Search on Bibsonomy ITA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Aart Middeldorp, Hans Zantema Simple Termination of Rewrite Systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Wan Fokkink, Hans Zantema Termination Modulo Equations by Abstract Commutation with an Application to Iteration. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. Search on Bibsonomy TAPSOFT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Hans Zantema Termination of Context-Sensitive Rewriting. Search on Bibsonomy RTA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Maria C. F. Ferreira, Hans Zantema Total termination of term rewriting. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Aart Middeldorp, Hitoshi Ohsaki, Hans Zantema Transforming Termination by Self-Labelling. Search on Bibsonomy CADE The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema Relative Undecidability in Term Rewriting. Search on Bibsonomy CSL The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Hans Zantema Total Termination of Term Rewriting is Undecidable. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Hans Zantema Termination of Term Rewriting by Semantic Labelling. Search on Bibsonomy Fundam. Inform. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Maria C. F. Ferreira, Hans Zantema Dummy Elimination: Making Termination Easier. Search on Bibsonomy FCT The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Hans Zantema, Alfons Geser A Complete Characterization of Termination of Op 1q -> 1r Os. Search on Bibsonomy RTA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF simple termination, transformation ordering, dummy elimination, derivation length, termination, term rewriting, string rewriting
1H. R. Walters, Hans Zantema Rewrite Systems for Integer Arithmetic. Search on Bibsonomy RTA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Thomas Arts, Hans Zantema Termination of Logic Programs Using Semantic Unification. Search on Bibsonomy LOPSTR The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Hans Zantema Termination of Term Rewriting: Interpretation and Type Elimination. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Wan Fokkink, Hans Zantema Basic Process Algebra with Iteration: Completeness of its Equational Axioms. Search on Bibsonomy Comput. J. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Aart Middeldorp, Hans Zantema Simple Termination Revisited. Search on Bibsonomy CADE The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Maria C. F. Ferreira, Hans Zantema Syntactical Analysis of Total Termination. Search on Bibsonomy ALP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Maria C. F. Ferreira, Hans Zantema Well-foundedness of Term Orderings. Search on Bibsonomy CTRS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Maria C. F. Ferreira, Hans Zantema Total Termination of Term Rewriting. Search on Bibsonomy RTA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Hans Zantema Longest Segment Problems. Search on Bibsonomy Sci. Comput. Program. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Hans Zantema Termination of Term Rewriting by Interpretation. Search on Bibsonomy CTRS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Hans Zantema Type Removal in Term Rewriting. Search on Bibsonomy CTRS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Hans Zantema Minimizing Sums of Addition Chains. Search on Bibsonomy J. Algorithms The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #76 of 76 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.