Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
A Learning Algorithm for Boltzmann Machines*
19852.0k citationsDavid H. Ackley, Geoffrey E. Hinton et al.Cognitive Scienceprofile →
A learning algorithm for boltzmann machines
1985380 citationsDavid H. Ackley, Geoffrey E. Hinton et al.Cognitive Scienceprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by David H. Ackley
Since
Specialization
Citations
This map shows the geographic impact of David H. Ackley'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 David H. Ackley with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David H. Ackley more than expected).
This network shows the impact of papers produced by David H. Ackley. 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 David H. Ackley. The network helps show where David H. Ackley may publish in the future.
Co-authorship network of co-authors of David H. Ackley
This figure shows the co-authorship network connecting the top 25 collaborators of David H. Ackley.
A scholar is included among the top collaborators of David H. Ackley 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 David H. Ackley. David H. Ackley is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
McDonald, David W., et al.. (2014). Antisocial computing. interactions. 21(6). 72–75.3 indexed citations
8.
Ackley, David H. & Daniel C. Cannon. (2011). Pursue robust indefinite scalability. 8–8.11 indexed citations
9.
Barrantes, Elena Gabriela, David H. Ackley, Stephanie Forrest, & Darko Stefanović. (2005). Randomized instruction set emulation. ACM Transactions on Information and System Security. 8(1). 3–40.91 indexed citations
Ackley, David H., et al.. (2002). Code factoring and the evolution of evolvability. Genetic and Evolutionary Computation Conference. 1383–1390.24 indexed citations
Belew, Richard K., Melanie Mitchell, & David H. Ackley. (1996). Computation and the natural sciences. Addison-Wesley Longman Publishing Co., Inc. eBooks. 431–440.6 indexed citations
14.
Littman, Michael L. & David H. Ackley. (1991). Adaptation in Constant Utility Non-Stationary Environments.. 136–142.14 indexed citations
15.
Ackley, David H. & Michael L. Littman. (1989). Generalization and Scaling in Reinforcement Learning. Neural Information Processing Systems. 2. 550–557.31 indexed citations
16.
Ackley, David H.. (1988). Associative Learning via Inhibitory Search. Neural Information Processing Systems. 1. 20–28.6 indexed citations
17.
Ackley, David H.. (1987). Stochastic iterated genetic hillclimbing.25 indexed citations
18.
Ackley, David H.. (1985). A Connectionist Algorithm for Genetic Search. international conference on Genetic algorithms. 121–135.8 indexed citations
19.
Ackley, David H., Geoffrey E. Hinton, & Terrence J. Sejnowski. (1985). A learning algorithm for boltzmann machines. Cognitive Science. 9(1). 147–169.380 indexed citations breakdown →
20.
Berliner, Hans & David H. Ackley. (1982). The QBKG system: generating explanations from a non-discrete knowledge representation. National Conference on Artificial Intelligence. 213–216.9 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.