Monroe M. Newborn

33 papers Journal 23Unranked 10
YearRankTypeTitle / Venue / Authors
2020 J jnl
Pitting computers against each other ... in chess.
Commun. ACM
Monroe M. Newborn
1998 J jnl
Heuristics Used by HERBY for Semantic Tree Theorem Proving.
Ann. Math. Artif. Intell.
Qingxun Yu, Mohammed Almulla, Monroe M. Newborn
1996 J jnl
The practicality of generating semantic trees for proofs of unsatisfiability.
Int. J. Comput. Math.
Mohammed Almulla, Monroe M. Newborn
1992 J jnl
An Upper Bound on the Time Complexity of Iterative-Deepening-A.
Ann. Math. Artif. Intell.
Brian G. Patrick, Mohammed Almulla, Monroe M. Newborn
1989 J jnl
Computer Chess: Ten Years of Significant Progress.
Adv. Comput.
Monroe M. Newborn
1988 J jnl
Unsynchronized Iteratively Deepening Parallel Alpha-Beta Search.
IEEE Trans. Pattern Anal. Mach. Intell.
Monroe M. Newborn
1987 J jnl
The 18th ACM's North American Computer-Chess Championship.
ICCA J.
Monroe M. Newborn
1985 J jnl
A Hypothesis concerning the Strength of Chess Programs.
ICCA J.
Monroe M. Newborn
1985 — conf
A parallel search chess program.
ACM Annual Conference
Monroe M. Newborn
1985 J jnl
The Forthcoming Triennial Meeting.
ICCA J.
Monroe M. Newborn
1984 J jnl
Dues, Membership and the Next World Championship.
ICCA J.
Monroe M. Newborn
1984 J jnl
News, Information, Tournaments and Reports.
ICCA J.
Monroe M. Newborn
1981 — conf
Computer chess: Master level play in 1981?
ACM Annual Conference
Ben Mittman, Tony Marsland, Monroe M. Newborn, Kathe Spracklen, Ken Thompson
1980 J jnl
JCIT hosts Israel's first major computer chess tournament.
SIGART Newsl.
Monroe M. Newborn
1980 J jnl
Optimal crossing-free Hamiltonian circuit drawings of K
J. Comb. Theory B
Monroe M. Newborn, William O. J. Moser
1979 J jnl
Recent Progress in Computer Chess.
Adv. Comput.
Monroe M. Newborn
1978 — conf
Computer Chess: Recent Progress and Future Expectations.
Jerusalem Conference on Information Technology
Monroe M. Newborn
1977 J jnl
The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores.
Artif. Intell.
Monroe M. Newborn
1977 — conf
The principal continuation and the killer heuristic.
ACM Annual Conference
Selim G. Akl, Monroe M. Newborn
1976 — conf
General interest (Paper Session).
ACM Annual Conference
Frederick E. Petry, Alan W. Biermann, Monroe M. Newborn, Helmut Kerner, Werner Beyerle, Kathleen M. Shockley, Daniel P. Friedman
1976 — conf
Reconsideration of a theorem on admissible ordered search algorithms.
ACM Annual Conference
Monroe M. Newborn
1976 — conf
SIGTPC (Panel Session).
ACM Annual Conference
Monroe M. Newborn
1973 J jnl
A Study of Trigger Machines.
IEEE Trans. Computers
Hsieh T. Hao, Monroe M. Newborn
1972 J jnl
The Simplification of Sequential Machines with Input Restrictions.
IEEE Trans. Computers
Joonki Kim, Monroe M. Newborn
1972 J jnl
Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits.
IEEE Trans. Computers
Monroe M. Newborn, Thomas F. Arnold
1970 J jnl
Iteratively Realized Sequential Circuits.
IEEE Trans. Computers
Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn
1970 J jnl
R70-19 Frequency of Decomposability Among Machines with a Large Number of States.
IEEE Trans. Computers
Monroe M. Newborn
1969 — conf
Iteratively Realized Sequential Circuits: Further Considerations
SWAT
Thomas F. Arnold, Monroe M. Newborn
1968 J jnl
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines.
IEEE Trans. Computers
Monroe M. Newborn
1968 — conf
Iteratively Realized Sequential Circuits
SWAT
Thomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn
1968 J jnl
Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines.
IEEE Trans. Computers
Monroe M. Newborn
1968 — conf
Uniform modular realization of sequential machines.
ACM National Conference
Edward P. Hsieh, Chung-Jen Tan, Monroe M. Newborn
1967 J jnl
Note on Binary Input-Binary Output Finite-Memory Sequential Machines.
IEEE Trans. Electron. Comput.
Monroe M. Newborn