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

George Eichmann

dblp:38/6142 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1987
—ORCID · none

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

Computer networks · 2Systems, architecture and hardware · 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.

Computer networks
1 paper
Wireless networking · 44% Network performance modeling · 44% Physical-layer communications · 13%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › wireless transmission
meteor burst communication		 0.011987
Performance of Meteor-Burst Communication Channels · IEEE J. Sel. Areas Commun. 1987
Network performance modeling
throughput analysis		 0.011987
Performance of Meteor-Burst Communication Channels · IEEE J. Sel. Areas Commun. 1987
Coding theory
linear feedback shift register		 0.011984
Adjacencies Between the Cycles of a Shift Register with Characteristic Polynomial (1 + x)n · IEEE Trans. Computers 1984
Coding theory › sequences › linear recurrence sequences
shift register sequences		 0.011984
Adjacencies Between the Cycles of a Shift Register with Characteristic Polynomial (1 + x)n · IEEE Trans. Computers 1984

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

cycle adjacency analysis · 0.0
YearPublicationVenuePosition
1987 Performance of Meteor-Burst Communication Channels
abstract
In this paper, we briefly describe the physical characteristics of a meteor-burst (MB) communication channel, and then present the results of an analysis showing the expected throughput and the probability of completing a given message under two different scenarios. In the first scenario, the transmitter is presumed to have knowledge (obtained by appropriate probe signals) of the entire duration of a given MB. In the second, only the starting time of each MB is known. Numerical results based on the analysis are provided, and it is shown what types of delays must be tolerated in order to achieve a given degree of reliability of having the transmitted message correctly received at its destination.
Laurence B. Milstein, Donald L. Schilling, Raymond L. Pickholtz, J. Sellman, Sorin Davidovici, Andrew F. Pavelchek, Allan Schneider, George Eichmann
 IEEE J. Sel. Areas Commun.8
1986 Analysis of Two Protocols for Meteor-Burst Communications
Laurence B. Milstein, Donald L. Schilling, George Eichmann, Raymond L. Pickholtz, J. Sellman, Sorin Davidovici, Andrew F. Pavelchek, Allan Schneider
 ICC3
1984 Adjacencies Between the Cycles of a Shift Register with Characteristic Polynomial (1 + x)n
abstract
It is shown that the set of cycles of a linear feedback shift register with characteristic polynomial (1 + x)nare at most doubly adjacent.
Farhad Hemmati, Donald L. Schilling, George Eichmann
 IEEE Trans. Computers3