| Publication | Date of Publication | Type |
|---|
| Subsumption algorithms based on search trees | 2023-02-23 | Paper |
| Transforming strongly sequential rewrite systems with constructors for efficient parallel execution | 2022-12-09 | Paper |
| Associative-commutative discrimination nets | 2022-11-02 | Paper |
| Some complexity theoretic aspects of AC rewriting | 2022-08-16 | Paper |
| Inference in probabilistic logic programs with continuous random variables | 2013-03-13 | Paper |
| Deductive Spreadsheets Using Tabled Logic Programming | 2008-03-11 | Paper |
| Functional and Logic Programming | 2007-09-25 | Paper |
| Precise specification matching for adaptive reuse in embedded systems | 2007-07-25 | Paper |
| BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS | 2005-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809159 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736511 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736510 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501591 | 2002-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551131 | 2002-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766790 | 2002-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767132 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754127 | 2001-12-18 | Paper |
| Term indexing | 2001-10-21 | Paper |
| Automata-driven efficient subterm unification | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518873 | 2001-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4518894 | 2001-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4494372 | 2000-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944884 | 2000-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938606 | 2000-02-23 | Paper |
| Efficient access mechanisms for tabled logic programs | 1999-05-04 | Paper |
| Programming in equational logic: Beyond strong sequentiality | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038705 | 1993-05-18 | Paper |
| Tight complexity bounds for term matching problems | 1993-01-17 | Paper |
| Approximate algorithms for the Knapsack problem on parallel computers | 1991-01-01 | Paper |
| Optimal matrix multiplication on fault-tolerant VLSI arrays | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3793740 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817659 | 1988-01-01 | Paper |
| Fault-tolerance VLSI sorters | 1987-01-01 | Paper |
| Computing dominators in parallel | 1987-01-01 | Paper |
| Mapping Homogeneous Graphs on Linear Arrays | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761692 | 1986-01-01 | Paper |
| An O(log n) algorithm for parallel update of minimum spanning trees | 1986-01-01 | Paper |
| Synthesis of an Optimal Family of Matrix Multiplication Algorithms on Linear Arrays | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687714 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732971 | 1985-01-01 | Paper |
| Modular Matrix Multiplication on a Linear Array | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692849 | 1984-01-01 | Paper |
| A Robust Matrix-Multiplication Array | 1984-01-01 | Paper |
| A Paradigm for the Design of Parallel Algorithms with Applications | 1983-01-01 | Paper |
