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 EDBT 2026 / reviewers in the wild / expert

Wouter G. Franx

dblp:18/2880 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1991
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences
de bruijn sequences		 0.011991
An efficient algorithm for the generation of DeBruijn cycles · IEEE Trans. Inf. Theory 1991
Coding theory › sequences
sequence generation		 0.011991
An efficient algorithm for the generation of DeBruijn cycles · IEEE Trans. Inf. Theory 1991
Coding theory › sequences
feedback shift registers		 0.011991
An efficient algorithm for the generation of DeBruijn cycles · IEEE Trans. Inf. Theory 1991

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

cycle joining · 0.0
YearPublicationVenuePosition
1991 An efficient algorithm for the generation of DeBruijn cycles
abstract
An algorithm is presented for the generation of binary DeBruijn sequences using feedback shift registers (FSRs). The algorithm is based on the principle of cycle joining, through which all the cycles in the cycle structure of a FSR can be joined together to one complete cycle, thereby producing a DeBruijn sequence of period 2/sup n/, where n is the length of the FSR. By a proper choice of the feedback function of the FSR O(2/sup 2n///sup log2n/) DeBruijn sequences of period 2/sup n/ can be generated, requiring only 3n bits of storage and at most 4n FSR shifts for the generation of the next bit in the sequence.>
Cees J. A. Jansen, Wouter G. Franx, Dick E. Boekee
 IEEE Trans. Inf. Theory2