Umfang:
Online-Ressource (X, 357 p. Also available online, digital)
ISBN:
9783540354758
Serie:
Lecture Notes in Computer Science 4056
Inhalt:
Mobile Agent Rendezvous: A Survey -- Adapting to Point Contention with Long-Lived Safe Agreement -- Sensor Networks: Distributed Algorithms Reloaded – or Revolutions? -- Local Algorithms for Autonomous Robot Systems -- How to Meet in Anonymous Network -- Setting Port Numbers for Fast Graph Exploration -- Distributed Chasing of Network Intruders -- Election in the Qualitative World -- Fast Deterministic Distributed Algorithms for Sparse Spanners -- Efficient Distributed Weighted Matchings on Trees -- Approximation Strategies for Routing Edge Disjoint Paths in Complete Graphs -- Short Labels by Traversal and Jumping -- An Optimal Rebuilding Strategy for a Decremental Tree Problem -- Optimal Delay for Media-on-Demand with Pre-loading and Pre-buffering -- Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures -- On Fractional Dynamic Faults with Threshold -- Discovering Network Topology in the Presence of Byzantine Faults -- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks -- 3-D Minimum Energy Broadcasting -- Average-Time Complexity of Gossiping in Radio Networks -- L(h,1,1)-Labeling of Outerplanar Graphs -- Combinatorial Algorithms for Compressed Sensing -- On the Existence of Truthful Mechanisms for the Minimum-Cost Approximate Shortest-Paths Tree Problem -- Dynamic Asymmetric Communication -- Approximate Top-k Queries in Sensor Networks -- Self-stabilizing Space Optimal Synchronization Algorithms on Trees -- Distance-k Information in Self-stabilizing Algorithms.
Anmerkung:
Literaturangaben
,
Lizenzpflichtig
Weitere Ausg.:
ISBN 9783540354741
Weitere Ausg.:
Buchausg. u.d.T. Structural information and communication complexity Berlin : Springer, 2006 ISBN 3540354743
Weitere Ausg.:
ISBN 9783540354741
Sprache:
Englisch
Schlagwort(e):
Verteiltes System
;
Komplexitätstheorie
;
Graphentheorie
;
Kommunikationssystem
;
Nachrichtenverkehr
;
Informationsstruktur
;
Strukturkomplexität
;
Telekommunikationsnetz
;
Verbindungsstruktur
;
Gossiping
;
Funknetz
;
Komplexitätstheorie
;
Graphentheorie
;
Mobile Computing
;
Komplexitätstheorie
;
Graphentheorie
;
Verteiltes System
;
Komplexitätstheorie
;
Graphentheorie
;
Kommunikationssystem
;
Nachrichtenverkehr
;
Informationsstruktur
;
Strukturkomplexität
;
Telekommunikationsnetz
;
Verbindungsstruktur
;
Gossiping
;
Funknetz
;
Komplexitätstheorie
;
Graphentheorie
;
Mobile Computing
;
Komplexitätstheorie
;
Graphentheorie
;
Konferenzschrift
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
