New bounds for the controller problem

DOI10.1007/s00446-010-0119-zzbMath1231.68072OpenAlexW2122564642MaRDI QIDQ661061

Yuval Emek, Amos Korman

Publication date: 6 February 2012

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-010-0119-z

zbMATH Keywords

\((M,W)\)-controllermonotonic labeling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (3)

Tight Lower Bounds for the Online Labeling Problem ⋮ On Online Labeling with Large Label Set ⋮ The Online House Numbering Problem: Min-Max Online List Labeling

Cites Work

• Unnamed Item
• Labeling schemes for dynamic tree networks
• Optimal fault-tolerant distributed construction of a spanning forest
• General compact labeling schemes for dynamic trees
• Labeling schemes for weighted dynamic trees
• Improved compact routing schemes for dynamic trees
• Distributed Approximate Matching
• Impossibility of distributed consensus with one faulty process
• Fault tolerant distributed majority commitment
• Sparser: A Paradigm for Running Distributed Algorithms
• Competitive On-Line Algorithms for Distributed Data Management
• Local management of a global resource in a communication network
• A Tight Lower Bound for Online Monotonic List Labeling
• Controller and estimator for dynamic networks

This page was built for publication: New bounds for the controller problem