Maintaining order in a generalized linked list
Acta Informatica
Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Sparser: a paradigm for running distributed algorithms
Journal of Algorithms
Local management of a global resource in a communication network
Journal of the ACM (JACM)
Lower Bounds for Monotonic List Labeling
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
Fast Updating of Well-Balanced Trees
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
A Sparse Table Implementation of Priority Queues
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Two Simplified Algorithms for Maintaining Order in a List
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Maintaining dense sequential files in a dynamic environment (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Maintaining order in a linked list
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A Tight Lower Bound for Online Monotonic List Labeling
SIAM Journal on Discrete Mathematics
Controller and estimator for dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Brief announcement: a decentralized algorithm for distributed trigger counting
DISC'10 Proceedings of the 24th international conference on Distributed computing
| Hi-index | 0.00 |
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic distributed tool that provides an abstraction for managing the consumption of a global resource in a distributed dynamic network. We establish new bounds on the message complexity of this tool based on a surprising connection between the controller problem and the monotonic labeling problem.