EDBT 2026 Demo / reviewers in the wild / expert
Donald S. Lynn
dblp:178/4956
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1972
—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 |
Computational complexity · 87% Automata and formal languages · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity › decidability
busy beaver problem |
0.0 | 1 | 1972 | New Results for Rado's Sigma Function for Binary Turing Machines · IEEE Trans. Computers 1972 |
Computational complexity
computability theory |
0.0 | 1 | 1972 | New Results for Rado's Sigma Function for Binary Turing Machines · IEEE Trans. Computers 1972 |
Automata and formal languages
turing machines |
0.0 | 1 | 1972 | New Results for Rado's Sigma Function for Binary Turing Machines · IEEE Trans. Computers 1972 |
Methods — techniques the papers use, named apart from their topics
lower bound construction · 0.0computer search · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1972 | New Results for Rado's Sigma Function for Binary Turing MachinesabstractA computer program was written and executed to search for better lower bounds to Rado's noncomputable sigma and shift functions for binary Turing machines. Former results in this search (called by Rado the Busy Beaver logical game) are reviewed and new bounds found by this program are presented. Donald S. Lynn |
IEEE Trans. Computers | 1 |