東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Structural information and communica...

Colloquium on Structural Information and Communication Complexity (2023 :)

FindBook

Google Book

Amazon

博客來

Structural information and communication complexity = 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Structural information and communication complexity/ edited by Sergio Rajsbaum ... [et al.].
其他題名:	30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023 : proceedings /
其他題名:	SIROCCO 2023
其他作者:	Rajsbaum, Sergio.
團體作者:	Colloquium on Structural Information and Communication Complexity
出版者:	Cham :Springer Nature Switzerland : : 2023.,
面頁冊數:	1 online resource (xi, 596 p.) :ill. (some col.), digital ;24 cm.
內容註:	30th Anniversary track -- Degree Realization by Bipartite Multigraphs -- Thirty years of SIROCCO. A data and graph mining comparative analysis of its temporal evolution -- About Informatics, Distributed Computing, and our Job: a Personal View -- Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks With Feedback -- SIROCCO Main track -- Distributed Coloring of Hypergraphs -- Lockless Blockchain Sharding with Multiversion Control -- Lockless Blockchain Sharding with Multiversion Control -- Compatibility of convergence algorithms for autonomous mobile robots -- FnF-BFT: A BFT protocol with provable performance under attack -- Divide & Scale: Formalization and Roadmap to Robust Sharding -- Zero-Memory Graph Exploration with Unknown Inports -- The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-genus Networks -- Search and Rescue on the Line -- Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs -- Distributed Half-Integral Matching and Beyond -- Boundary Sketching with Asymptotically Optimal Distance and Rotation -- Cops & Robber on Periodic Temporal Graphs : Characterization and Improved Bounds -- Minimum Cost Flow in the CONGEST Model -- The communication complexity of functions with large outputs -- On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST model -- Energy-Efficient Distributed Algorithms for Synchronous Networks -- Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity -- Overcoming Probabilistic Faults in Disoriented Linear Search -- Packet Forwarding with Swaps -- Exact Distributed Sampling -- Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.
Contained By:	Springer Nature eBook
標題:	Electronic data processing - Congresses. - Distributed processing -
電子資源:	https://doi.org/10.1007/978-3-031-32733-9
ISBN:	9783031327339

Structural information and communication complexity = 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023 : proceedings /
Structural information and communication complexity30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023 : proceedings /[electronic resource] :SIROCCO 2023edited by Sergio Rajsbaum ... [et al.]. - Cham :Springer Nature Switzerland :2023. - 1 online resource (xi, 596 p.) :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,138921611-3349 ;. - Lecture notes in computer science ;13892..

30th Anniversary track -- Degree Realization by Bipartite Multigraphs -- Thirty years of SIROCCO. A data and graph mining comparative analysis of its temporal evolution -- About Informatics, Distributed Computing, and our Job: a Personal View -- Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks With Feedback -- SIROCCO Main track -- Distributed Coloring of Hypergraphs -- Lockless Blockchain Sharding with Multiversion Control -- Lockless Blockchain Sharding with Multiversion Control -- Compatibility of convergence algorithms for autonomous mobile robots -- FnF-BFT: A BFT protocol with provable performance under attack -- Divide & Scale: Formalization and Roadmap to Robust Sharding -- Zero-Memory Graph Exploration with Unknown Inports -- The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-genus Networks -- Search and Rescue on the Line -- Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs -- Distributed Half-Integral Matching and Beyond -- Boundary Sketching with Asymptotically Optimal Distance and Rotation -- Cops & Robber on Periodic Temporal Graphs : Characterization and Improved Bounds -- Minimum Cost Flow in the CONGEST Model -- The communication complexity of functions with large outputs -- On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST model -- Energy-Efficient Distributed Algorithms for Synchronous Networks -- Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity -- Overcoming Probabilistic Faults in Disoriented Linear Search -- Packet Forwarding with Swaps -- Exact Distributed Sampling -- Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.

This book constitutes the refereed proceedings of the 30th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2023, held in Alcalá de Henares, Spain, during June 6-9, 2023. The 26 full papers presented in this book were carefully reviewed and selected from 48 submissions. SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative approaches leading to better understanding of the relationship between computing and communication. This is the 30th edition of SIROCCO, and 3 of the 26 papers in this book are devoted to celebrating this fact, plus an additional paper about a recent trend to study special models of computation.

ISBN: 9783031327339

Standard No.: 10.1007/978-3-031-32733-9doiSubjects--Topical Terms:

622708
Electronic data processing
--Distributed processing--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Structural information and communication complexity = 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023 : proceedings /
LDR:03800nmm a2200349 a 4500 001 2318574
003 DE-He213
005 20230510001300.0
006 m d
007 cr nn 008maaau
008 230902s2023 sz s 0 eng d
020 $a 9783031327339 $q (electronic bk.)
020 $a 9783031327322 $q (paper)
024 7 $a 10.1007/978-3-031-32733-9 $2 doi
035 $a 978-3-031-32733-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UYA $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b C714 2023
111 2 $a Colloquium on Structural Information and Communication Complexity $n (30th : $d 2023 : $c Alcalá de Henares, Spain) $3 3633704
245 1 0 $a Structural information and communication complexity $h [electronic resource] : $b 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6-9, 2023 : proceedings / $c edited by Sergio Rajsbaum ... [et al.].
246 3 $a SIROCCO 2023
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2023.
300 $a 1 online resource (xi, 596 p.) : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 13892
505 0 $a 30th Anniversary track -- Degree Realization by Bipartite Multigraphs -- Thirty years of SIROCCO. A data and graph mining comparative analysis of its temporal evolution -- About Informatics, Distributed Computing, and our Job: a Personal View -- Learning Hierarchically-Structured Concepts II: Overlapping Concepts, and Networks With Feedback -- SIROCCO Main track -- Distributed Coloring of Hypergraphs -- Lockless Blockchain Sharding with Multiversion Control -- Lockless Blockchain Sharding with Multiversion Control -- Compatibility of convergence algorithms for autonomous mobile robots -- FnF-BFT: A BFT protocol with provable performance under attack -- Divide & Scale: Formalization and Roadmap to Robust Sharding -- Zero-Memory Graph Exploration with Unknown Inports -- The Energy Complexity of Diameter and Minimum Cut Computation in Bounded-genus Networks -- Search and Rescue on the Line -- Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs -- Distributed Half-Integral Matching and Beyond -- Boundary Sketching with Asymptotically Optimal Distance and Rotation -- Cops & Robber on Periodic Temporal Graphs : Characterization and Improved Bounds -- Minimum Cost Flow in the CONGEST Model -- The communication complexity of functions with large outputs -- On the Power of Threshold-Based Algorithms for Detecting Cycles in the CONGEST model -- Energy-Efficient Distributed Algorithms for Synchronous Networks -- Spanning Trees with Few Branch Vertices in Graphs of Bounded Neighborhood Diversity -- Overcoming Probabilistic Faults in Disoriented Linear Search -- Packet Forwarding with Swaps -- Exact Distributed Sampling -- Weighted Packet Selection for Rechargeable Links in Cryptocurrency Networks: Complexity and Approximation.
520 $a This book constitutes the refereed proceedings of the 30th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2023, held in Alcalá de Henares, Spain, during June 6-9, 2023. The 26 full papers presented in this book were carefully reviewed and selected from 48 submissions. SIROCCO is devoted to the study of the interplay between structural knowledge, communication, and computing in decentralized systems of multiple communicating entities. Special emphasis is given to innovative approaches leading to better understanding of the relationship between computing and communication. This is the 30th edition of SIROCCO, and 3 of the 26 papers in this book are devoted to celebrating this fact, plus an additional paper about a recent trend to study special models of computation.
650 0 $a Electronic data processing $x Distributed processing $v Congresses. $3 622708
650 0 $a Computer networks $v Congresses. $3 569849
650 0 $a Digital communications $x Congresses. $3 678614
650 1 4 $a Design and Analysis of Algorithms. $3 3538532
650 2 4 $a Data Structures and Information Theory. $3 3382368
650 2 4 $a Computer and Information Systems Applications. $3 3538505
650 2 4 $a Operating Systems. $3 892491
650 2 4 $a Computer Engineering and Networks. $3 3538504
650 2 4 $a Discrete Mathematics in Computer Science. $3 892513
700 1 $a Rajsbaum, Sergio. $3 1073165
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 13892. $3 3633705
856 4 0 $u https://doi.org/10.1007/978-3-031-32733-9
950 $a Computer Science (SpringerNature-11645)