Structural information and communication complexity : 14th international colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007 : proceedings / Giuseppe Prencipe, Shmuel Zaks (eds.).

By: (14th : Colloquium on Structural Information and Communication Complexity (14th : 2007 : Castiglioncello, Italy)
Contributor(s): Prencipe, Giuseppe, 1972- | Zaks, Shmuel, 1949-
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 4474.Publisher: Berlin ; New York : Springer, ©2007Description: 1 online resource (xiii, 342 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540729518; 3540729518; 9783540729181; 3540729186Other title: SIROCCO 2007Subject(s): Electronic data processing -- Distributed processing -- Congresses | Computer algorithms -- Congresses | Computer networks -- Congresses | Informatique | Computer algorithms | Computer networks | Electronic data processing -- Distributed processing | algoritmen | algorithms | computeranalyse | computer analysis | wiskunde | mathematics | computerwetenschappen | computer sciences | computernetwerken | computer networks | gegevensstructuren | data structures | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Structural information and communication complexity.DDC classification: 004.6 LOC classification: QA76.9.D5 | C618 2007ebOnline resources: Click here to access online
Contents:
Session 1. Invited Talks -- Fast Distributed Algorithms Via Primal-Dual (Extended Abstract) -- Time Optimal Gathering in Sensor Networks -- Treewidth: Structure and Algorithms -- Session 2. Autonomous Systems: Graph Exploration -- Fast Periodic Graph Exploration with Constant Memory -- Why Robots Need Maps -- Graph Searching with Advice -- Session 3. Distributed Algorithms: Fault Tolerance -- From Renaming to Set Agreement -- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives -- A New Self-stabilizing Maximal Matching Algorithm -- Session 4. Distributed Algorithms and Data Structures -- Labeling Schemes with Queries -- A Simple Optimistic Skiplist Algorithm -- Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs -- Session 5. Autonomous Systems: Location Problems -- Optimal Moves for Gossiping Among Mobile Agents -- Swing Words to Make Circle Formation Quiescent -- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots -- Session 6. Wireless Networks -- Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs -- Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers -- Location Oblivious Distributed Unit Disk Graph Coloring -- Session 7. Communication Networks: Fault Tolerance -- Edge Fault-Diameter of Cartesian Product of Graphs -- Rapid Almost-Complete Broadcasting in Faulty Networks -- Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions -- Session 8. Autonomous Systems: Fault Tolerance -- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots -- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents -- Session 9. Communication Networks: Parallel Computing and Selfish Routing -- Optimal Conclusive Sets for Comparator Networks -- Selfish Routing with Oblivious Users -- Upper Bounds and Algorithms for Parallel Knock-Out Numbers.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

Print version record.

Session 1. Invited Talks -- Fast Distributed Algorithms Via Primal-Dual (Extended Abstract) -- Time Optimal Gathering in Sensor Networks -- Treewidth: Structure and Algorithms -- Session 2. Autonomous Systems: Graph Exploration -- Fast Periodic Graph Exploration with Constant Memory -- Why Robots Need Maps -- Graph Searching with Advice -- Session 3. Distributed Algorithms: Fault Tolerance -- From Renaming to Set Agreement -- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives -- A New Self-stabilizing Maximal Matching Algorithm -- Session 4. Distributed Algorithms and Data Structures -- Labeling Schemes with Queries -- A Simple Optimistic Skiplist Algorithm -- Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs -- Session 5. Autonomous Systems: Location Problems -- Optimal Moves for Gossiping Among Mobile Agents -- Swing Words to Make Circle Formation Quiescent -- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots -- Session 6. Wireless Networks -- Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs -- Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers -- Location Oblivious Distributed Unit Disk Graph Coloring -- Session 7. Communication Networks: Fault Tolerance -- Edge Fault-Diameter of Cartesian Product of Graphs -- Rapid Almost-Complete Broadcasting in Faulty Networks -- Design of Minimal Fault Tolerant On-Board Networks: Practical Constructions -- Session 8. Autonomous Systems: Fault Tolerance -- Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots -- Fault-Tolerant Simulation of Message-Passing Algorithms by Mobile Agents -- Session 9. Communication Networks: Parallel Computing and Selfish Routing -- Optimal Conclusive Sets for Comparator Networks -- Selfish Routing with Oblivious Users -- Upper Bounds and Algorithms for Parallel Knock-Out Numbers.

University staff and students only. Requires University Computer Account login off-campus.

There are no comments for this item.

to post a comment.

Powered by Koha