Structural Information and Communication Complexity 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Prencipe, Giuseppe (Editor ), Zaks, Shmuel (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Theoretical Computer Science and General Issues, 4474
Temas:
Computer networks .
Algorithms.
Computer science-Mathematics.
Discrete mathematics.
Artificial intelligence-Data processing.
Computer Communication Networks.
Discrete Mathematics in Computer Science.
Data Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares