大葉大學圖書館 |

Structural information and communication complexity[electronic resource] :22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015 : post-proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	005.1
書名/作者:	Structural information and communication complexity : 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015 : post-proceedings // edited by Christian Scheideler.
其他題名:	SIROCCO 2015
其他作者:	Scheideler, Christian.
團體作者:	Clark Conference
出版者:	Cham : : Springer International Publishing :, 2015.
面頁冊數:	xi, 476 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
標題:	Electronic data processing - Congresses. - Distributed processing
標題:	Computer science.
標題:	Computer networks.
標題:	Data structures (Computer science)
標題:	Algorithms.
標題:	Computer science - Mathematics.
標題:	Algorithm Analysis and Problem Complexity.
標題:	Computer Communication Networks.
標題:	Discrete Mathematics in Computer Science.
標題:	Data Structures.
ISBN:	9783319252582
ISBN:	9783319252575
內容註:	Communication Patterns and Input Patterns in Distributed Computing -- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach -- Node Labels in Local Decision -- Exact bounds for distributed graph colouring -- Essential Traffic Parameters for Shared Memory Switch Performance. -Scheduling Multipacket Frames With Frame Deadlines -- A Randomized Algorithm for Online Scheduling -- Online Admission Control and Embedding of Service Chains -- Optimizing Spread of Inuence in Social Networks via Partial Incentives -- Approximation Algorithms For Multi-Budgeted Network Design Problems -- Simple Distributed + 1 Coloring in the SINR Model -- Nearly Optimal Local Broadcasting in the SINR Model with Feedback -- Byzantine Gathering in Networks -- Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus -- A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation -- Path-Fault-Tolerant Approximate Shortest-Path Trees -- A faster computation of all the best swap edges of a tree spanner -- Randomized OBDD-Based Graph Algorithms -- On Fast and Robust Information Spreading in the Vertex-Congest Model -- Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority -- The Computability of Relaxed Data Structures: Queues and Stacks as Examples -- Comparison-based Interactive Collaborative Filtering -- Coalescing walks on rotor-router systems.
摘要、提要註:	This book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015, held in Montserrat, Spain, in July 2015. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 78 submissions. The papers focus on the study of the interplay between communication and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints.
電子資源:	http://dx.doi.org/10.1007/978-3-319-25258-2

Structural information and communication complexity[electronic resource] :22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015 : post-proceedings /
Structural information and communication complexity22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015 : post-proceedings /[electronic resource] :SIROCCO 2015edited by Christian Scheideler. - Cham :Springer International Publishing :2015. - xi, 476 p. :ill., digital ;24 cm. - Lecture notes in computer science,94390302-9743 ;. - Lecture notes in computer science ;7103..

Communication Patterns and Input Patterns in Distributed Computing -- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach -- Node Labels in Local Decision -- Exact bounds for distributed graph colouring -- Essential Traffic Parameters for Shared Memory Switch Performance. -Scheduling Multipacket Frames With Frame Deadlines -- A Randomized Algorithm for Online Scheduling -- Online Admission Control and Embedding of Service Chains -- Optimizing Spread of Inuence in Social Networks via Partial Incentives -- Approximation Algorithms For Multi-Budgeted Network Design Problems -- Simple Distributed + 1 Coloring in the SINR Model -- Nearly Optimal Local Broadcasting in the SINR Model with Feedback -- Byzantine Gathering in Networks -- Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus -- A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation -- Path-Fault-Tolerant Approximate Shortest-Path Trees -- A faster computation of all the best swap edges of a tree spanner -- Randomized OBDD-Based Graph Algorithms -- On Fast and Robust Information Spreading in the Vertex-Congest Model -- Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority -- The Computability of Relaxed Data Structures: Queues and Stacks as Examples -- Comparison-based Interactive Collaborative Filtering -- Coalescing walks on rotor-router systems.

This book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015, held in Montserrat, Spain, in July 2015. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 78 submissions. The papers focus on the study of the interplay between communication and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints.

ISBN: 9783319252582

Standard No.: 10.1007/978-3-319-25258-2doiSubjects--Topical Terms:

387550
Electronic data processing
--Distributed processing--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Structural information and communication complexity[electronic resource] :22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015 : post-proceedings /
LDR:03118nam a2200337 a 4500 001 444003
003 DE-He213
005 20160426155203.0
006 m d
007 cr nn 008maaau
008 160715s2015 gw s 0 eng d
020 $a 9783319252582 $q (electronic bk.)
020 $a 9783319252575 $q (paper)
024 7 $a 10.1007/978-3-319-25258-2 $2 doi
035 $a 978-3-319-25258-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b C714 2015
111 2 $a Clark Conference $d (2005 : $c Sterling and Francine Clark Art Institute) $3 347558
245 1 0 $a Structural information and communication complexity $h [electronic resource] : $b 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015 : post-proceedings / $c edited by Christian Scheideler.
246 3 $a SIROCCO 2015
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a xi, 476 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 9439
505 0 $a Communication Patterns and Input Patterns in Distributed Computing -- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach -- Node Labels in Local Decision -- Exact bounds for distributed graph colouring -- Essential Traffic Parameters for Shared Memory Switch Performance. -Scheduling Multipacket Frames With Frame Deadlines -- A Randomized Algorithm for Online Scheduling -- Online Admission Control and Embedding of Service Chains -- Optimizing Spread of Inuence in Social Networks via Partial Incentives -- Approximation Algorithms For Multi-Budgeted Network Design Problems -- Simple Distributed + 1 Coloring in the SINR Model -- Nearly Optimal Local Broadcasting in the SINR Model with Feedback -- Byzantine Gathering in Networks -- Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus -- A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation -- Path-Fault-Tolerant Approximate Shortest-Path Trees -- A faster computation of all the best swap edges of a tree spanner -- Randomized OBDD-Based Graph Algorithms -- On Fast and Robust Information Spreading in the Vertex-Congest Model -- Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority -- The Computability of Relaxed Data Structures: Queues and Stacks as Examples -- Comparison-based Interactive Collaborative Filtering -- Coalescing walks on rotor-router systems.
520 $a This book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2015, held in Montserrat, Spain, in July 2015. The 30 full papers presented together with 2 invited papers were carefully reviewed and selected from 78 submissions. The papers focus on the study of the interplay between communication and knowledge in multi-processor systems from both the qualitative and quantitative viewpoints.
650 0 $a Electronic data processing $x Distributed processing $v Congresses. $3 387550
650 0 $a Computer science. $3 182962
650 0 $a Computer networks. $3 174051
650 0 $a Data structures (Computer science) $3 417983
650 0 $a Algorithms. $3 182797
650 0 $a Computer science $x Mathematics. $3 382369
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 463701
650 2 4 $a Computer Communication Networks. $3 464535
650 2 4 $a Discrete Mathematics in Computer Science. $3 464912
650 2 4 $a Data Structures. $3 467911
700 1 $a Scheideler, Christian. $3 635151
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 7103. $3 466200
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-25258-2
950 $a Computer Science (Springer-11645)