Monroe M. Newborn - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2020

Pitting computers against each other ... in chessMonroe M. Newborn. CACM, 63(12):6-7, 2020. [doi]

1998

Heuristics Used by HERBY for Semantic Tree Theorem ProvingQingxun Yu, Mohammed Almulla, Monroe M. Newborn. AMAI, 23(3-4):247-266, 1998.

1996

The practicality of generating semantic trees for proofs of unsatisfiabilityMohammed Almulla, Monroe M. Newborn. ijcm, 62(1-2):45-61, 1996. [doi]

1992

An Upper Bound on the Time Complexity of Iterative-Deepening-ABrian G. Patrick, Mohammed Almulla, Monroe M. Newborn. AMAI, 5(2-4):265-277, 1992.

1989

Computer Chess: Ten Years of Significant ProgressMonroe M. Newborn. ac, 29:197-250, 1989.

1988

Unsynchronized Iteratively Deepening Parallel Alpha-Beta SearchMonroe M. Newborn. pami, 10(5):687-694, 1988. [doi]

1987

The 18th ACM's North American Computer-Chess ChampionshipMonroe M. Newborn. icga, 10(2):102-105, 1987. [doi]

1985

A parallel search chess programMonroe M. Newborn. acm 1985: 272-277 [doi]

A Hypothesis concerning the Strength of Chess ProgramsMonroe M. Newborn. icga, 8(4):209-215, 1985. [doi]

The Forthcoming Triennial MeetingMonroe M. Newborn. icga, 8(4):207-208, 1985. [doi]

1984

Dues, Membership and the Next World ChampionshipMonroe M. Newborn. icga, 7(4):181-183, 1984. [doi]

News, Information, Tournaments and ReportsMonroe M. Newborn. icga, 7(4):203-209, 1984. [doi]

1981

Computer chess: Master level play in 1981?Ben Mittman, Tony Marsland, Monroe M. Newborn, Kathe Spracklen, Ken Thompson. acm 1981: 108 [doi]

1980

Optimal crossing-free Hamiltonian circuit drawings of K::n::Monroe M. Newborn, William O. J. Moser. JCT, 29(1):13-26, 1980. [doi]

JCIT hosts Israel's first major computer chess tournamentMonroe M. Newborn. sigart, 69:10, 1980. [doi]

1979

Recent Progress in Computer ChessMonroe M. Newborn. ac, 18:59-117, 1979.

1978

Computer Chess: Recent Progress and Future ExpectationsMonroe M. Newborn. jcit 1978: 189-192

1977

The principal continuation and the killer heuristicSelim G. Akl, Monroe M. Newborn. acm 1977: 466-473 [doi]

The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node ScoresMonroe M. Newborn. ai, 8(2):137-153, 1977.

1976

SIGTPC (Panel Session)Monroe M. Newborn. acm 1976: 523-524 [doi]

Reconsideration of a theorem on admissible ordered search algorithmsMonroe M. Newborn. acm 1976: 535-538 [doi]

General interest (Paper Session)Frederick E. Petry, Alan W. Biermann, Monroe M. Newborn, Helmut Kerner, Werner Beyerle, Kathleen M. Shockley, Daniel P. Friedman. acm 1976: 529 [doi]

1973

A Study of Trigger MachinesHsieh T. Hao, Monroe M. Newborn. TC, 22(12):1123-1131, 1973. [doi]

1972

The Simplification of Sequential Machines with Input RestrictionsJoonki Kim, Monroe M. Newborn. TC, 21(12):1440-1443, 1972. [doi]

Universal Modules for Bounded Signal Fan-Out Synchronous Sequential CircuitsMonroe M. Newborn, Thomas F. Arnold. TC, 21(1):63-79, 1972. [doi]

1970

Iteratively Realized Sequential CircuitsThomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn. TC, 19(1):54-66, 1970. [doi]

R70-19 Frequency of Decomposability Among Machines with a Large Number of StatesMonroe M. Newborn. TC, 19(7):658, 1970. [doi]

1969

Iteratively Realized Sequential Circuits: Further ConsiderationsThomas F. Arnold, Monroe M. Newborn. focs 1969: 194-212

1968

Iteratively Realized Sequential CircuitsThomas F. Arnold, Chung-Jen Tan, Monroe M. Newborn. focs 1968: 431-448

Uniform modular realization of sequential machinesEdward P. Hsieh, Chung-Jen Tan, Monroe M. Newborn. acm 1968: 613-621 [doi]

Maximal Memory Binary Input-Binary Output Finite-Memory Sequential MachinesMonroe M. Newborn. TC, 17(1):67-71, 1968. [doi]

A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore MachinesMonroe M. Newborn. TC, 17(7):697-699, 1968. [doi]

1967

Note on Binary Input-Binary Output Finite-Memory Sequential MachinesMonroe M. Newborn. TC, 16(4):514, 1967. [doi]

Sign in or sign up to see more results.

runs on WebDSL