| Publication | Date of Publication | Type |
|---|
| The communication complexity of multiparty set disjointness under product distributions | 2023-11-14 | Paper |
| Semigroups satisfying x m+n = x n | 2023-03-09 | Paper |
| A maximal-literal unit strategy for horn clauses | 2023-03-09 | Paper |
| What is the Church-Turing Thesis? | 2022-12-13 | Paper |
| Open problems in rewriting | 2022-12-09 | Paper |
| Topics in termination | 2022-12-09 | Paper |
| More problems in rewriting | 2022-12-09 | Paper |
| Problems in rewriting III | 2022-12-09 | Paper |
| Trees, ordinals and termination | 2022-11-02 | Paper |
| An abstract concurrent machine for rewriting | 2022-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5013888 | 2021-12-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986664 | 2021-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4986663 | 2021-04-27 | Paper |
| Between Broadway and the Hudson: A Bijection of Corridor Paths | 2021-03-26 | Paper |
| Honest Computability and Complexity | 2020-08-06 | Paper |
| Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers | 2020-07-29 | Paper |
| Zohar Manna (1939--2018) | 2019-12-18 | Paper |
| Graph Path Orderings | 2019-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967215 | 2019-07-03 | Paper |
| Drags: a compositional algebraic framework for graph rewriting | 2019-06-18 | Paper |
| On the parallel computation thesis | 2019-01-08 | Paper |
| Well-founded unions | 2018-10-18 | Paper |
| Cayley′s Formula: A Page From The Book | 2018-07-12 | Paper |
| Calendrical Calculations | 2018-01-23 | Paper |
| Innocuous constructor-sharing combinations | 2017-11-17 | Paper |
| Abstract canonical inference | 2017-07-12 | Paper |
| Res Publica: The Universal Model of Computation (Invited Talk) | 2017-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2953133 | 2017-01-03 | Paper |
| Axiomatizing Analog Algorithms | 2016-08-17 | Paper |
| Universality in two dimensions | 2016-04-28 | Paper |
| The Average Height of Catalan Trees by Counting Lattice Paths | 2015-11-23 | Paper |
| Hints Revealed | 2015-11-20 | Paper |
| Complexity of propositional proofs under a promise | 2015-09-17 | Paper |
| Honest universality | 2015-08-21 | Paper |
| Generic Parallel Algorithms | 2015-02-25 | Paper |
| Yaacov Choueka: A Profile | 2015-02-10 | Paper |
| Confluence by Critical Pair Analysis | 2014-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2851702 | 2013-10-02 | Paper |
| Gap Embedding for Well-Quasi-Orderings | 2013-06-06 | Paper |
| Canonical Ground Horn Theories | 2013-04-19 | Paper |
| Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01). | 2013-04-19 | Paper |
| Effectiveness | 2013-02-26 | Paper |
| Jumping and escaping: modular termination and the abstract path ordering | 2013-01-07 | Paper |
| Towards an Axiomatization of Simple Analog Algorithms | 2012-07-16 | Paper |
| Indian Calendrical Calculations | 2011-07-27 | Paper |
| A critical pair criterion for completion modulo a congruence | 2011-04-16 | Paper |
| Yuri, Logic, and Computer Science | 2010-09-03 | Paper |
| Three Paths to Effectiveness | 2010-09-03 | Paper |
| Exact Exploration and Hanging Algorithms | 2010-09-03 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| Verification: Theory and Practice | 2010-03-23 | Paper |
| More Patterns in Trees: Up and Down, Young and Old, Odd and Even | 2010-03-17 | Paper |
| The influence of domain interpretations on computational models | 2009-11-13 | Paper |
| When are Two Algorithms the Same? | 2009-06-17 | Paper |
| On Lazy Commutation | 2009-06-03 | Paper |
| A Natural Axiomatization of Computability and Proof of Church's Thesis | 2009-03-25 | Paper |
| The Hydra Battle Revisited | 2009-03-06 | Paper |
| Canonicity! | 2008-11-27 | Paper |
| Canonical Inference for Implicational Systems | 2008-11-27 | Paper |
| SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets | 2008-06-19 | Paper |
| The Four Sons of Penrose | 2008-05-27 | Paper |
| Boolean Rings for Intersection-Based Satisfiability | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5386123 | 2008-04-18 | Paper |
| Boris A. Trakhtenbrot: Academic Genealogy and Publications | 2008-03-25 | Paper |
| The Church-Turing Thesis over Arbitrary Domains | 2008-03-25 | Paper |
| Complexity of propositional proofs under a promise | 2007-11-28 | Paper |
| A Scalable Algorithm for Minimal Unsatisfiable Core Extraction | 2007-09-04 | Paper |
| Leanest quasi-orderings | 2007-04-16 | Paper |
| Comparing Computational Power | 2007-02-15 | Paper |
| Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
| Abstract canonical presentations | 2006-08-16 | Paper |
| A hypercomputational alien | 2006-08-04 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-15 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Logic Programming | 2005-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470528 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3153941 | 2002-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537128 | 2002-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3153070 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148836 | 2002-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2751361 | 2002-08-27 | Paper |
| Artificial intelligence: Retrospective/prospective | 2002-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4534296 | 2002-06-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757839 | 2001-12-04 | Paper |
| A general framework for automatic termination analysis od logic programs | 2001-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499242 | 2001-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385532 | 1998-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4367587 | 1997-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347956 | 1997-10-26 | Paper |
| Natural termination | 1997-02-28 | Paper |
| Equational inference, canonical proofs, and proof orderings | 1994-06-29 | Paper |
| Deductive and inductive synthesis of equational programs | 1994-06-09 | Paper |
| Logical debugging | 1994-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036569 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4012174 | 1992-09-27 | Paper |
| Rewrite, rewrite, rewrite, rewrite, rewrite, \dots | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3970984 | 1992-06-25 | Paper |
| The cycle lemma and some applications | 1990-01-01 | Paper |
| A rationale for conditional equational programming | 1990-01-01 | Paper |
| Completion for rewriting modulo a congruence | 1989-01-01 | Paper |
| Patterns in trees | 1989-01-01 | Paper |
| An implementation of narrowing | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205073 | 1989-01-01 | Paper |
| Critical pair criteria for completion | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3210187 | 1988-01-01 | Paper |
| Existence, Uniqueness, and Construction of Rewrite Systems | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817652 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817653 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819993 | 1988-01-01 | Paper |
| Termination of rewriting | 1987-01-01 | Paper |
| Corrigendum to ``Termination of rewriting | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809306 | 1987-01-01 | Paper |
| Ordered trees and non-crossing partitions | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783521 | 1986-01-01 | Paper |
| Synthetic programming | 1985-01-01 | Paper |
| Program abstraction and instantiation | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3703288 | 1985-01-01 | Paper |
| Computing with rewrite systems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338269 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674088 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783490 | 1983-01-01 | Paper |
| Orderings for term-rewriting systems | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912031 | 1981-01-01 | Paper |
| Inference Rules for Program Annotation | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3917482 | 1981-01-01 | Paper |
| Enumerations of ordered trees | 1980-01-01 | Paper |
| The Schorr-Waite marking algorithm revisited | 1980-01-01 | Paper |
| A note on simplification orderings | 1979-01-01 | Paper |
| Proving termination with multiset orderings | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190106 | 1979-01-01 | Paper |
| KEDMA—Linguistic Tools for Retrieval Systems | 1978-01-01 | Paper |
| The Evolution of Programs: Automatic Program Modification | 1977-01-01 | Paper |
| A simplified loop-free algorithm for generating permutations | 1975-01-01 | Paper |
