Monty Newborn

Affiliations:
  • McGill University, Montreal, Canada


According to our database1, Monty Newborn authored at least 62 papers between 1967 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Mad Monty Chess.
J. Int. Comput. Games Assoc., 2021

2020
The laughing is over.
J. Int. Comput. Games Assoc., 2020

An analysis of games played in world computer chess championships over the years.
J. Int. Comput. Games Assoc., 2020

Pitting computers against each other ... in chess.
Commun. ACM, 2020

2014
Computer Chess Endgame Play with Pawns: Then and Now.
J. Int. Comput. Games Assoc., 2014

2004
Octopus: Combining Learning and Parallel Search.
J. Autom. Reason., 2004

2003
Competitive Semantic Tree Theorem Prover with Resolutions.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface,10th European PVM/MPI Users' Group Meeting, Venice, Italy, September 29, 2003

Deep Blue - an artificial intelligence milestone.
Springer, ISBN: 978-0-387-95461-5, 2003

2001
Automated theorem proving - theory and practice.
Springer, ISBN: 978-0-387-95075-4, 2001

2000
Deep Blue's contribution to AI.
Ann. Math. Artif. Intell., 2000

1998
Heuristics Used by HERBY for Semantic Tree Theorem Proving.
Ann. Math. Artif. Intell., 1998

1997
Kasparov Versus Deep Blue.
J. Int. Comput. Games Assoc., 1997

Crafty Goes Deep.
J. Int. Comput. Games Assoc., 1997

Kasparov versus Deep Blue - computer chess comes of age.
Springer, ISBN: 978-0-387-94820-1, 1997

1996
The practicality of generating semantic trees for proofs of unsatisfiability.
Int. J. Comput. Math., 1996

1995
The ACM Computer-Chess Challenge.
J. Int. Comput. Games Assoc., 1995

The ACM Computer-Chess Workshop. Recent Advances in Computer Chess.
J. Int. Comput. Games Assoc., 1995

A Eulogy for Mikhail Moiseivich Botvinnik.
J. Int. Comput. Games Assoc., 1995

The Participants of the 8th World Computer-Chess Championship.
J. Int. Comput. Games Assoc., 1995

1994
The 24th ACM International Computer-Chess Championship.
J. Int. Comput. Games Assoc., 1994

The ACM'S 24th International Computer-Chess Championship.
J. Int. Comput. Games Assoc., 1994

1993
Limited Computation.
J. Int. Comput. Games Assoc., 1993

1992
The 22nd Annual ACM International Computer Chess Championship.
Commun. ACM, 1992

An Upper Bound on the Time Complexity of Iterative-Deepening-A.
Ann. Math. Artif. Intell., 1992

1991
The 21st ACM North American Computer Chess Championship.
Commun. ACM, 1991

1990
How Computers Play Chess.
J. Int. Comput. Games Assoc., 1990

The 20th Annual ACM North American Computer Chess Championship.
Commun. ACM, 1990

1989
Results of the Nineteenth ACM North American Computer Chess Championship.
Commun. ACM, 1989

Computer Chess: Ten Years of Significant Progress.
Adv. Comput., 1989

1988
Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search.
IEEE Trans. Pattern Anal. Mach. Intell., 1988

Results of ACM's Eighteenth Computer Chess Championship.
Commun. ACM, 1988

1987
The 18th ACM's North American Computer-Chess Championship.
J. Int. Comput. Games Assoc., 1987

1986
The 1986 ACM/IEEE Conference.
J. Int. Comput. Games Assoc., 1986

Looking Back and Ahead.
J. Int. Comput. Games Assoc., 1986

1985
A Hypothesis concerning the Strength of Chess Programs.
J. Int. Comput. Games Assoc., 1985

The Forthcoming Triennial Meeting.
J. Int. Comput. Games Assoc., 1985

A parallel search chess program.
Proceedings of the 1985 ACM annual conference on The range of computing: mid-80's perspective: mid-80's perspective, 1985

1984
News, Information, Tournaments and Reports.
J. Int. Comput. Games Assoc., 1984

Dues, Membership and the Next World Championship.
J. Int. Comput. Games Assoc., 1984

1983
Ringing out the old, ringing in the new.
J. Int. Comput. Games Assoc., 1983

1981
A brighter future for Soviet computer chess?
J. Int. Comput. Games Assoc., 1981

Computer chess: Master level play in 1981?
Proceedings of the ACM 1981 Annual Conference, Los Angeles, CA, USA, November 9-11, 1981., 1981

1980
JCIT hosts Israel's first major computer chess tournament.
SIGART Newsl., 1980

Optimal crossing-free Hamiltonian circuit drawings of K<sub>n</sub>.
J. Comb. Theory B, 1980

1979
Recent Progress in Computer Chess.
Adv. Comput., 1979

1978
Computer Chess: Recent Progress and Future Expectations.
Proceedings of the Information Technology '78: Proceedings of the 3rd Jerusalem Conference on Information Technology (JCIT3), 1978

1977
The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores.
Artif. Intell., 1977

The principal continuation and the killer heuristic.
Proceedings of the 1977 annual conference, 1977

1976
General interest (Paper Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

Reconsideration of a theorem on admissible ordered search algorithms.
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

SIGTPC (Panel Session).
Proceedings of the 1976 Annual Conference, Houston, Texas, USA, October 20-22, 1976, 1976

1973
A Study of Trigger Machines.
IEEE Trans. Computers, 1973

Results of the fourth annual U.S. computer chess tournament.
SIGART Newsl., 1973

1972
Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits.
IEEE Trans. Computers, 1972

The Simplification of Sequential Machines with Input Restrictions.
IEEE Trans. Computers, 1972

1970
R70-19 Frequency of Decomposability Among Machines with a Large Number of States.
IEEE Trans. Computers, 1970

Iteratively Realized Sequential Circuits.
IEEE Trans. Computers, 1970

1969
Iteratively Realized Sequential Circuits: Further Considerations
Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

1968
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines.
IEEE Trans. Computers, 1968

Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines.
IEEE Trans. Computers, 1968

Uniform modular realization of sequential machines.
Proceedings of the 23rd ACM national conference, 1968

1967
Note on Binary Input-Binary Output Finite-Memory Sequential Machines.
IEEE Trans. Electron. Comput., 1967


  Loading...