Name
Papers
Collaborators
MONROE M. NEWBORN
27
21
Citations 
PageRank 
Referers 
177
47.49
212
Referees 
References 
95
103
Search Limit
100212
Title
Citations
PageRank
Year
Heuristics used by HERBY for semantic tree theorem proving30.541998
The Practicality Of Generating Semantic Trees For Proofs Of Unsatisfiability20.411996
An Upper Bound on the Time Complexity of Iterative-Deepening-A50.541992
Computer Chess: Ten Years of Significant Progress00.341989
The 18th ACM's North American Computer-Chess Championship.00.341987
A Hypothesis concerning the Strength of Chess Programs.00.341985
A parallel search chess program122.091985
The Forthcoming Triennial Meeting.00.341985
News, Information, Tournaments and Reports.00.341984
Dues, Membership and the Next World Championship.00.341984
Computer chess: Master level play in 1981?00.341981
Optimal crossing-free Hamiltonian circuit drawings of Kn142.081980
JCIT hosts Israel's first major computer chess tournament00.341980
Recent Progress in Computer Chess73.171979
Computer Chess: Recent Progress and Future Expectations21.821978
The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores2519.411977
The principal continuation and the killer heuristic.474.911977
SIGTPC (Panel Session)00.341976
General interest (Paper Session)00.341976
A Study of Trigger Machines00.341973
Universal Modules for Bounded Signal Fan-Out Synchronous Sequential Circuits70.871972
Iteratively Realized Sequential Circuits152.021970
Iteratively realized sequential circuits: Further considerations20.471969
Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines71.151968
Uniform modular realization of sequential machines80.891968
A Synthesis Technique for Binary Input-Binary Output Synchronous Sequential Moore Machines162.561968
Note on Binary Input-Binary Output Finite-Memory Sequential Machines50.841967