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 VLDB 2026 / reviewers in the wild / expert

Gerald B. Lichtenberger

dblp:134/6398 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 · 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
1 paper
Algorithms and data structures · 44% Coding theory · 44% Information theory · 13%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
perfect reconstruction		 0.011974
A note on perfect predictability and analytic processes (Corresp.) · IEEE Trans. Inf. Theory 1974
Algorithms and data structures › randomized algorithms
sampling		 0.011974
A note on perfect predictability and analytic processes (Corresp.) · IEEE Trans. Inf. Theory 1974
Physical-layer communications › signal processing for communications
array signal processing		 0.011974
A note on perfect predictability and analytic processes (Corresp.) · IEEE Trans. Inf. Theory 1974
Information theory
hypothesis testing		 0.011974
A note on perfect predictability and analytic processes (Corresp.) · IEEE Trans. Inf. Theory 1974

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

analytic random process theory · 0.0
YearPublicationVenuePosition
1974 A note on perfect predictability and analytic processes (Corresp.)
abstract
It is well known that perfect reconstruction of an analytic random process can be accomplished given any finite length continuous sample. A proof is given here that sampling infinitely often over any finite interval also leads to perfect reconstruction. Applications of the result to problems in detection theory, particularly concerning optimum array processing, are discussed.
Gerald B. Lichtenberger
 IEEE Trans. Inf. Theory1