Demo Data from EDBT 2026 / reviewers in the wild / expert
L. Earl Colley
dblp:179/4947
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1967
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 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
1 paper |
Coding theory · 50% Automata and formal languages · 50% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages › finite automata › sequential machines
linear sequential machines |
0.0 | 1 | 1967 | Computation of Time-Phase Displacements of Binary Linear Sequence Generators · IEEE Trans. Electron. Comput. 1967 |
Methods — techniques the papers use, named apart from their topics
hand calculation · 0.0generator simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1967 | Computation of Time-Phase Displacements of Binary Linear Sequence GeneratorsabstractOne of the most useful binary linear sequential machines is the maximal length linear sequence generator. These are sometimes known as pseudo-noise generators because of certain statistical characteristics of their output. One of the more tedious problems in the applicaton of these generators has long been the calculation of the time displacement of the vectors constituting the output bit stream. In the past, this has been accomaplished by programming a computer to simulate the generator and counting steps to the wanted output vector. We show in this paper a much simpler solution to the problem which can be accomplished by means of simple hand calculations. L. Earl Colley |
IEEE Trans. Electron. Comput. | 1 |