Demo Data from EDBT 2026 / reviewers in the wild / expert
Eric J. Van Lantschoot
dblp:173/1833
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1974
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 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.
| Theoretical computer science
2 papers |
Automata and formal languages · 36% Coding theory · 32% Combinatorics and discrete mathematics · 32% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Integrated circuit design · 100% |
Topics — the 2 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages › finite automata › sequential machines
moore machines |
0.0 | 1 | 1974 | Design of Weighted Counters with Rational Scale Using Continued Fraction Expansion · IEEE Trans. Computers 1974 |
Coding theory
shift register |
0.0 | 1 | 1973 | Double Adjacencies Between Cycles of a Circulating Shift Register · IEEE Trans. Computers 1973 |
Methods — techniques the papers use, named apart from their topics
continued fraction expansion · 0.0necessary and sufficient conditions · 0.0contained cycle algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1974 | Design of Weighted Counters with Rational Scale Using Continued Fraction ExpansionabstractModulo qiscalers or counters are one-input Moore machines whose state set contains a unique subset (called cycle) of states which occur in cyclic succession. Eric J. Van Lantschoot, Joos Vandewalle |
IEEE Trans. Computers | 1 |
| 1973 | Double Adjacencies Between Cycles of a Circulating Shift RegisterabstractA circulating shift register is an n-stage binary shift register with feedback from stage n to stage 1. We refer to the state cycles of the circulating shift register as natural cycles. Two natural cycles are adjacent if there is a state in the first natural cycle that differs from a state in the second only in the first digit. Double adjacencies between natural cycles occur quite frequently. A necessary and sufficient condition for their existence is developed. A contained cycle arises when both transition possibilities between two doubly adjacent natural cycles are exploited. A formula for the length of contained cycles is given, and an algorithm for finding contained cycles of prespecified length is developed. Reversible natural cycles are cycles that contain, for any n-tuple, also the same n-tuple written backwards (allowing for a cyclical shift). It is shown how double adjacencies are related to reversibility. It is also shown that double adjacencies come in strings that may be of two types, either connecting reversible or connecting nonreversible natural cycles. Eric J. Van Lantschoot |
IEEE Trans. Computers | 1 |