Monty Newborn

Monty Newborn, Zongyan Wang: Octopus: Combining Learning and Parallel Search. J. Autom. Reasoning 33(2): 171-218 (2004)

Monty Newborn: Deep Blue - an artificial intelligence milestone. Springer 2003, isbn 978-0-387-95461-5, pp. I-XIV, 1-346

Choon Kyu Kim, Monty Newborn: Competitive Semantic Tree Theorem Prover with Resolutions. PVM/MPI 2003: 227-231

Monty Newborn: Automated theorem proving - theory and practice. Springer 2001, isbn 978-0-387-95075-4, pp. I-XIII, 1-231

Monty Newborn: Deep Blue's contribution to AI. Ann. Math. Artif. Intell. 28(1-4): 27-30 (2000)

Qingxun Yu, Mohammed Almulla, Monroe M. Newborn: Heuristics Used by HERBY for Semantic Tree Theorem Proving. Ann. Math. Artif. Intell. 23(3-4): 247-266 (1998)

Monty Newborn: Kasparov versus Deep Blue - computer chess comes of age. Springer 1997, isbn 978-0-387-94820-1, pp. I-XIII, 1-322

Brian G. Patrick, Mohammed Almulla, Monroe M. Newborn: An Upper Bound on the Time Complexity of Iterative-Deepening-A. Ann. Math. Artif. Intell. 5(2-4): 265-277 (1992)

Danny Kopec, Monty Newborn, Mike Valvo: The 22nd Annual ACM International Computer Chess Championship. Commun. ACM 35(11): 100-110 (1992)

Monty Newborn, Danny Kopec: The 21st ACM North American Computer Chess Championship. Commun. ACM 34(11): 84-92 (1991)

Monty Newborn: The 20th Annual ACM North American Computer Chess Championship. Commun. ACM 33(7): 93-104 (1990)

Monroe M. Newborn: Computer Chess: Ten Years of Significant Progress. Advances in Computers 29: 197-250 (1989)

Monty Newborn, Danny Kopec: Results of the Nineteenth ACM North American Computer Chess Championship. Commun. ACM 32(10): 1225-1230 (1989)

Monty Newborn, Danny Kopec: Results of ACM's Eighteenth Computer Chess Championship. Commun. ACM 31(8): 992-995 (1988)

Monroe M. Newborn: Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 687-694 (1988)

Monroe M. Newborn, William O. J. Moser: Optimal crossing-free Hamiltonian circuit drawings of K_n. J. Comb. Theory, Ser. B 29(1): 13-26 (1980)

Monroe M. Newborn: Recent Progress in Computer Chess. Advances in Computers 18: 59-117 (1979)

Monroe M. Newborn: Computer Chess: Recent Progress and Future Expectations. Jerusalem Conference on Information Technology 1978: 189-192

Monroe M. Newborn: The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores. Artif. Intell. 8(2): 137-153 (1977)

Thomas F. Arnold, Monroe M. Newborn: Iteratively Realized Sequential Circuits: Further Considerations. SWAT (FOCS) 1969: 194-212

Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn: Iteratively Realized Sequential Circuits. SWAT (FOCS) 1968: 431-448