| Publication | Date of Publication | Type |
|---|
An analysis of the Core-ML language: Expressive power and type reconstruction
Automata, Languages and Programming | 2019-04-29 | Paper |
Efficient parallel algorithms on restartable fail-stop processors
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Method schemas.
Journal of Computer and System Sciences | 2008-12-21 | Paper |
Object identity as a query language primitive
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 1479611 (Why is no real title available?) | 2000-07-20 | Paper |
| scientific article; zbMATH DE number 1142327 (Why is no real title available?) | 1998-05-14 | Paper |
A data structure for arc insertion and regular path finding
Annals of Mathematics and Artificial Intelligence | 1997-11-27 | Paper |
| scientific article; zbMATH DE number 1033646 (Why is no real title available?) | 1997-07-15 | Paper |
Undecidable boundedness problems for datalog programs
The Journal of Logic Programming | 1997-04-17 | Paper |
Indexing for data models with constraints and classes
Journal of Computer and System Sciences | 1996-11-26 | Paper |
Database query languages embedded in the typed lambda calculus
Information and Computation | 1996-10-01 | Paper |
Parallel Algorithms with Processor Failures and Delays
Journal of Algorithms | 1996-02-20 | Paper |
| scientific article; zbMATH DE number 794259 (Why is no real title available?) | 1995-09-10 | Paper |
| scientific article; zbMATH DE number 432747 (Why is no real title available?) | 1994-01-02 | Paper |
Efficient parallel algorithms can be made robust
Distributed Computing | 1992-09-27 | Paper |
On the representation and querying of sets of possible worlds
Theoretical Computer Science | 1992-06-25 | Paper |
Bounds in the propagation of selection into logic programs
Journal of Computer and System Sciences | 1992-06-25 | Paper |
Polynomial-time implication problems for unary inclusion dependencies
Journal of the ACM | 1990-01-01 | Paper |
CCS expressions, finite state processes, and three problems of equivalence
Information and Computation | 1990-01-01 | Paper |
On the relationship of congruence closure and unification
Journal of Symbolic Computation | 1989-01-01 | Paper |
On the analysis of cooperation and antagonism in networks of communicating processes
Algorithmica | 1988-01-01 | Paper |
Parallel Algorithms for Term Matching
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4039302 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049127 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4049157 (Why is no real title available?) | 1986-01-01 | Paper |
Partition semantics for relations
Journal of Computer and System Sciences | 1986-01-01 | Paper |
The Complexity of Distributed Concurrency Control
SIAM Journal on Computing | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3922023 (Why is no real title available?) | 1985-01-01 | Paper |
Is distributed locking harder?
Journal of Computer and System Sciences | 1984-01-01 | Paper |
On Concurrency Control by Multiple Versions
ACM Transactions on Database Systems | 1984-01-01 | Paper |
On the sequential nature of unification
The Journal of Logic Programming | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3876616 (Why is no real title available?) | 1983-01-01 | Paper |
On the computational complexity of cardinality constraints in relational databases
Information Processing Letters | 1980-01-01 | Paper |
Local Search for the Asymmetric Traveling Salesman Problem
Operations Research | 1980-01-01 | Paper |
Flowshop scheduling with limited temporary storage
Journal of the ACM | 1980-01-01 | Paper |
