Kooperativer Bibliotheksverbund

UID:

Umfang: X, 356 S. , graph. Darst.

ISBN: 3540354743 , 9783540354741

Serie: Lecture notes in computer science 4056

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 ; Konferenzschrift ; Kongress ; Konferenzschrift

URL: Inhaltstext

Mehr zum Autor: Flocchini, Paola

UID:

Umfang: X, 362 p. , online resource.

ISBN: 9783540354758

Serie: Lecture Notes in Computer Science, 4056

Anmerkung: 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.

In: Springer eBooks

Weitere Ausg.: Printed edition: ISBN 9783540354741

Sprache: Englisch

DOI: 10.1007/11780823

URL: http://dx.doi.org/10.1007/11780823

UID:

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

DOI: 10.1007/11780823

URL: Volltext  (lizenzpflichtig)

URL: Volltext

URL: Volltext  (lizenzpflichtig)

URL: Cover

URL: Inhaltstext

UID:

Umfang: X, 362 p. , online resource.

Ausgabe: 1st ed. 2006.

ISBN: 9783540354758

Serie: Theoretical Computer Science and General Issues, 4056

Anmerkung: 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.

In: Springer Nature eBook

Weitere Ausg.: Printed edition: ISBN 9783540354741

Weitere Ausg.: Printed edition: ISBN 9783540825838

Sprache: Englisch

DOI: 10.1007/11780823

URL: https://doi.org/10.1007/11780823

UID:

Umfang: 1 Online-Ressource (X, 356 S.) , graph. Darst.

ISBN: 3540354743 , 9783540354741 , 9783540354758

Serie: Lecture notes in computer science 4056

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 ; Konferenzschrift

DOI: 10.1007/11780823

URL: Volltext

Mehr zum Autor: Flocchini, Paola