Structural Information and Communication Complexity [electronic resource] :13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006. Proceedings / edited by Paola Flocchini, Leszek Gąsieniec.
by Flocchini, Paola [editor.]; Gąsieniec, Leszek [editor.]; SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 4056Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.Description: X, 357 p. Also available online. online resource.ISBN: 9783540354758.Subject(s): Computer science | Computer Communication Networks | Data structures (Computer science) | Computer software | Computational complexity | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Computer Communication Networks | Discrete Mathematics in Computer Science | Data Structures | AlgorithmsDDC classification: 005.1 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA76.9.A43 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
| QA76.9.A43 Experimental Algorithms | QA76.9.A43 Algorithmic Aspects in Information and Management | QA76.9.A43 Combinatorial Pattern Matching | QA76.9.A43 Structural Information and Communication Complexity | QA76.9.A43 Algorithm Theory – SWAT 2006 | QA76.9.A43 Algorithmic Number Theory | QA76.9.A43 Computing and Combinatorics |
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.
This book constitutes the refereed proceedings of the 13th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2006, held in Chester, UK, in July 2006. The 24 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 68 submissions. The papers address issues such as topics in distributed and parallel computing, information dissemination, communication complexity, interconnection networks, high speed networks, wireless and sensor networks, mobile computing, optical computing, autonomous robots, and related areas. The papers are organized in topical sections on robots, routing, distributed algorithms, fault tolerance, radio networks, and self-stabilizing alorgithms.
There are no comments for this item.