| | |
Monroe M. Newborn
List of publications from the DBLP Bibliography Server - FAQ
- CSB - MetaPress - Google - Bing - Yahoo
 | 2004 | |
|---|---|---|
| 21 |      | Monty Newborn, Zongyan Wang: Octopus: Combining Learning and Parallel Search. J. Autom. Reasoning 33(2): 171-218 (2004) |
| 2003 | ||
| 20 | | Monty Newborn: Deep Blue - an artificial intelligence milestone. Springer 2003: I-XIV, 1-346 |
| 19 | | Choon Kyu Kim, Monty Newborn: Competitive Semantic Tree Theorem Prover with Resolutions. PVM/MPI 2003: 227-231 |
| 2001 | ||
| 18 | | Monty Newborn: Automated theorem proving - theory and practice. Springer 2001: I-XIII, 1-231 |
| 2000 | ||
| 17 | | Monty Newborn: Deep Blue's contribution to AI. Ann. Math. Artif. Intell. 28(1-4): 27-30 (2000) |
| 1998 | ||
| 16 | | 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) |
| 1997 | ||
| 15 |  | Monty Newborn: Kasparov versus Deep Blue - computer chess comes of age. Springer 1997: I-XIII, 1-322 |
| 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) |
| 7 | | Monroe M. Newborn: Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 687-694 (1988) |
| 1980 | ||
| 6 | | Monroe 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 SWAT (FOCS) 1969: 194-212 |
| 1968 | ||
| 1 | | Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn: Iteratively Realized Sequential Circuits SWAT (FOCS) 1968: 431-448 |
| 1 | Mohammed Almulla | [14] [16] |
| 2 | Thomas F. Arnold | [1] [2] |
| 3 | Choon Kyu Kim | [19] |
| 4 | Danny Kopec | [8] [9] [12] [13] |
| 5 | William O. J. Moser | [6] |
| 6 | Brian G. Patrick | [14] |
| 7 | Chung-Jen Tan | [1] |
| 8 | Mike Valvo | [13] |
| 9 | Zongyan Wang | [21] |
| 10 | Qingxun Yu | [16] |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page