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

Michael J. Post

dblp:89/2978 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none

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

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

Computer networks
1 paper
Wireless networking · 80% Physical-layer communications · 20%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
code-division multiple access		 0.011991
Distributed scheduling of CDMA networks with minimal information · IEEE Trans. Commun. 1991
Wireless networking › medium access control › channel access scheduling
collision-free scheduling		 0.011991
Distributed scheduling of CDMA networks with minimal information · IEEE Trans. Commun. 1991
Wireless networking › scheduling
distributed scheduling		 0.011991
Distributed scheduling of CDMA networks with minimal information · IEEE Trans. Commun. 1991
Wireless networking
medium access control		 0.011991
Distributed scheduling of CDMA networks with minimal information · IEEE Trans. Commun. 1991
Wireless networking › wireless mesh network
multihop wireless network		 0.011991
Distributed scheduling of CDMA networks with minimal information · IEEE Trans. Commun. 1991
Distributed computing theory
distributed algorithms		 0.011991
Distributed scheduling of CDMA networks with minimal information · IEEE Trans. Commun. 1991

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

permutation-based scheduling · 0.0
YearPublicationVenuePosition
1991 Distributed scheduling of CDMA networks with minimal information
abstract
An algorithm which produces conflict-free communication schedules in mobility multihop radio networks is presented. These schedules are produced in a completely distributed manner. The algorithm is based on a globally known permutation on the nodes of the network. As a result the only knowledge needed on the part of individual nodes is the number of nodes in the network. This permutation guarantees that conflict-free schedules can be produced in a distributed manner. Two extensions to the basic permutation are discussed. The first enables neighboring nodes to enhance their communication schedules in a fast, robust, distributed manner. The second extension allows the algorithm to operate in the presence of secondary conflicts.>
Aaron Kershenbaum, Michael J. Post
 IEEE Trans. Commun.2
1989 Scheduling Multihop CDMA Networks in the Presence of Secondary Conflicts
Michael J. Post, Aaron Kershenbaum, Philip E. Sarachik
 Algorithmica1