Search the dblp DataBase
Monroe M. Newborn :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Thomas F. Arnold , Monroe M. Newborn Iteratively Realized Sequential Circuits: Further Considerations [Citation Graph (0, 0)][DBLP ] FOCS, 1969, pp:194-212 [Conf ] Thomas F. Arnold , Chung-Jen Tan , Monroe M. Newborn Iteratively Realized Sequential Circuits [Citation Graph (0, 0)][DBLP ] FOCS, 1968, pp:431-448 [Conf ] Monroe M. Newborn Computer Chess: Recent Progress and Future Expectations. [Citation Graph (0, 0)][DBLP ] Jerusalem Conference on Information Technology, 1978, pp:189-192 [Conf ] Monroe M. Newborn Recent Progress in Computer Chess. [Citation Graph (0, 0)][DBLP ] Advances in Computers, 1979, v:18, n:, pp:59-117 [Journal ] Monroe M. Newborn Computer Chess: Ten Years of Significant Progress. [Citation Graph (0, 0)][DBLP ] Advances in Computers, 1989, v:29, n:, pp:197-250 [Journal ] Monroe M. Newborn The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 1977, v:8, n:2, pp:137-153 [Journal ] Brian G. Patrick , Mohammed Almulla , Monroe M. Newborn An Upper Bound on the Time Complexity of Iterative-Deepening-A. [Citation Graph (0, 0)][DBLP ] Ann. Math. Artif. Intell., 1992, v:5, n:2-4, pp:265-277 [Journal ] Qingxun Yu , Mohammed Almulla , Monroe M. Newborn Heuristics Used by HERBY for Semantic Tree Theorem Proving. [Citation Graph (0, 0)][DBLP ] Ann. Math. Artif. Intell., 1998, v:23, n:3-4, pp:247-266 [Journal ] Monroe M. Newborn , W. O. J. Moser Optimal crossing-free Hamiltonian circuit drawings of Kn . [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1980, v:29, n:1, pp:13-26 [Journal ] Monroe M. Newborn Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Pattern Anal. Mach. Intell., 1988, v:10, n:5, pp:687-694 [Journal ] Search in 0.001secs, Finished in 0.002secs