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.
Material type: TextSeries: Lecture Notes in Computer Science ; 4056Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Description: X, 362 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540354758Subject(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 | AlgorithmsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK4167 |
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.
There are no comments on this title.