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

Aleksander T. Kozlowski

dblp:06/786 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1987
—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 · 50% Network performance modeling · 38% Physical-layer communications · 12%

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

TopicWeightPapersLastEvidence papers
Wireless networking › random access
random access channel		 0.011987
A Nonslotted Random-Access Channel with Higher Utilization · IEEE Trans. Commun. 1987
Network performance modeling
throughput analysis		 0.011987
A Nonslotted Random-Access Channel with Higher Utilization · IEEE Trans. Commun. 1987
Wireless networking › medium access control › concurrent transmission
capture effect		 0.011987
A Nonslotted Random-Access Channel with Higher Utilization · IEEE Trans. Commun. 1987
Physical-layer communications
multiple access		 0.011987
A Nonslotted Random-Access Channel with Higher Utilization · IEEE Trans. Commun. 1987

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

queueing analysis · 0.0
YearPublicationVenuePosition
1987 A Nonslotted Random-Access Channel with Higher Utilization
abstract
The paper considers a nonslotted random-access radio channel with users divided into a few classes. Assuming that capture exists between these classes of users and that users allotted to different classes use packets of different lengths, packet and data throughput are obtained. A set of packet lengths is found for which these throughputs exceed throughputs in the case when all users use equal-length packets. Finally, the sets of packet lengths and class traffics are obtained to give the global maximum channel utilization.
Aleksander T. Kozlowski
 IEEE Trans. Commun.1