OPAC

検索結果一覧に戻る

Structural Information and Communication Complexity : 30th International Colloquium, SIROCCO 2023, Alcalá de Henares, Spain, June 6–9, 2023, Proceedings / edited by Sergio Rajsbaum, Alkida Balliu, Joshua J. Daymude, Dennis Olivetti
(Lecture Notes in Computer Science. ISSN:16113349 ; 13892)

データ種別	電子ブック
版	1st ed. 2023.
出版者	(Cham : Springer Nature Switzerland : Imprint: Springer)
出版年	2023
大きさ	XI, 596 p. 134 illus., 79 illus. in color : online resource
著者標目	Rajsbaum, Sergio editor Balliu, Alkida editor Daymude, Joshua J editor Olivetti, Dennis editor SpringerLink (Online service)

所蔵情報を非表示

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0002128	Computer Scinece R0 2005-6,2022-3				9783031327339

書誌詳細を非表示

一般注記	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 Alcalá 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 HTTP:URL=https://doi.org/10.1007/978-3-031-32733-9
件　名	LCSH:Algorithms LCSH:Data structures (Computer science) LCSH:Information theory LCSH:Application software LCSH:Operating systems (Computers) LCSH:Computer engineering LCSH:Computer networks LCSH:Computer science—Mathematics LCSH:Discrete mathematics FREE:Design and Analysis of Algorithms FREE:Data Structures and Information Theory FREE:Computer and Information Systems Applications FREE:Operating Systems FREE:Computer Engineering and Networks FREE:Discrete Mathematics in Computer Science
分　類	LCC:QA9.58 DC23:005.13
書誌ID	EB00001516
ISBN	9783031327339