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

Jonathan M. Mooney

dblp:183/0847 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 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 · 77% Mathematical optimization · 23%

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

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design › frequency-hopping sequence
costas array		 0.011988
On the number of Costas arrays as a function of array size · Proc. IEEE 1988
Mathematical optimization › statistical estimation
probability estimation		 0.011988
On the number of Costas arrays as a function of array size · Proc. IEEE 1988

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

probabilistic estimation · 0.0
YearPublicationVenuePosition
1988 On the number of Costas arrays as a function of array size
abstract
A conjecture that the number of Costas arrays is a monotonic increasing function of array size is disproved by extension of the known values to n=17. A probabilistic estimation formula is developed which predicts the peak at n=16 and tracks the known values to (typically) 5-6%.>
J. Silverman, V. E. Vickers, Jonathan M. Mooney
 Proc. IEEE3