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

J. Silverman

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

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

Systems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers
Coding theory · 82% Mathematical optimization · 18%

Topics — the 3 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.011988
On the number of Costas arrays as a function of array size · Proc. IEEE 1988
Coding theory › error-correcting codes › combinatorial coding theory
gray codes
0.011980
A Technique for Generating Specialized Gray Codes · IEEE Trans. Computers 1980
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.0block-insertion technique · 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. IEEE1
1980 A Technique for Generating Specialized Gray Codes
abstract
Gray codes with specialized properties, such as equalized change numbers for general logic circuits or desired statistical properties for experimental designs, can be developed from standard n-bit Gray codes by an efficient block-insertion technique guided by a scalar quality measure. Solutions for n = 5 through 8 are shown.
V. E. Vickers, J. Silverman
IEEE Trans. Computers2