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

Eugene Gulko

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

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

Computer networks · 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.

Computer networks
1 paper
Wireless networking · 67% Network performance modeling · 33%

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

TopicWeightPapersLastEvidence papers
Wireless networking
multiple access protocols		 0.011985
Tree-Based Multiaccess Protocols Where Collision Multiplicities Are Known · IEEE Trans. Commun. 1985
Network performance modeling
queueing analysis		 0.011985
Tree-Based Multiaccess Protocols Where Collision Multiplicities Are Known · IEEE Trans. Commun. 1985
Wireless networking › collision resolution
tree collision resolution		 0.011985
Tree-Based Multiaccess Protocols Where Collision Multiplicities Are Known · IEEE Trans. Commun. 1985

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

stability analysis · 0.0delay moment analysis · 0.0
YearPublicationVenuePosition
1985 Tree-Based Multiaccess Protocols Where Collision Multiplicities Are Known
abstract
We compute the stability region and mean packet delay for a class of tree-based, multiaccess protocols proposed recently in the literature for an ALOHA-type channel when collision multiplicities are known, and Show that within the stability region, all the moments of the delay distribution are finite. We also show that the main advantage, of knowing the collision multiplicities is being able, in effect, to detect conflicts in two groups in a single slot.
Eugene Gulko
 IEEE Trans. Commun.1