dblp.uni-trier.dewww.uni-trier.de

Monty Newborn Vis

Monroe M. Newborn

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2004
18EEMonty Newborn, Zongyan Wang: Octopus: Combining Learning and Parallel Search. J. Autom. Reasoning 33(2): 171-218 (2004)
2003
17EEChoon Kyu Kim, Monty Newborn: Competitive Semantic Tree Theorem Prover with Resolutions. PVM/MPI 2003: 227-231
2000
16 Monty Newborn: Deep Blue's contribution to AI. Ann. Math. Artif. Intell. 28(1-4): 27-30 (2000)
1998
15 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)
1992
14 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)
13 Danny Kopec, Monty Newborn, Mike Valvo: The 22nd Annual ACM International Computer Chess Championship. Commun. ACM 35(11): 100-110 (1992)
1991
12 Monty Newborn, Danny Kopec: The 21st ACM North American Computer Chess Championship. Commun. ACM 34(11): 84-92 (1991)
1990
11 Monty Newborn: The 20th Annual ACM North American Computer Chess Championship. Commun. ACM 33(7): 93-104 (1990)
1989
10 Monroe M. Newborn: Computer Chess: Ten Years of Significant Progress. Advances in Computers 29: 197-250 (1989)
9 Monty Newborn, Danny Kopec: Results of the Nineteenth ACM North American Computer Chess Championship. Commun. ACM 32(10): 1225-1230 (1989)
1988
8 Monty Newborn, Danny Kopec: Results of ACM's Eighteenth Computer Chess Championship. Commun. ACM 31(8): 992-995 (1988)
7EEMonroe M. Newborn: Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 687-694 (1988)
1980
6EEMonroe M. Newborn, William O. J. Moser: Optimal crossing-free Hamiltonian circuit drawings of Kn. J. Comb. Theory, Ser. B 29(1): 13-26 (1980)
1979
5 Monroe M. Newborn: Recent Progress in Computer Chess. Advances in Computers 18: 59-117 (1979)
1978
4 Monroe M. Newborn: Computer Chess: Recent Progress and Future Expectations. Jerusalem Conference on Information Technology 1978: 189-192
1977
3 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)
1969
2 Thomas F. Arnold, Monroe M. Newborn: Iteratively Realized Sequential Circuits: Further Considerations FOCS 1969: 194-212
1968
1 Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn: Iteratively Realized Sequential Circuits FOCS 1968: 431-448

Coauthor Index

1Mohammed Almulla [14] [15]
2Thomas F. Arnold [1] [2]
3Choon Kyu Kim [17]
4Danny Kopec [8] [9] [12] [13]
5William O. J. Moser [6]
6Brian G. Patrick [14]
7Chung-Jen Tan [1]
8Mike Valvo [13]
9Zongyan Wang [18]
10Qingxun Yu [15]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)