David C. Baxter

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

dblp:37/6997 · DBLP profile ↗

← Back

2ranked-venue papers

0as first author

0since 2021 · last 1989

—ORCID · none

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

Computer networks · 2

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

Physical-layer communications · 39% Wireless networking · 30% Network performance modeling · 30%

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

Topic	Papers	Last	Evidence papers
Wireless networking collision resolution	1	1988	The robustness and performance of tree algorithms in an unshared feedback error environment · INFOCOM 1988
Physical-layer communications › multiple access multiple-access network	1	1988	The robustness and performance of tree algorithms in an unshared feedback error environment · INFOCOM 1988
Network performance modeling throughput and delay analysis	1	1988	The robustness and performance of tree algorithms in an unshared feedback error environment · INFOCOM 1988
Physical-layer communications feedback error	1	1988	The robustness and performance of tree algorithms in an unshared feedback error environment · INFOCOM 1988

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

simulation · 0.0robustness analysis · 0.0

Year	Publication	Venue	Position
1989	The Robustness and Performance of Tree Collision Resolution Algorithms in an Unshared Feedback Error Environment Tatsuya Suda, Jaime Jungok Bae, David C. Baxter	Comput. Networks ISDN Syst.	3
1988	The robustness and performance of tree algorithms in an unshared feedback error environment abstract A discussion is presented of the robustness of the Capetanakis collision resolution algorithm for multiple-access networks. In particular, they show that the algorithm is robust against errors that cause different stations to see different feedback information on the results of the transmission attempts, and they quantify, using simulation, the performance (throughput/delay) degradation caused by those unshared errors.> Tatsuya Suda, Jaime Jungok Bae, David C. Baxter	INFOCOM	3