Demo Data from EDBT 2026 / reviewers in the wild / expert
Richard Wesley Hamming
dblp:h/RWHamming
· DBLP profile ↗
5ranked-venue papers
5as first author
0since 2021 · last 1969
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 3 first-authorSystems, architecture and hardware · 1 · 1 first-authorTheory of computation · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computing education · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% | |
| Theoretical computer science
1 paper |
Computational complexity · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computing education
computer science curriculum |
0.0 | 1 | 1969 | One Man's View of Computer Science · J. ACM 1969 |
Electronic design automation
logic synthesis |
0.0 | 1 | 1965 | A Note on the Location of the Binary Point in a Computing Machine · IEEE Trans. Electron. Comput. 1965 |
Electronic design automation › logic synthesis › threshold logic synthesis
threshold function identification |
0.0 | 1 | 1965 | A Note on the Location of the Binary Point in a Computing Machine · IEEE Trans. Electron. Comput. 1965 |
Computational complexity › circuit complexity
threshold functions |
0.0 | 1 | 1965 | A Note on the Location of the Binary Point in a Computing Machine · IEEE Trans. Electron. Comput. 1965 |
Methods — techniques the papers use, named apart from their topics
k-monotonicity conditions · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1969 | One Man's View of Computer ScienceabstractA number of observations and comments are directed toward suggesting that more than the usual engineering flavor be given to computer science. The engineering aspect is important because most present difficulties in this field do not involve the theoretical question of whether certain things can be done, but rather the practical question of how can they be accomplished well and simply. The teaching of computer science could be made more effective by various alterations, for example, the inclusion of a laboratory course in programming, the requirement for a strong minor in something other than mathematics, and more practical coding and less abstract theory, as well as more seriousness and less game playing. Richard Wesley Hamming |
J. ACM | 1 |
| 1966 | A Class of Integration FormulasabstractGregory's formula for numerically integrating a function is one of the most promising formulas for use in a computer library. This paper shows how Gregory's formula can be generalized, and examines special cases which have a number of very favorable properties for library use. Richard Wesley Hamming, Roger S. Pinkham |
J. ACM | 1 |
| 1966 | Review of 'Random-Process Simulation and Measurements' (Korn, G. A.; 1966)
Richard Wesley Hamming |
IEEE Trans. Inf. Theory | 1 |
| 1965 | A Note on the Location of the Binary Point in a Computing MachineabstractNecessary conditions that a switching function be, in particular, a threshold function have been introduced by Paull and McCluskey [11]; named and studied at some length by Winder [13], [14], [15] and Muroga, et al. [8]; and generalized by Elgot [3], Winder [14], [15] and Gabelman [4]. The basic conditions are the k-monotonicities and have been used not only to recognize threshold functions but also to determine realizing weights and threshold. Richard Wesley Hamming, Wanda L. Mammel |
IEEE Trans. Electron. Comput. | 1 |
| 1959 | Stable Predictor-Corrector Methods for Ordinary Differential Equationsabstractfrom Richard W. Hamming collection (NPS-018), Naval Postgraduate School. Papers and Speeches. Richard Wesley Hamming |
J. ACM | 1 |