Paul Walton Purdom Jr.

Phillip G. Bradford

Koichiro Tamura

Sudhir Kumar

Bioinform., 2000

1997

Probe Order Backtracking.

[BibT_eX]

[DOI]

G. Neil Haven

SIAM J. Comput., 1997

Backtracking and Random Constraint Satisfaction.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1997

1996

Backtrack Searching in the Presence of Symmetry.

[BibT_eX]

Nord. J. Comput., 1996

Backtracking and probing.

[BibT_eX]

[DOI]

G. Neil Haven

Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1994

Average Time for the Full Pure Literal Rule.

[BibT_eX]

[DOI]

Inf. Sci., 1994

1993

Average Time Analysis of Clause Order Backtracking.

[BibT_eX]

[DOI]

Khaled M. Bugrara

SIAM J. Comput., 1993

1991

A practical unification algorithm.

[BibT_eX]

[DOI]

Inf. Sci., 1991

1989

Exponential Average Time for the Pure Literal Rule.

[BibT_eX]

[DOI]

Khaled M. Bugrara

Youfang Pan

SIAM J. Comput., 1989

A New Base Change Algorithm for Permutation Groups.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Fast Group Membership Using a Strong Generating Test for Permutation Groups.

[BibT_eX]

[DOI]

Gene Cooperman

Proceedings of the Computers and Mathematics, 1989

1988

An Exponential Lower Bound for the Pure Literal Rule.

[BibT_eX]

[DOI]

Khaled M. Bugrara

Inf. Process. Lett., 1988

1987

Tree Matching and Simplification.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1987

Polynomial-average-time satisfiability problems.

[BibT_eX]

[DOI]

Inf. Sci., 1987

Detecting Looping Simplifications.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

1986

Experiments on alternatives to minimax.

[BibT_eX]

[DOI]

Dana S. Nau

Int. J. Parallel Program., 1986

Estimation of minimax values.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGART International Symposium on Methodologies for Intelligent Systems, 1986

Intelligent Backtracking Using Symmetry.

[BibT_eX]

Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985

The Pure Literal Rule and Polynomial Average Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

An Evaluation of Two Alternatives to Minimax.

[BibT_eX]

[DOI]

Dana S. Nau

Proceedings of the UAI '85: Proceedings of the First Annual Conference on Uncertainty in Artificial Intelligence, 1985

Fast Many-to-One Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

1984

A Methodology and Notation for Compiler Front End Design.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1984

1983

An Analysis of Backtracking with Search Rearrangement.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

Search Rearrangement Backtracking and Polynomial Average Time.

[BibT_eX]

[DOI]

Artif. Intell., 1983

A Theory of Game Trees.

[BibT_eX]

[DOI]

Proceedings of the National Conference on Artificial Intelligence, 1983

1982

An Empirical Comparison of Backtracking Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1982

Average Time Analyses of Simplified Davis-Putnam Procedures.

[BibT_eX]

[DOI]

Allen Goldberg

Inf. Process. Lett., 1982

Evaluating Search Methods Analytically.

[BibT_eX]

[DOI]

Proceedings of the National Conference on Artificial Intelligence, 1982

1981

An Average Time Analysis of Backtracking.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

Backtracking with Multi-Level Dynamic Search Rearrangement.

[BibT_eX]

[DOI]

Edward L. Robertson

Acta Informatica, 1981

Parsing Extended <i> LR(k) </i> Grammars.

[BibT_eX]

[DOI]

Acta Informatica, 1981

How to Search Efficiently.

[BibT_eX]

[DOI]

Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

1980

Exact formulas for the buddy system.

[BibT_eX]

[DOI]

Inf. Sci., 1980

Semantic Routines and <i> LR(k) </i> Parsers.

[BibT_eX]

[DOI]

Acta Informatica, 1980

1978

Tree Size by Partial Backtracking.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

1972

Analysis of Two Time-Sharing Queueing Models.

[BibT_eX]

[DOI]

Harry C. Heacox Jr.

J. ACM, 1972

Immediate Predominators in a Directed Graph [H] (Algorithm 430).

[BibT_eX]

[DOI]

Edward F. Moore

Commun. ACM, 1972

1970

Statistical Properties of the Buddy System.

[BibT_eX]

[DOI]

Stephen M. Stigler

J. ACM, 1970

A Transitive Closure Algorithm.

[BibT_eX]