| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7646008 (Why is no real title available?) | 2023-01-25 | Paper |
| Essential discrete mathematics for computer science | 2018-11-09 | Paper |
Efficient symbolic analysis of programs
Journal of Computer and System Sciences | 1986-01-01 | Paper |
The word problem for cancellation semigroups with zero
Journal of Symbolic Logic | 1984-01-01 | Paper |
The complexity of the satisfiability problem for Krom formulas
Theoretical Computer Science | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3898847 (Why is no real title available?) | 1984-01-01 | Paper |
A logic for constant-depth circuits
Information and Control | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3845566 (Why is no real title available?) | 1983-01-01 | Paper |
Symmetric space-bounded computation
Theoretical Computer Science | 1982-01-01 | Paper |
The inference problem for template dependencies
Information and Control | 1982-01-01 | Paper |
Unifiability is complete for co-N Log Space
Information Processing Letters | 1982-01-01 | Paper |
Conservative reduction classes of Krom formulas
Journal of Symbolic Logic | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3804813 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3727583 (Why is no real title available?) | 1981-01-01 | Paper |
Complexity results for classes of quantificational formulas
Journal of Computer and System Sciences | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3692649 (Why is no real title available?) | 1980-01-01 | Paper |
Satisfiability problems for propositional calculi
Mathematical Systems Theory | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3657754 (Why is no real title available?) | 1979-01-01 | Paper |
Renaming a Set of Clauses as a Horn Set
Journal of the ACM | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3643230 (Why is no real title available?) | 1977-01-01 | Paper |
Krom formulas with one dyadic predicate letter
Journal of Symbolic Logic | 1976-01-01 | Paper |
Description of restricted automata by first-order formulae
Mathematical Systems Theory | 1975-01-01 | Paper |
Skolem reduction classes
Journal of Symbolic Logic | 1975-01-01 | Paper |
Linear sampling and the ∀∃∀ case of the decision problem
Journal of Symbolic Logic | 1974-01-01 | Paper |
Prefix classes of Krom formulas
Journal of Symbolic Logic | 1974-01-01 | Paper |
Program schemata and the first-order decision problem
Journal of Computer and System Sciences | 1974-01-01 | Paper |
The decision problem for formulas with a small number of atomic subformulas
Journal of Symbolic Logic | 1973-01-01 | Paper |
