Vai al contenuto principale della pagina
Titolo: |
Structural Information and Communication Complexity [[electronic resource] ] : 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings / / edited by Paola Flocchini, Leszek Gasieniec
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Edizione: | 1st ed. 2006. |
Descrizione fisica: | 1 online resource (X, 362 p.) |
Disciplina: | 004.6 |
Soggetto topico: | Computer networks |
Algorithms | |
Computer science—Mathematics | |
Discrete mathematics | |
Artificial intelligence—Data processing | |
Computer Communication Networks | |
Discrete Mathematics in Computer Science | |
Data Science | |
Persona (resp. second.): | FlocchiniPaola |
GasieniecLeszek | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | 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. |
Titolo autorizzato: | Structural Information and Communication Complexity ![]() |
ISBN: | 3-540-35475-1 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996465936003316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |