| Publication | Date of Publication | Type |
|---|
The communication complexity of multiparty set disjointness under product distributions
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Semigroups satisfying x m+n = x n
Conditional Term Rewriting Systems | 2023-03-09 | Paper |
A maximal-literal unit strategy for horn clauses
Conditional and Typed Rewriting Systems | 2023-03-09 | Paper |
What is the Church-Turing Thesis?
Axiomatic Thinking II | 2022-12-13 | Paper |
Topics in termination
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Open problems in rewriting
Rewriting Techniques and Applications | 2022-12-09 | Paper |
More problems in rewriting
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Problems in rewriting III
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Trees, ordinals and termination
Lecture Notes in Computer Science | 2022-11-02 | Paper |
An abstract concurrent machine for rewriting
Algebraic and Logic Programming | 2022-08-16 | Paper |
| Cellular automata are generic | 2021-12-03 | Paper |
Cellular automata are generic
(available as arXiv preprint) | 2021-12-03 | Paper |
| scientific article; zbMATH DE number 7340320 (Why is no real title available?) | 2021-04-27 | Paper |
scientific article; zbMATH DE number 7340320 (Why is no real title available?)
(available as arXiv preprint) | 2021-04-27 | Paper |
| A formalization and proof of the extended Church-Turing thesis (extended abstract) | 2021-04-27 | Paper |
A formalization and proof of the extended Church-Turing thesis (extended abstract)
(available as arXiv preprint) | 2021-04-27 | Paper |
Between Broadway and the Hudson: A Bijection of Corridor Paths
(available as arXiv preprint) | 2021-03-26 | Paper |
| Between Broadway and the Hudson: A Bijection of Corridor Paths | 2021-03-26 | Paper |
Honest computability and complexity
Outstanding Contributions to Logic | 2020-08-06 | Paper |
Nonleaf patterns in trees: protected nodes and fine numbers
(available as arXiv preprint) | 2020-07-29 | Paper |
| Nonleaf patterns in trees: protected nodes and fine numbers | 2020-07-29 | Paper |
Zohar Manna (1939--2018)
Formal Aspects of Computing | 2019-12-18 | Paper |
Graph path orderings
EPiC Series in Computing | 2019-07-04 | Paper |
| Boris (Boaz) Trakhtenbrot (1921--2016) | 2019-07-03 | Paper |
Drags: a compositional algebraic framework for graph rewriting
Theoretical Computer Science | 2019-06-18 | Paper |
On the parallel computation thesis
Logic Journal of the IGPL | 2019-01-08 | Paper |
| Well-founded unions | 2018-10-18 | Paper |
Cayley′s Formula: A Page From The Book
The American Mathematical Monthly | 2018-07-12 | Paper |
| Calendrical Calculations | 2018-01-23 | Paper |
Innocuous constructor-sharing combinations
Rewriting Techniques and Applications | 2017-11-17 | Paper |
Abstract canonical inference
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
| Res Publica: The Universal Model of Computation (Invited Talk) | 2017-02-02 | Paper |
| scientific article; zbMATH DE number 6670063 (Why is no real title available?) | 2017-01-03 | Paper |
scientific article; zbMATH DE number 6670063 (Why is no real title available?)
(available as arXiv preprint) | 2017-01-03 | Paper |
Axiomatizing analog algorithms
Pursuit of the Universal | 2016-08-17 | Paper |
Universality in two dimensions
Journal of Logic and Computation | 2016-04-28 | Paper |
The average height of Catalan trees by counting lattice paths
Mathematics Magazine | 2015-11-23 | Paper |
Hints revealed
Lecture Notes in Computer Science | 2015-11-20 | Paper |
Complexity of propositional proofs under a promise
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Honest universality
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
Generic parallel algorithms
Language, Life, Limits | 2015-02-25 | Paper |
Yaacov Choueka: A Profile
Lecture Notes in Computer Science | 2015-02-10 | Paper |
Confluence by critical pair analysis
Lecture Notes in Computer Science | 2014-07-24 | Paper |
| Abstract effective models | 2013-10-02 | Paper |
Gap embedding for well-quasi-orderings
Electronic Notes in Theoretical Computer Science | 2013-06-06 | Paper |
Canonical ground Horn theories
Programming Logics | 2013-04-19 | Paper |
Canonicity1 1This research was supported in part by the Israel Science Foundation (grant no. 254/01).
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Effectiveness
A Computable Universe | 2013-02-26 | Paper |
Jumping and escaping: modular termination and the abstract path ordering
Theoretical Computer Science | 2013-01-07 | Paper |
Towards an Axiomatization of Simple Analog Algorithms
Lecture Notes in Computer Science | 2012-07-16 | Paper |
Indian Calendrical Calculations
Ancient Indian Leaps into Mathematics | 2011-07-27 | Paper |
A critical pair criterion for completion modulo a congruence
Lecture Notes in Computer Science | 2011-04-16 | Paper |
Three paths to effectiveness
Fields of Logic and Computation | 2010-09-03 | Paper |
Yuri, logic, and computer science
Fields of Logic and Computation | 2010-09-03 | Paper |
Exact exploration and hanging algorithms
Computer Science Logic | 2010-09-03 | Paper |
Pæan to Zohar Manna
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Bounded fairness
Lecture Notes in Computer Science | 2010-03-23 | Paper |
More patterns in trees: up and down, young and old, odd and even
SIAM Journal on Discrete Mathematics | 2010-03-17 | Paper |
The influence of domain interpretations on computational models
Applied Mathematics and Computation | 2009-11-13 | Paper |
When are Two Algorithms the Same?
The Bulletin of Symbolic Logic | 2009-06-17 | Paper |
On Lazy Commutation
Languages: From Formal to Natural | 2009-06-03 | Paper |
A Natural Axiomatization of Computability and Proof of Church's Thesis
The Bulletin of Symbolic Logic | 2009-03-25 | Paper |
The Hydra Battle Revisited
Rewriting, Computation and Proof | 2009-03-06 | Paper |
Canonical Inference for Implicational Systems
Automated Reasoning | 2008-11-27 | Paper |
Canonicity!
Automated Reasoning | 2008-11-27 | Paper |
SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets
Concurrency, Graphs and Models | 2008-06-19 | Paper |
The Four Sons of Penrose
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Boolean Rings for Intersection-Based Satisfiability
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
| scientific article; zbMATH DE number 5265455 (Why is no real title available?) | 2008-04-18 | Paper |
Boris A. Trakhtenbrot: Academic Genealogy and Publications
Pillars of Computer Science | 2008-03-25 | Paper |
The Church-Turing Thesis over Arbitrary Domains
Pillars of Computer Science | 2008-03-25 | Paper |
Complexity of propositional proofs under a promise
Lecture Notes in Computer Science | 2007-11-28 | Paper |
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Leanest quasi-orderings
Information and Computation | 2007-04-16 | Paper |
Comparing Computational Power
Logic Journal of the IGPL | 2007-02-15 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Abstract canonical presentations
Theoretical Computer Science | 2006-08-16 | Paper |
A hypercomputational alien
Applied Mathematics and Computation | 2006-08-04 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-15 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Logic Programming
Lecture Notes in Computer Science | 2005-08-26 | Paper |
| scientific article; zbMATH DE number 2077143 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1825108 (Why is no real title available?) | 2002-11-10 | Paper |
| scientific article; zbMATH DE number 1760142 (Why is no real title available?) | 2002-11-06 | Paper |
| scientific article; zbMATH DE number 1823194 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1804761 (Why is no real title available?) | 2002-09-23 | Paper |
| Rewriting | 2002-08-27 | Paper |
Artificial intelligence: Retrospective/prospective
Annals of Mathematics and Artificial Intelligence | 2002-06-27 | Paper |
| scientific article; zbMATH DE number 1751214 (Why is no real title available?) | 2002-06-06 | Paper |
| scientific article; zbMATH DE number 1678386 (Why is no real title available?) | 2001-12-04 | Paper |
A general framework for automatic termination analysis od logic programs
Applicable Algebra in Engineering, Communication and Computing | 2001-08-26 | Paper |
| scientific article; zbMATH DE number 1497822 (Why is no real title available?) | 2001-03-05 | Paper |
| scientific article; zbMATH DE number 1142316 (Why is no real title available?) | 1998-05-14 | Paper |
| scientific article; zbMATH DE number 1092351 (Why is no real title available?) | 1997-11-27 | Paper |
| scientific article; zbMATH DE number 1047878 (Why is no real title available?) | 1997-10-26 | Paper |
Natural termination
Theoretical Computer Science | 1997-02-28 | Paper |
Equational inference, canonical proofs, and proof orderings
Journal of the ACM | 1994-06-29 | Paper |
Deductive and inductive synthesis of equational programs
Journal of Symbolic Computation | 1994-06-09 | Paper |
Logical debugging
Journal of Symbolic Computation | 1994-05-09 | Paper |
| scientific article; zbMATH DE number 176740 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 67451 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 8327 (Why is no real title available?) | 1992-06-25 | Paper |
Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
Theoretical Computer Science | 1992-06-25 | Paper |
A rationale for conditional equational programming
Theoretical Computer Science | 1990-01-01 | Paper |
The cycle lemma and some applications
European Journal of Combinatorics | 1990-01-01 | Paper |
Patterns in trees
Discrete Applied Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4124993 (Why is no real title available?) | 1989-01-01 | Paper |
Completion for rewriting modulo a congruence
Theoretical Computer Science | 1989-01-01 | Paper |
An implementation of narrowing
The Journal of Logic Programming | 1989-01-01 | Paper |
Existence, Uniqueness, and Construction of Rewrite Systems
SIAM Journal on Computing | 1988-01-01 | Paper |
Critical pair criteria for completion
Journal of Symbolic Computation | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4090848 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4092758 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4191131 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4090847 (Why is no real title available?) | 1988-01-01 | Paper |
Termination of rewriting
Journal of Symbolic Computation | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4078851 (Why is no real title available?) | 1987-01-01 | Paper |
Corrigendum to ``Termination of rewriting
Journal of Symbolic Computation | 1987-01-01 | Paper |
Ordered trees and non-crossing partitions
Discrete Mathematics | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4047065 (Why is no real title available?) | 1986-01-01 | Paper |
Computing with rewrite systems
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3930339 (Why is no real title available?) | 1985-01-01 | Paper |
Synthetic programming
Artificial Intelligence | 1985-01-01 | Paper |
Program abstraction and instantiation
ACM Transactions on Programming Languages and Systems | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3871389 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3829296 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 4047035 (Why is no real title available?) | 1983-01-01 | Paper |
Orderings for term-rewriting systems
Theoretical Computer Science | 1982-01-01 | Paper |
Inference Rules for Program Annotation
IEEE Transactions on Software Engineering | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3729436 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3723873 (Why is no real title available?) | 1981-01-01 | Paper |
Enumerations of ordered trees
Discrete Mathematics | 1980-01-01 | Paper |
The Schorr-Waite marking algorithm revisited
Information Processing Letters | 1980-01-01 | Paper |
Proving termination with multiset orderings
Communications of the ACM | 1979-01-01 | Paper |
A note on simplification orderings
Information Processing Letters | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3628358 (Why is no real title available?) | 1979-01-01 | Paper |
KEDMA—Linguistic Tools for Retrieval Systems
Journal of the ACM | 1978-01-01 | Paper |
The Evolution of Programs: Automatic Program Modification
IEEE Transactions on Software Engineering | 1977-01-01 | Paper |
A simplified loop-free algorithm for generating permutations
BIT | 1975-01-01 | Paper |
