#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1955

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom
- AAECC
- 1988

- Paul Walton Purdom
- Artif. Intell.
- 1983

- Allen Goldberg, Paul Walton Purdom, Cynthia A. Brown
- Inf. Process. Lett.
- 1982

- Paul Walton Purdom
- BIT
- 1970

- Paul Walton Purdom, Cynthia A. Brown
- SIAM J. Comput.
- 1985

For a simple parameterized model of conjunctive normal form predicates, we show that a simplified version of the Davis-Putnam procedure can, for many values of the parameters, solve the satisfiability problem in polynomial average time. Let v be the number of variables, t(v) the number of clauses in a predicate, and p(v) the probability that a given literal… (More)

- Cynthia A. Brown, Paul Walton Purdom
- SIAM J. Comput.
- 1981

- Khaled M. Bugrara, Paul Walton Purdom
- SIAM J. Comput.
- 1993

Abstract. Backtracking algorithms solve problemsby selecting a variable and assigning each possible value to the variable. The resulting subproblems are simplified and solved recursively. Simple backtracking selects variables in a fixed order. Clause order backtracking selects variables from the first nontrivial clause that has not yet been satisfied.… (More)

- Khaled M. Bugrara, Youfang Pan, Paul Walton Purdom
- SIAM J. Comput.
- 1989

- Paul Walton Purdom, Edward F. Moore
- Commun. ACM
- 1972

We assume a directed graph whose nodes are labeled by integers between 1 and <italic>n</italic>. The arcs of this graph correspond to the flow of control between blocks of a computer program. The initial node of this graph (corresponding to the entry point of the program) is labeled by the integer 1. For optimizing the object code generated by a compiler,… (More)

- Paul Walton Purdom, Cynthia A. Brown
- Acta Informatica
- 1981

An extended LR(k) (ELR(k)) grammar is a context free grammar in which the right sides of the productions are regular expressions and which can be parsed from left to right with k symbol look-ahead. We present a practical algorithm for producing small fast parsers directly from certain ELR(k) grammars, and an algorithm for converting the remaining ELR(k)… (More)