Monroe Newborn

448 total citations
20 papers, 174 citations indexed

About

Monroe Newborn is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Monroe Newborn has authored 20 papers receiving a total of 174 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 5 papers in Electrical and Electronic Engineering. Recurrent topics in Monroe Newborn's work include Artificial Intelligence in Games (5 papers), Low-power high-performance VLSI design (3 papers) and Sports Analytics and Performance (3 papers). Monroe Newborn is often cited by papers focused on Artificial Intelligence in Games (5 papers), Low-power high-performance VLSI design (3 papers) and Sports Analytics and Performance (3 papers). Monroe Newborn collaborates with scholars based in Canada, United States and Kuwait. Monroe Newborn's co-authors include Selim G. Akl, W. O. J. Moser, David Lévy, Mohammed Almulla, Monty Newborn and Mohamed R. Al-Mulla and has published in prestigious journals such as Communications of the ACM, IEEE Transactions on Computers and Journal of Combinatorial Theory Series B.

In The Last Decade

Monroe Newborn

19 papers receiving 144 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Monroe Newborn Canada 8 112 44 43 39 25 20 174
Arpad Rimmel France 9 210 1.9× 17 0.4× 79 1.8× 74 1.9× 17 0.7× 20 247
Peter Williams United States 7 263 2.3× 56 1.3× 6 0.1× 13 0.3× 61 2.4× 32 349
Marius Stănescu Canada 10 208 1.9× 26 0.6× 31 0.7× 79 2.0× 4 0.2× 16 250
Yoram Moses Israel 9 132 1.2× 60 1.4× 14 0.3× 6 0.2× 112 4.5× 15 251
Antonio Nicolosi United States 8 190 1.7× 22 0.5× 5 0.1× 24 0.6× 169 6.8× 15 294
Jesmin Jahan Tithi United States 8 87 0.8× 12 0.3× 6 0.1× 9 0.2× 38 1.5× 22 176
Rainer Feldmann Germany 8 47 0.4× 46 1.0× 5 0.1× 7 0.2× 69 2.8× 11 137
Vanessa Volz Germany 8 168 1.5× 20 0.5× 18 0.4× 92 2.4× 5 0.2× 13 219
Erik Talvitie United States 8 127 1.1× 18 0.4× 8 0.2× 6 0.2× 8 0.3× 16 140
Amrita Namtirtha India 9 59 0.5× 15 0.3× 9 0.2× 23 0.6× 63 2.5× 15 317

Countries citing papers authored by Monroe Newborn

Since Specialization
Citations

This map shows the geographic impact of Monroe Newborn's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Monroe Newborn with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Monroe Newborn more than expected).

Fields of papers citing papers by Monroe Newborn

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Monroe Newborn. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Monroe Newborn. The network helps show where Monroe Newborn may publish in the future.

Co-authorship network of co-authors of Monroe Newborn

This figure shows the co-authorship network connecting the top 25 collaborators of Monroe Newborn. A scholar is included among the top collaborators of Monroe Newborn based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Monroe Newborn. Monroe Newborn is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Newborn, Monroe. (2014). Computer Chess. 1 indexed citations
2.
Newborn, Monty, et al.. (2012). Deep Blue: An Artificial Intelligence Milestone. Medical Entomology and Zoology. 16(7). 1177–90. 7 indexed citations
3.
Newborn, Monroe. (2011). Beyond Deep Blue: Chess in the Stratosphere. Bulletin of Miscellaneous Information (Royal Gardens Kew). 4 indexed citations
4.
Almulla, Mohammed, et al.. (1998). Heuristics used by HERBY for semantic tree theorem proving. Annals of Mathematics and Artificial Intelligence. 23(3-4). 247–266. 1 indexed citations
5.
Al-Mulla, Mohamed R. & Monroe Newborn. (1996). The practicality of generating semantic trees for proofs of unsatisfiability. International Journal of Computer Mathematics. 62(1-2). 45–61.
6.
Almulla, Mohammed, et al.. (1992). An upper bound on the time complexity of iterative-deepening-A*. Annals of Mathematics and Artificial Intelligence. 5(2-4). 265–277. 9 indexed citations
7.
Newborn, Monroe. (1985). A Hypothesis concerning the Strength of Chess Programs. ICGA Journal. 8(4). 209–215. 9 indexed citations
8.
Newborn, Monroe. (1985). A parallel search chess program. 272–277. 16 indexed citations
9.
Lévy, David & Monroe Newborn. (1982). All About Chess and Computers. 10 indexed citations
10.
Newborn, Monroe & W. O. J. Moser. (1980). Optimal crossing-free Hamiltonian circuit drawings of Kn. Journal of Combinatorial Theory Series B. 29(1). 13–26. 16 indexed citations
11.
Newborn, Monroe, et al.. (1980). Computer chess at ACM 79. Communications of the ACM. 23(1). 51–54. 2 indexed citations
12.
Newborn, Monroe. (1979). Chess 4.7 Gives Levy A Run For His Money. The Mathematical Intelligencer. 1(4). 215–217. 1 indexed citations
13.
Newborn, Monroe. (1978). Computer Chess: Recent Progress and Future Expectations.. 189–192. 1 indexed citations
14.
Akl, Selim G. & Monroe Newborn. (1977). The principal continuation and the killer heuristic. 466–473. 54 indexed citations
15.
Newborn, Monroe, et al.. (1970). Iteratively Realized Sequential Circuits. IEEE Transactions on Computers. C-19(1). 54–66. 20 indexed citations
16.
Newborn, Monroe, et al.. (1969). Iteratively realized sequential circuits: Further considerations. 56. 194–212. 1 indexed citations
17.
Newborn, Monroe, et al.. (1968). Iteratively realized sequential circuits. 431–448. 3 indexed citations
18.
Newborn, Monroe, et al.. (1968). Uniform modular realization of sequential machines. 613–621. 8 indexed citations
19.
Newborn, Monroe. (1968). Maximal Memory Binary Input-Binary Output Finite-Memory Sequential Machines. IEEE Transactions on Computers. C-17(1). 67–71. 7 indexed citations
20.
Newborn, Monroe. (1967). Note on Binary Input-Binary Output Finite-Memory Sequential Machines. IEEE Transactions on Electronic Computers. EC-16(4). 514–514. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026