Paul Walton Purdom Jr.

According to our database1, Paul Walton Purdom Jr.
  • authored at least 39 papers between 1970 and 2013.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
An Evaluation of Two Alternatives to Minimax
CoRR, 2013

2000
Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary trees.
Bioinformatics, 2000

1997
Probe Order Backtracking.
SIAM J. Comput., 1997

Backtracking and Random Constraint Satisfaction.
Ann. Math. Artif. Intell., 1997

1996
Backtrack Searching in the Presence of Symmetry.
Nord. J. Comput., 1996

Backtracking and probing.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1994
Average Time for the Full Pure Literal Rule.
Inf. Sci., 1994

1993
Average Time Analysis of Clause Order Backtracking.
SIAM J. Comput., 1993

1991
A practical unification algorithm.
Inf. Sci., 1991

1989
Exponential Average Time for the Pure Literal Rule.
SIAM J. Comput., 1989

A New Base Change Algorithm for Permutation Groups.
SIAM J. Comput., 1989

1988
An Exponential Lower Bound for the Pure Literal Rule.
Inf. Process. Lett., 1988

Backtrack Searching in the Presence of Symmetry.
Proceedings of the Applied Algebra, 1988

1987
Tree Matching and Simplification.
Softw., Pract. Exper., 1987

Polynomial-average-time satisfiability problems.
Inf. Sci., 1987

Detecting Looping Simplifications.
Proceedings of the Rewriting Techniques and Applications, 2nd International Conference, 1987

1986
Experiments on alternatives to minimax.
International Journal of Parallel Programming, 1986

Intelligent Backtracking Using Symmetry.
Proceedings of the Fall Joint Computer Conference, November 2-6, 1986, Dallas, Texas, USA, 1986

1985
The Pure Literal Rule and Polynomial Average Time.
SIAM J. Comput., 1985

An Evaluation of Two Alternatives to Minimax.
Proceedings of the UAI '85: Proceedings of the First Annual Conference on Uncertainty in Artificial Intelligence, 1985

Fast Many-to-One Matching Algorithms.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

1984
A Methodology and Notation for Compiler Front End Design.
Softw., Pract. Exper., 1984

1983
An Analysis of Backtracking with Search Rearrangement.
SIAM J. Comput., 1983

Search Rearrangement Backtracking and Polynomial Average Time.
Artif. Intell., 1983

A Theory of Game Trees.
Proceedings of the National Conference on Artificial Intelligence. Washington, 1983

1982
An Empirical Comparison of Backtracking Algorithms.
IEEE Trans. Pattern Anal. Mach. Intell., 1982

Average Time Analyses of Simplified Davis-Putnam Procedures.
Inf. Process. Lett., 1982

Evaluating Search Methods Analytically.
Proceedings of the National Conference on Artificial Intelligence. Pittsburgh, 1982

1981
An Average Time Analysis of Backtracking.
SIAM J. Comput., 1981

Backtracking with Multi-Level Dynamic Search Rearrangement.
Acta Inf., 1981

Parsing Extended LR(k) Grammars.
Acta Inf., 1981

How to Search Efficiently.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

1980
Exact formulas for the buddy system.
Inf. Sci., 1980

Semantic Routines and LR(k) Parsers.
Acta Inf., 1980

1978
Tree Size by Partial Backtracking.
SIAM J. Comput., 1978

1972
Analysis of Two Time-Sharing Queueing Models.
J. ACM, 1972

Immediate Predominators in a Directed Graph [H] (Algorithm 430).
Commun. ACM, 1972

1970
Statistical Properties of the Buddy System.
J. ACM, 1970

A Transitive Closure Algorithm.
BIT, 1970


  Loading...