VLDB 2026 Research / reviewers in the wild / expert
C. R. Stone
dblp:15/3281
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1977
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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.
| Theoretical computer science
1 paper |
Algorithms and data structures · 50% Mathematical optimization · 25% Information theory · 25% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › randomized algorithms › sampling › random variate generation
arbitrary distribution sampling |
0.0 | 1 | 1977 | Table-Lookup Methods for Generating Arbityrary Random Numbers · IEEE Trans. Computers 1977 |
Algorithms and data structures › randomized algorithms
monte carlo methods |
0.0 | 1 | 1977 | Table-Lookup Methods for Generating Arbityrary Random Numbers · IEEE Trans. Computers 1977 |
Mathematical optimization
probabilistic simulation |
0.0 | 1 | 1977 | Table-Lookup Methods for Generating Arbityrary Random Numbers · IEEE Trans. Computers 1977 |
Information theory
random number generation |
0.0 | 1 | 1977 | Table-Lookup Methods for Generating Arbityrary Random Numbers · IEEE Trans. Computers 1977 |
Performance modeling and evaluation
simulation |
0.0 | 1 | 1977 | Table-Lookup Methods for Generating Arbityrary Random Numbers · IEEE Trans. Computers 1977 |
Methods — techniques the papers use, named apart from their topics
table-lookup methods · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1977 | Table-Lookup Methods for Generating Arbityrary Random NumbersabstractExtremely fast table-lookup procedures are described for generating random numbers from an arbitrary distribution on a digital computer. The procedures sacrifice some accuracy in order to achieve this speed, but the accuracy is sufficient for most types of Monte-Carlo simulations. A method is given to eliminate the error associated with truncation for distribution functions with an infinite domain. The performance of the table-lookup methods is examined for a few common distribution functions. Richard L. Mitchell, C. R. Stone |
IEEE Trans. Computers | 2 |