Structural Information and Communication Complexity 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014, Proceedings

This book constitutes the refereed proceedings of the 21st International Colloquium on Structural Information and Communication Complexity, SIROCCO 2014, held in Takayama, Japan, in July 2014. The 24 full papers presented together with 5 invited talks were carefully reviewed and selected from 51 sub...

Full description

Saved in:
Bibliographic Details
Main Author Halldorsson, Magnus M
Format eBook Book
LanguageEnglish
Published Cham Springer Nature 2014
Springer
Springer International Publishing AG
Springer International Publishing
Edition1
SeriesLecture Notes in Computer Science
Subjects
Communication complexity
Computational complexity
Computational complexity > Congresses
Computer networks
Computer networks > Congresses
Computer programming, programs, data
Electronic data processing
Electronic data processing > Distributed processing > Congresses
SIROCCO
Structural information
Online AccessGet full text
ISBN3319096206
9783319096209
3319096192
9783319096193

Cover

Table of Contents:
  • 2.2 Periodic Data Retrieval
  • Intro -- Preface -- Organization -- Laudatio -- From Turing to the Clouds (On the Computability Power of Distributed Systems) -- Biological Distributed Computing -- Table of Contents -- Invited Presentations -- Algorithmic Aspects of Resource Management in the Cloud -- 1 Introduction -- 2 Online Leasing Problems -- 3 Distributed Storage Systems -- References -- Communication Complexity Lower Bounds in Distributed Message-Passing -- References -- Distributed Algorithmic Foundations of Dynamic Networks -- References -- Best Student Paper -- The Beachcombers' Problem:Walking and Searching with Mobile Robots -- 1 Introduction -- 1.1 Preliminaries -- 1.2 Related Work -- 1.3 Outline and Results of the Paper -- 2 Searching a Known Segment -- 2.1 Properties of Optimal Schedules -- 2.2 The Optimal Schedule for the Beachcombers' Problem -- 2.3 Closed Formulas for the Optimal Schedule of the Beachcombers' Problem -- 3 The Online Search Algorithm -- 4 Competitiveness of the Online Searching -- 5 Conclusion and Open Problems -- References -- Shared Memory and Multiparty Communication -- Reliable Shared Memory Abstraction on Top of Asynchronous Byzantine Message-Passing Systems -- 1 Introduction -- 2 Computation Model, Reliable Broadcast and Two Properties -- 2.1 Computation Model -- 2.2 Reliable Broadcast Abstraction -- 2.3 Two Preliminary Quorum-Related Properties -- 3 Construction of Single-Writer/Multi-Reader Atomic h-Registers -- 3.1 Atomic Read/Write h-Registers in the Presence of Byzantine Processes -- 3.2 The Construction -- 3.3 Proof of the Construction and Upper Bound -- 4 A Simple Abstraction on Top of SWMR Atomic h-Registers -- 5 Solving Multidimensional Approximate Agreement -- 5.1 The Multidimensional Approximate Agreement Problem -- 5.2 Solving Multidimensional Approximate Agreement -- 6 Conclusion -- References
  • 3 Preliminaries -- 3.1 Round-Based Distributed Systems -- 3.2 Distributed Verification Problems -- 4 Randomized Lower Bounds for PHam -- 4.1 Two-Party Communication Complexity -- 4.2 Graph Construction -- 4.3 Reduction -- 5 Verifying Low-Diameter Spanning Trees -- 6 Concluding Remarks -- References -- Lessons from the Congested Clique Applied to MapReduce -- 1 Introduction -- 1.1 Models -- 1.2 Contributions -- 1.3 RelatedWork -- 2 Coloring on the Congested Clique -- 3 MapReduce Algorithms from Congested Clique Algorithms -- 4 Coloring in the MapReduce Framework -- References -- Wireless networks -- Oblivious Rendezvous in Cognitive Radio Networks -- 1 Introduction -- 1.1 Rendezvous and Oblivious Rendezvous -- 1.2 Related Work -- 1.3 Our Contributions -- 2 Model and Problem Definitions -- 2.1 System Model -- 2.2 Problem Definition -- 3 Lower Bound for ORP-2 -- 4 Algorithms for ORP-2 -- 4.1 ID Hopping Rendezvous -- 4.2 Multi-Step Channel Hopping Rendezvous -- 5 Algorithm for ORP-M -- 6 Oblivious Rendezvous Applications -- 7 Conclusion -- References -- Local Broadcasting with Arbitrary Transmission Power in the SINR Model -- 1 Introduction -- 1.1 Contributions -- 1.2 Related Work -- 2 Preliminaries -- 3 Bounding the Interference -- 4 Local Broadcasting -- 4.1 Arbitrary But Fixed Transmission Power -- 4.2 Variable Transmission Power -- 5 Distributed Node Coloring -- 5.1 The MW-Coloring Algorithm -- 6 Conclussion -- References -- Aggregation and Creation Games in Networks -- Continuous Aggregation in Dynamic Ad-Hoc Networks -- 1 Introduction -- 1.1 Our Contribution -- 2 Models and Problems -- 3 Related Work -- 4 Static Networks -- 5 T-stable Dynamic Networks -- 5.1 Graph Patching in T-stable Dynamic Networks -- 5.2 Non-Continuous Extremum -- 5.3 Non-Continuous Summation -- 5.4 Continuous Extremum -- 5.5 Continuous Summation -- 6 Geometric Dynamic Networks
  • Distributed Transactional Contention Management as the Traveling Salesman Problem -- 1 Preliminaries -- 2 The DTM Contention Management Problem -- 2.1 Problem Measure and Complexity -- 2.2 Lower Bound -- 3 Algorithm: Cutting -- 3.1 Description -- 3.2 Analysis -- 4 Conclusions -- References -- The Complexity Gap between Consensus and Safe-Consensus -- 1 Introduction -- 2 Model and Task Definitions -- 3 Solving Consensus with Safe-Consensus -- 4 The Lower Bound -- References -- The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism -- 1 Introduction -- 2 Preliminaries -- 3 Deterministic Protocols -- 4 Randomized Protocols -- 5 Open Problems -- References -- Network Optimization -- Approximation of the Degree-Constrained Minimum Spanning Hierarchies -- 1 Introduction -- 2 Related Works -- 3 Problem Definition -- 4 Degree Constrained Span of a Star with Hierarchies -- 5 An Approximation Algorithm for the DCMSH Problem -- 5.1 A Star Decomposition of the MST -- 5.2 The Proposed Algorithm to Approximate the DCMSH -- 5.3 Discussion about the Heuristic -- 6 Conclusion -- References -- Secluded Path via Shortest Path -- 1 Introduction -- 2 Preliminaries -- 3 Δ-Degree Graphs -- 3.1 Static -- 3.2 Δ-Memory -- 3.3 h-Memory for 0 ≤ h ≤ Δ -- 4 Unit-Disk Graphs -- 5 NP-Hardness -- 6 Discussion -- References -- CONGEST Algorithms and Lower Bounds -- Distributed Approximation of Minimum Routing Cost Trees -- 1 Introduction -- 2 Model and Basic Definitions -- 3 Our Results -- 4 Related Work -- 5 Trees That 2-Approximate the Routing Cost -- 6 Considering few Randomly Chosen SP-Trees Is Almost as Good -- 7 How to Compute the Routing Cost of Many SP-Trees in Parallel -- 8 Proofs of Main Results -- References -- Randomized Lower Bound for Distributed Spanning-Tree Verification -- 1 Introduction -- 2 Related Work
  • 2 Graphs Properties and Reachable Vertices -- 3 Model -- 4 Cartography of Reachable Vertices -- 5 Isolation Lemma -- 6 Election Algorithm -- 7 Conclusion -- References -- Rendezvous -- Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs -- 1 Introduction -- 1.1 Overview -- 1.2 Our Contributions -- 1.3 Related Work -- 2 Model and Notations -- 3 Lower Bound for Distance-Aware Rendezvous -- 4 Upper Bound and Algorithm for Rendezvous -- 5 Conclusions -- References -- Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks -- 1 Introduction -- 1.1 The Model and the Problem -- 1.2 Related Work -- 1.3 Additional Notation -- 1.4 Possible Restrictions on Weight Functions -- 1.5 Our Results -- 2 Communication Complexity for Θ(TOPT) Time -- 2.1 The Case of Arbitrary Functions -- 2.2 The Case of Ordered Edges -- 2.3 The Case of Ordered Agents -- 3 Rendezvous with No Communication -- 3.1 The Case of Arbitrary Functions -- 3.2 Lower Bound for the Case of Ordered Edges without Communication -- 4 Final Remarks -- References -- Mobile Agents -- Move-Optimal Partial Gathering of Mobile Agents in Asynchronous Trees -- 1 Introduction -- 1.1 Background and Our Contribution -- 1.2 Related Works -- 2 Preliminaries -- 2.1 Network and Agent Model -- 2.2 System Configuration -- 2.3 Partial Gathering Problem -- 3 Strong Multiplicity Detection and Non-Token Model -- 4 Weak Multiplicity Detection and Removable-Token Model -- 4.1 The First Part: Leader Election -- 4.2 The Second Part: Leaders' Instruction and Agents' Movement -- 5 Conclusion -- References -- A Recursive Approach to Multi-robot Exploration of Trees -- 1 Introduction -- 2 The Yo-yo Exploration -- 3 The Yo* Algorithm -- 4 Conclusions -- References -- Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host -- 1 Introduction -- 2 Preliminaries -- 2.1 System Model
  • 7 Conclusion and Future Prospects -- References -- Network Creation Games with Traceroute-Based Strategies -- 1 Introduction -- 2 Convergence -- 2.1 Model M1 -- 2.2 Models M2 and M3 -- 3 Complexity of Computing a Best Response -- 3.1 Model M1 -- 3.2 Model M2 -- 3.3 Model M3 -- 4 Price of Anarchy -- References -- Patrolling and Barrier Coverage -- Patrolling by Robots Equipped with Visibility -- 1 Introduction -- 1.1 Preliminaries and Notation -- 1.2 RelatedWork -- 1.3 Outline and Results of the Paper -- 2 Circle Patrolling -- 2.1 Equal Speeds -- 2.2 Different Speeds -- 3 Segment Patrolling -- 3.1 Equal Speeds -- 3.2 Different Speeds -- 4 Hardness Results -- 5 Conclusion -- References -- Distributed Barrier Coverage with Relocatable Sensors -- 1 Introduction -- 1.1 The Problem -- 1.2 Main Contributions -- 2 Model and Notation -- 3 Impossibility without Orientation -- 4 Possibility with Orientation -- 5 On Visibility and Convergence -- 6 Conclusions -- References -- Exploration -- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses -- 1 Introduction -- 2 Preliminaries -- 3 Chain Method -- 4 Star Method -- 5 Mixed Method -- 5.1 Upper Bound for the Algorithm Mixed-Method -- 5.2 Lower Bound for the Algorithm Mixed-Method -- 6 Conclusion -- References -- How Many Ants Does It Take to Find the Food? -- 1 Introduction -- 2 Four Agents -- 3 Three Agents -- 3.1 Deterministic Protocol for sync-ANTS -- 3.2 Randomized Protocol for async-ANTS -- 4 Two Agents -- 4.1 No Deterministic FA-Protocol -- 4.2 Deterministic FA/PDA-Protocol for sync-ANTS -- 4.3 Deterministic PDA-Protocol for async-ANTS -- 5 One Agent -- 5.1 No Deterministic PDA-Protocol -- 5.2 Randomized PDA-Protocol for async-ANTS -- Conclusion -- References -- What Do We Need to Know to Elect in Networks with Unknown Participants? -- 1 Introduction