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

Gareth S. O'Brien

dblp:33/10391 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2008
0000-0002-7345-0286ORCID · reported

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 · 56% Combinatorics and discrete mathematics · 44%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design › frequency-hopping sequence
costas array		 0.112008
Results of the Enumeration of Costas Arrays of Order 27 · IEEE Trans. Inf. Theory 2008
Combinatorics and discrete mathematics
enumeration		 0.112008
Results of the Enumeration of Costas Arrays of Order 27 · IEEE Trans. Inf. Theory 2008
YearPublicationVenuePosition
2008 Results of the Enumeration of Costas Arrays of Order 27
abstract
This correspondence presents the results of the enumeration of Costas arrays of order$27$: all arrays found, except for one, are accounted for by the Golomb and Welch construction methods.
Konstantinos Drakakis, Scott T. Rickard, James K. Beard, Rodrigo Caballero, Francesco Iorio, Gareth S. O'Brien, John Walsh 0001
 IEEE Trans. Inf. Theory6