Monroe M. Newborn

Available identifiers

Publication	Date of Publication	Type
The practicality of generating semantic trees for proofs of unsatisfiability	2002-12-19	Paper
Heuristics used by HERBY for semantic tree theorem proving	1999-02-02	Paper
An upper bound on the time complexity of iterative-deepening-\(A^*\)	1997-05-13	Paper
Unsynchronized iteratively deepening parallel alpha-beta search	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3911404	1981-01-01	Paper
Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)	1980-01-01	Paper
Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)	1980-01-01	Paper
Placing Counters to Illustrate Burnside's Lemma	1979-01-01	Paper
The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4109264	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4128427	1973-01-01	Paper
A Study of Trigger Machines	1973-01-01	Paper
The Simplification of Sequential Machines with Input Restrictions	1972-01-01	Paper
Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5639642	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4050521	1969-01-01	Paper
Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines	1968-01-01	Paper
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines	1968-01-01	Paper
Gimpel's Reduction Technique Extended to the Covering Problem with Costs	1967-01-01	Paper

This page was built for person: Monroe M. Newborn