| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 6118223 (Why is no real title available?) | 2012-12-23 | Paper |
Average-Case Performance of the Apriori Algorithm
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 1113993 (Why is no real title available?) | 1998-05-25 | Paper |
| scientific article; zbMATH DE number 1113992 (Why is no real title available?) | 1998-03-02 | Paper |
Backtracking and random constraint satisfaction
Annals of Mathematics and Artificial Intelligence | 1997-10-26 | Paper |
Probe Order Backtracking
SIAM Journal on Computing | 1997-05-26 | Paper |
| scientific article; zbMATH DE number 976346 (Why is no real title available?) | 1997-02-05 | Paper |
Average Time Analysis of Clause Order Backtracking
SIAM Journal on Computing | 1993-05-17 | Paper |
| scientific article; zbMATH DE number 30299 (Why is no real title available?) | 1992-06-27 | Paper |
A practical unification algorithm
Information Sciences | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4108985 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4123296 (Why is no real title available?) | 1989-01-01 | Paper |
Exponential Average Time for the Pure Literal Rule
SIAM Journal on Computing | 1989-01-01 | Paper |
A New Base Change Algorithm for Permutation Groups
SIAM Journal on Computing | 1989-01-01 | Paper |
An exponential lower bound for the pure literal rule
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4035120 (Why is no real title available?) | 1987-01-01 | Paper |
Polynomial-average-time satisfiability problems
Information Sciences | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3921984 (Why is no real title available?) | 1985-01-01 | Paper |
The Pure Literal Rule and Polynomial Average Time
SIAM Journal on Computing | 1985-01-01 | Paper |
Solving Satisfiability with Less Searching
IEEE Transactions on Pattern Analysis and Machine Intelligence | 1984-01-01 | Paper |
A methodology and notation for compiler front end design
Software: Practice and Experience | 1984-01-01 | Paper |
An Analysis of Backtracking with Search Rearrangement
SIAM Journal on Computing | 1983-01-01 | Paper |
Parsing extended LR(k) grammars
Acta Informatica | 1981-01-01 | Paper |
An Average Time Analysis of Backtracking
SIAM Journal on Computing | 1981-01-01 | Paper |
Backtracking with multi-level dynamic search rearrangement
Acta Informatica | 1981-01-01 | Paper |
Semantic routines and \(LR(k)\) parsers
Acta Informatica | 1980-01-01 | Paper |
Exact formulas for the buddy system
Information Sciences | 1980-01-01 | Paper |
Tree Size by Partial Backtracking
SIAM Journal on Computing | 1978-01-01 | Paper |
Automatic program indentation
BIT | 1978-01-01 | Paper |
The size of LALR (1) parsers
BIT | 1974-01-01 | Paper |
Analysis of a multi-level time-sharing model
BIT Numerical Mathematics | 1974-01-01 | Paper |
A sentence generator for testing parsers
BIT | 1972-01-01 | Paper |
Analysis of Two Time-Sharing Queueing Models
Journal of the ACM | 1972-01-01 | Paper |
Statistical investigation of three storage allocation algorithms
BIT | 1971-01-01 | Paper |
Statistical Properties of the Buddy System
Journal of the ACM | 1970-01-01 | Paper |
