Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

David C. M. Wood

dblp:06/1330 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1973
—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
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › sequences
linear recurrence sequences		 0.011973
On the Distribution of Sums of Successive Bits of Shift-Register Sequences · IEEE Trans. Computers 1973
Coding theory › sequences
pseudorandom sequences		 0.011973
On the Distribution of Sums of Successive Bits of Shift-Register Sequences · IEEE Trans. Computers 1973
Coding theory › sequences › linear recurrence sequences
shift register sequences		 0.011973
On the Distribution of Sums of Successive Bits of Shift-Register Sequences · IEEE Trans. Computers 1973

Methods — techniques the papers use, named apart from their topics

binomial distribution analysis · 0.0
YearPublicationVenuePosition
1973 On the Distribution of Sums of Successive Bits of Shift-Register Sequences
abstract
A formula is found for the distribution of the number of ones in a subsequence of a maximal-length shift-register sequence. The formula relates the distribution to the binomial distribution with probability 1/2 with a difference that depends on the structure of the set of linear recurrences satisfied by the sequence. Considerations are discussed that aid in the choice of a shift register to be used in generating an approximately binomially distributed random variable.
Harry F. Jordan, David C. M. Wood
 IEEE Trans. Computers2