VLDB 2026 Research / reviewers in the wild / expert

Haim Greenberger

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

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 · 67% Computational complexity · 33%

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

TopicWeightPapersLastEvidence papers
Computational complexity › circuit complexity
correlation bounds		 0.011974
Families of sequences with optimal Hamming-correlation properties · IEEE Trans. Inf. Theory 1974
Coding theory › sequences
sequence design		 0.011974
Families of sequences with optimal Hamming-correlation properties · IEEE Trans. Inf. Theory 1974
Coding theory › sequences › sequence design
sequence family construction		 0.011974
Families of sequences with optimal Hamming-correlation properties · IEEE Trans. Inf. Theory 1974

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

correlation analysis · 0.0combinatorial construction · 0.0
YearPublicationVenuePosition
1974 Families of sequences with optimal Hamming-correlation properties
abstract
The unnormalized Hamming correlation between two sequences of equal length is the number of positions in which these sequences have identical symbols. In this paper, lower bounds on the out-of-phase autocorrelation and on the cross correlation of sequences of given length and alphabet size are derived. A method of constructing families of sequences that uniformly realize these hounds is presented.
Abraham Lempel, Haim Greenberger
 IEEE Trans. Inf. Theory2