Demo Data from VLDB 2026 / reviewers in the wild / expert
John L. Sampson
dblp:332/2146
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1983
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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 |
Coding theory · 38% Graph algorithms and graph theory · 38% Algorithms and data structures · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › combinatorial coding theory
gray codes |
0.0 | 1 | 1983 | Statistical estimates of the n-bit Gray codes by restricted random generation of permutations of 1 to 2n · IEEE Trans. Inf. Theory 1983 |
Graph algorithms and graph theory › graph theory › hamiltonicity
hamiltonian cycle |
0.0 | 1 | 1983 | Statistical estimates of the n-bit Gray codes by restricted random generation of permutations of 1 to 2n · IEEE Trans. Inf. Theory 1983 |
Algorithms and data structures › randomized algorithms
monte carlo methods |
0.0 | 1 | 1983 | Statistical estimates of the n-bit Gray codes by restricted random generation of permutations of 1 to 2n · IEEE Trans. Inf. Theory 1983 |
Algorithms and data structures › randomized algorithms › sampling
random generation |
0.0 | 1 | 1983 | Statistical estimates of the n-bit Gray codes by restricted random generation of permutations of 1 to 2n · IEEE Trans. Inf. Theory 1983 |
Methods — techniques the papers use, named apart from their topics
restricted random permutation generation · 0.0monte carlo estimation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1983 | Statistical estimates of the n-bit Gray codes by restricted random generation of permutations of 1 to 2nabstractThe number ofn-bit Gray codes is the number in a well-defined subset of the permutations of the integers1to2^{n}. Generating random permutations with associated estimates under suitably restrictive selection rules produces a discrete distribution whose expectation value is the number of such codes. The number of Hamiltonian circuits on then-cube (cyclic Gray codes) is a further subset which can readily be estimated also. Reliable statistical estimates up ton=6were produced with reasonable speed by computer implementation of this Monte Carlo process; excellent agreement with the exact values forn=4and5was obtained. Proofs are given of the validity of the technique and of an upper bound for the total number of Gray codes. The technique could also be used to count permutation subsets other than Gray codes. Jerry Silverman, Virgil E. Vickers, John L. Sampson |
IEEE Trans. Inf. Theory | 3 |