default search action
Monty Newborn
Person information
- affiliation: McGill University, Montreal, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j49]Monty Newborn:
Mad Monty Chess. J. Int. Comput. Games Assoc. 43(1): 55-56 (2021) - 2020
- [j48]Monroe M. Newborn:
Pitting computers against each other ... in chess. Commun. ACM 63(12): 6-7 (2020) - [j47]Monty Newborn:
An analysis of games played in world computer chess championships over the years. J. Int. Comput. Games Assoc. 42(2-3): 99-105 (2020) - [j46]Monty Newborn:
The laughing is over. J. Int. Comput. Games Assoc. 42(2-3): 178-180 (2020)
2010 – 2019
- 2014
- [j45]Monty Newborn, Robert M. Hyatt:
Computer Chess Endgame Play with Pawns: Then and Now. J. Int. Comput. Games Assoc. 37(4): 195-206 (2014)
2000 – 2009
- 2004
- [j44]Monty Newborn, Zongyan Wang:
Octopus: Combining Learning and Parallel Search. J. Autom. Reason. 33(2): 171-218 (2004) - 2003
- [b3]Monty Newborn:
Deep Blue - an artificial intelligence milestone. Springer 2003, ISBN 978-0-387-95461-5, pp. I-XIV, 1-346 - [c11]Choon Kyu Kim, Monty Newborn:
Competitive Semantic Tree Theorem Prover with Resolutions. PVM/MPI 2003: 227-231 - 2001
- [b2]Monty Newborn:
Automated theorem proving - theory and practice. Springer 2001, ISBN 978-0-387-95075-4, pp. I-XIII, 1-231 - 2000
- [j43]Monty Newborn:
Deep Blue's contribution to AI. Ann. Math. Artif. Intell. 28(1-4): 27-30 (2000)
1990 – 1999
- 1998
- [j42]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
- [b1]Monty Newborn:
Kasparov versus Deep Blue - computer chess comes of age. Springer 1997, ISBN 978-0-387-94820-1, pp. I-XIII, 1-322 - [j41]Monty Newborn:
Kasparov Versus Deep Blue. J. Int. Comput. Games Assoc. 20(1): 38 (1997) - [j40]Robert M. Hyatt, Monty Newborn:
Crafty Goes Deep. J. Int. Comput. Games Assoc. 20(2): 79-86 (1997) - 1996
- [j39]Mohammed Almulla
The practicality of generating semantic trees for proofs of unsatisfiability. Int. J. Comput. Math. 62(1-2): 45-61 (1996) - 1995
- [j38]David N. L. Levy, Tony Marsland, Monty Newborn:
The Participants of the 8th World Computer-Chess Championship. J. Int. Comput. Games Assoc. 18(1): 53-54 (1995) - [j37]Monty Newborn:
A Eulogy for Mikhail Moiseivich Botvinnik. J. Int. Comput. Games Assoc. 18(2): 91-92 (1995) - [j36]Monty Newborn:
The ACM Computer-Chess Workshop. Recent Advances in Computer Chess. J. Int. Comput. Games Assoc. 18(4): 248-249 (1995) - [j35]Monty Newborn:
The ACM Computer-Chess Challenge. J. Int. Comput. Games Assoc. 18(4): 248 (1995) - 1994
- [j34]Monty Newborn:
The ACM'S 24th International Computer-Chess Championship. J. Int. Comput. Games Assoc. 17(1): 44 (1994) - [j33]Monty Newborn:
The 24th ACM International Computer-Chess Championship. J. Int. Comput. Games Assoc. 17(3): 159-164 (1994) - 1993
- [j32]Ray Lopez, Monty Newborn:
Limited Computation. J. Int. Comput. Games Assoc. 16(2): 118-119 (1993) - 1992
- [j31]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) - [j30]Danny Kopec, Monty Newborn, Mike Valvo:
The 22nd Annual ACM International Computer Chess Championship. Commun. ACM 35(11): 100-110 (1992) - 1991
- [j29]Monty Newborn, Danny Kopec:
The 21st ACM North American Computer Chess Championship. Commun. ACM 34(11): 84-92 (1991) - 1990
- [j28]Monty Newborn:
The 20th Annual ACM North American Computer Chess Championship. Commun. ACM 33(7): 93-104 (1990) - [j27]David N. L. Levy, Monty Newborn:
How Computers Play Chess. J. Int. Comput. Games Assoc. 13(3): 144 (1990)
1980 – 1989
- 1989
- [j26]Monroe M. Newborn:
Computer Chess: Ten Years of Significant Progress. Adv. Comput. 29: 197-250 (1989) - [j25]Monty Newborn, Danny Kopec:
Results of the Nineteenth ACM North American Computer Chess Championship. Commun. ACM 32(10): 1225-1230 (1989) - 1988
- [j24]Monty Newborn, Danny Kopec:
Results of ACM's Eighteenth Computer Chess Championship. Commun. ACM 31(8): 992-995 (1988) - [j23]Monroe M. Newborn:
Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search. IEEE Trans. Pattern Anal. Mach. Intell. 10(5): 687-694 (1988) - 1987
- [j22]Monroe M. Newborn:
The 18th ACM's North American Computer-Chess Championship. J. Int. Comput. Games Assoc. 10(2): 102-105 (1987) - 1986
- [j21]Monty Newborn:
Looking Back and Ahead. J. Int. Comput. Games Assoc. 9(2): 90 (1986) - [j20]Monty Newborn:
The 1986 ACM/IEEE Conference. J. Int. Comput. Games Assoc. 9(2): 118-123 (1986) - 1985
- [j19]Monroe M. Newborn:
The Forthcoming Triennial Meeting. J. Int. Comput. Games Assoc. 8(4): 207-208 (1985) - [j18]Monroe M. Newborn:
A Hypothesis concerning the Strength of Chess Programs. J. Int. Comput. Games Assoc. 8(4): 209-215 (1985) - [c10]Monroe M. Newborn:
A parallel search chess program. ACM Annual Conference 1985: 272-277 - 1984
- [j17]Monroe M. Newborn:
Dues, Membership and the Next World Championship. J. Int. Comput. Games Assoc. 7(4): 181-183 (1984) - [j16]Monroe M. Newborn:
News, Information, Tournaments and Reports. J. Int. Comput. Games Assoc. 7(4): 203-209 (1984) - 1983
- [j15]Monty Newborn:
Ringing out the old, ringing in the new. J. Int. Comput. Games Assoc. 6(4): 52-54 (1983) - 1981
- [j14]Tony Marsland, Monty Newborn:
A brighter future for Soviet computer chess? J. Int. Comput. Games Assoc. 4(1): 4-7 (1981) - [c9]Ben Mittman, Tony Marsland, Monroe M. Newborn, Kathe Spracklen, Ken Thompson:
Computer chess: Master level play in 1981? ACM Annual Conference 1981: 108 - 1980
- [j13]Monroe M. Newborn, William O. J. Moser:
Optimal crossing-free Hamiltonian circuit drawings of Kn. J. Comb. Theory B 29(1): 13-26 (1980) - [j12]Monroe M. Newborn:
JCIT hosts Israel's first major computer chess tournament. SIGART Newsl. 69: 10 (1980)
1970 – 1979
- 1979
- [j11]Monroe M. Newborn:
Recent Progress in Computer Chess. Adv. Comput. 18: 59-117 (1979) - 1978
- [c8]Monroe M. Newborn:
Computer Chess: Recent Progress and Future Expectations. Jerusalem Conference on Information Technology 1978: 189-192 - 1977
- [j10]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) - [c7]Selim G. Akl, Monroe M. Newborn:
The principal continuation and the killer heuristic. ACM Annual Conference 1977: 466-473 - 1976
- [c6]Monroe M. Newborn:
SIGTPC (Panel Session). ACM Annual Conference 1976: 523-524 - [c5]Frederick E. Petry, Alan W. Biermann, Monroe M. Newborn, Helmut Kerner, Werner Beyerle, Kathleen M. Shockley, Daniel P. Friedman:
General interest (Paper Session). ACM Annual Conference 1976: 529 - [c4]Monroe M. Newborn:
Reconsideration of a theorem on admissible ordered search algorithms. ACM Annual Conference 1976: 535-538 - 1973
- [j9]Ben Mittman, Monty Newborn:
Results of the fourth annual U.S. computer chess tournament. SIGART Newsl. 42: 36-52 (1973) - [j8]Hsieh T. Hao, Monroe M. Newborn:
A Study of Trigger Machines. IEEE Trans. Computers 22(12): 1123-1131 (1973) - 1972
- [j7]Monroe M. Newborn, Thomas F. Arnold:
Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits. IEEE Trans. Computers 21(1): 63-79 (1972) - [j6]Joonki Kim, Monroe M. Newborn:
The Simplification of Sequential Machines with Input Restrictions. IEEE Trans. Computers 21(12): 1440-1443 (1972) - 1970
- [j5]Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn:
Iteratively Realized Sequential Circuits. IEEE Trans. Computers 19(1): 54-66 (1970) - [j4]Monroe M. Newborn:
R70-19 Frequency of Decomposability Among Machines with a Large Number of States. IEEE Trans. Computers 19(7): 658 (1970)
1960 – 1969
- 1969
- [c3]Thomas F. Arnold, Monroe M. Newborn:
Iteratively Realized Sequential Circuits: Further Considerations. SWAT 1969: 194-212 - 1968
- [j3]Monroe M. Newborn:
Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines. IEEE Trans. Computers 17(1): 67-71 (1968) - [j2]Monroe M. Newborn:
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines. IEEE Trans. Computers 17(7): 697-699 (1968) - [c2]Edward P. Hsieh, Chung-Jen Tan, Monroe M. Newborn:
Uniform modular realization of sequential machines. ACM National Conference 1968: 613-621 - [c1]Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn:
Iteratively Realized Sequential Circuits. SWAT 1968: 431-448 - 1967
- [j1]Monroe M. Newborn:
Note on Binary Input-Binary Output Finite-Memory Sequential Machines. IEEE Trans. Electron. Comput. 16(4): 514 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: