國立虎尾科技大學 |

Structural Information and Communication Complexity = 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Structural Information and Communication Complexity/ edited by Christian Scheideler.
其他題名:	22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings /
其他作者:	Scheideler, Christian.
面頁冊數:	XI, 476 p. 52 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-319-25258-2
ISBN:	9783319252582

Structural Information and Communication Complexity = 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] :edited by Christian Scheideler. - 1st ed. 2015. - XI, 476 p. 52 illus.online resource. - Theoretical Computer Science and General Issues ;9439. - Theoretical Computer Science and General Issues ;9163.

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:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Structural Information and Communication Complexity = 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015. Post-Proceedings /
LDR:03461nam a22004095i 4500 001 969228
003 DE-He213
005 20200705022714.0
007 cr nn 008mamaa
008 201211s2015 gw | s |||| 0|eng d
020 $a 9783319252582 $9 978-3-319-25258-2
024 7 $a 10.1007/978-3-319-25258-2 $2 doi
035 $a 978-3-319-25258-2
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
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.
250 $a 1st ed. 2015.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a XI, 476 p. 52 illus. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $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 Algorithms. $3 527865
650 0 $a Computer communication systems. $3 1115394
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
700 1 $a Scheideler, Christian. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 883214
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319252575
776 0 8 $i Printed edition: $z 9783319252599
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-25258-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)