The Resource Structural information and communication complexity : 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings, edited by Magnús M. Halldórsson

Structural information and communication complexity : 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings, edited by Magnús M. Halldórsson

Label
Structural information and communication complexity : 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings
Title
Structural information and communication complexity
Title remainder
21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings
Statement of responsibility
edited by Magnús M. Halldórsson
Title variation
SIROCCO 2014
Creator
Contributor
Editor
Provider
Subject
Genre
Language
eng
Summary
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 submissions. The focus of the colloquium is on following subjects Shared Memory, and Multiparty Communication, Network Optimization, CONGEST Algorithms and Lower Bounds, Wireless networks, Aggregation and Creation Games in Networks, Patrolling and Barrier Coverage, Exploration, Rendevous, and Mobile Agents
Member of
Cataloging source
GW5XE
Image bit depth
0
LC call number
QA76.9.D5
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2014
http://bibfra.me/vocab/lite/meetingName
Colloquium on Structural Information and Communication Complexity
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • SpringerLink
  • Magnús M. Halldórsson
Series statement
Lecture Notes in Computer Science,
Series volume
8576
http://library.link/vocab/subjectName
  • Computer Science
  • Algorithm Analysis and Problem Complexity
  • Computer Communication Networks
  • Discrete Mathematics in Computer Science
  • Data Structures
  • Algorithms
  • Electronic data processing
  • Data structures (Computer science)
  • Telecommunication systems
  • Data structures (Computer science)
  • Electronic data processing
  • Telecommunication systems
Label
Structural information and communication complexity : 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings, edited by Magnús M. Halldórsson
Instantiates
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Invited Presentations -- Algorithmic Aspects of Resource Management in the Cloud -- From Turing to the Clouds (On the Computability Power of Distributed Systems) -- Communication Complexity Lower Bounds in Distributed Message-Passing -- Biological Distributed Computing -- Distributed Algorithmic Foundations of Dynamic Networks -- Best Student Paper -- The Beachcombers' Problem: Walking and Searching with Mobile Robots -- Shared Memory and Multiparty Communication -- Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems -- Distributed Transactional Contention Management as the Traveling Salesman Problem -- The complexity gap between consensus and safe-consensus (Extended Abstract) -- The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism -- Network Optimization -- Approximation of the Degree-Constrained Minimum Spanning Hierarchies -- Secluded Path via Shortest Path -- CONGEST Algorithms and Lower Bounds -- Distributed Approximation of Minimum Routing Cost Trees -- Randomized Lower Bound for Distributed Spanning-Tree Verification.-Lessons from the Congested Clique Applied to MapReduce -- Wireless networks -- Oblivious Rendezvous in Cognitive Radio Networks -- Local Broadcasting with Arbitrary Transmission Power in the SINR Model -- Aggregation and Creation Games in Networks -- Continuous Aggregation in Dynamic Ad-Hoc Networks -- Network Creation Games with Traceroute-Based Strategies -- Patrolling and Barrier Coverage.-Patrolling by Robots Equipped with Visibility -- Distributed Barrier Coverage with Relocatable Sensors -- Exploration -- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses -- How Many Ants Does It Take To Find the Food? -- What Do We Need to Know to Elect in Networks with Unknown Participants? -- Rendezvous.-Rendezvous of Distance-aware Mobile Agents in Unknown Graphs -- Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks -- Mobile Agents.-Move-optimal partial gathering of mobile agents in asynchronous trees -- A Recursive Approach to Multi-Robot Exploration of Trees.-Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host
Dimensions
unknown
Extent
1 online resource (xx, 372 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783319096209
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-09620-9
Other physical details
illustrations.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (OCoLC)884893335
  • (OCoLC)ocn884893335
Label
Structural information and communication complexity : 21st International Colloquium, SIROCCO 2014, Takayama, Japan, July 23-25, 2014. Proceedings, edited by Magnús M. Halldórsson
Publication
Note
  • International conference proceedings
  • Includes author index
Antecedent source
mixed
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
txt
Content type MARC source
rdacontent
Contents
Invited Presentations -- Algorithmic Aspects of Resource Management in the Cloud -- From Turing to the Clouds (On the Computability Power of Distributed Systems) -- Communication Complexity Lower Bounds in Distributed Message-Passing -- Biological Distributed Computing -- Distributed Algorithmic Foundations of Dynamic Networks -- Best Student Paper -- The Beachcombers' Problem: Walking and Searching with Mobile Robots -- Shared Memory and Multiparty Communication -- Reliable Shared Memory Abstractions on Top of Asynchronous t-Resilient Byzantine Message-passing Systems -- Distributed Transactional Contention Management as the Traveling Salesman Problem -- The complexity gap between consensus and safe-consensus (Extended Abstract) -- The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism -- Network Optimization -- Approximation of the Degree-Constrained Minimum Spanning Hierarchies -- Secluded Path via Shortest Path -- CONGEST Algorithms and Lower Bounds -- Distributed Approximation of Minimum Routing Cost Trees -- Randomized Lower Bound for Distributed Spanning-Tree Verification.-Lessons from the Congested Clique Applied to MapReduce -- Wireless networks -- Oblivious Rendezvous in Cognitive Radio Networks -- Local Broadcasting with Arbitrary Transmission Power in the SINR Model -- Aggregation and Creation Games in Networks -- Continuous Aggregation in Dynamic Ad-Hoc Networks -- Network Creation Games with Traceroute-Based Strategies -- Patrolling and Barrier Coverage.-Patrolling by Robots Equipped with Visibility -- Distributed Barrier Coverage with Relocatable Sensors -- Exploration -- Exploration of Constantly Connected Dynamic Graphs Based on Cactuses -- How Many Ants Does It Take To Find the Food? -- What Do We Need to Know to Elect in Networks with Unknown Participants? -- Rendezvous.-Rendezvous of Distance-aware Mobile Agents in Unknown Graphs -- Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks -- Mobile Agents.-Move-optimal partial gathering of mobile agents in asynchronous trees -- A Recursive Approach to Multi-Robot Exploration of Trees.-Improved Periodic Data Retrieval in Asynchronous Rings with a Faulty Host
Dimensions
unknown
Extent
1 online resource (xx, 372 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783319096209
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-09620-9
Other physical details
illustrations.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (OCoLC)884893335
  • (OCoLC)ocn884893335

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...