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

Ernest E. Bergmann

dblp:55/1053 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
0000-0001-6168-9508ORCID · verified

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 · 44% Algorithms and data structures · 44% Combinatorics and discrete mathematics · 13%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › combinatorial algorithms
balancing sets
0.011988
Balancing sets of vectors · IEEE Trans. Inf. Theory 1988
Coding theory › error-correcting codes › combinatorial coding theory
combinatorial codes
0.011988
Balancing sets of vectors · IEEE Trans. Inf. Theory 1988
Combinatorics and discrete mathematics › discrepancy theory
vector balancing
0.011988
Balancing sets of vectors · IEEE Trans. Inf. Theory 1988

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

combinatorial construction · 0.0
YearPublicationVenuePosition
1988 Balancing sets of vectors
abstract
For n>0, d>or=0, n identical to d (mod 2), let K(n, d) denote the minimal cardinality of a family V of +or-1 vectors of dimension n, such that for any +or-1 vector w of dimension n there is a v in V such that mod v-w mod>
Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko
IEEE Trans. Inf. Theory2