國立高雄大學圖資館 |

登入

回首頁

Structural information and communication complexity32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Structural information and communication complexityedited by Ulrich Schmid, Roman Kuznets.
其他題名:	32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025 : proceedings /
其他題名:	SIROCCO 2025
其他作者:	Schmid, Ulrich.
團體作者:
出版者:	Cham :Springer Nature Switzerland :2025.
面頁冊數:	xxvii, 446 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Electronic data processingCongresses.Distributed processing
電子資源:	https://doi.org/10.1007/978-3-031-91736-3
ISBN:	9783031917363$q(electronic bk.)

Structural information and communication complexity32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025 : proceedings /
Structural information and communication complexity32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025 : proceedings /[electronic resource] :SIROCCO 2025edited by Ulrich Schmid, Roman Kuznets. - Cham :Springer Nature Switzerland :2025. - xxvii, 446 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,156711611-3349 ;. - Lecture notes in computer science ;4891..

Regular Papers -- Support + Belief = Decision Trust -- Asynchronous Byzantine Consensus with Trusted Monotonic Counters -- Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols -- On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement -- Exploration of Convex Terrains by a Deterministic Automaton with Pebbles -- Explicit Token-Based Communication for Mobile Entities -- Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs -- Deterministic Color-optimal Self-stabilizing Semi-synchronous Gathering: a Certified Algorithm -- Approximating Independent Sets in Constant Distributed Rounds -- A Visibility vs. Memory Trade-off for Stand-Up Indulgent Gathering on Lines -- Simplicial Belief -- When MIS and Maximal Matching are Easy in the Congested Clique -- Bankrupting DoS Attackers -- Low-Distortion Clustering in Bounded Growth Graphs -- Multimodal Search on a Line -- Multi-Agent Disk Inspection -- Pointer Chasing with Unlimited Interaction -- Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation -- On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies -- Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity -- Lower bounds for uniform read-once threshold formulae in the randomized decision tree model -- Distributed Distance Sensitivity Oracles -- Self-stabilizing Graph Exploration by a Single Agent -- Labeling Embeddings of Planar Graphs for Face-Adjacency -- Brief Announcements -- Brief Announcement: Relaxation for Efficient Asynchronous Queues -- Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems -- Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model -- Brief Announcement: Perfect Matching with Few Link Activations.

This book constitutes the refereed proceedings of the 32nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2025, held in Delphi, Greece in June 2025. The 24 full papers and 4 brief announcements included in the proceedings were carefully reviewed and selected from a total of 57 submissions. They focus on innovative methodological and solution approaches in structural knowledge, communication, and computing in decentralized systems of multiple comunicating entities. .

ISBN: 9783031917363$q(electronic bk.)

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

384493
Electronic data processing
--Distributed processing--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Structural information and communication complexity32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025 : proceedings /
LDR:03604nmm a2200349 a 4500 001 677576
003 DE-He213
005 20250522130238.0
006 m d
007 cr nn 008maaau
008 251021s2025 sz s 0 eng d
020 $a 9783031917363$q(electronic bk.)
020 $a 9783031917356$q(paper)
024 7 $a 10.1007/978-3-031-91736-3 $2 doi
035 $a 978-3-031-91736-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b C714 2025
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Structural information and communication complexity $h [electronic resource] : $b 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2-4, 2025 : proceedings / $c edited by Ulrich Schmid, Roman Kuznets.
246 3 $a SIROCCO 2025
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xxvii, 446 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 1611-3349 ; $v 15671
505 0 $a Regular Papers -- Support + Belief = Decision Trust -- Asynchronous Byzantine Consensus with Trusted Monotonic Counters -- Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols -- On the Existence of Extension-Based Proofs of Impossibility for Set-Agreement -- Exploration of Convex Terrains by a Deterministic Automaton with Pebbles -- Explicit Token-Based Communication for Mobile Entities -- Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs -- Deterministic Color-optimal Self-stabilizing Semi-synchronous Gathering: a Certified Algorithm -- Approximating Independent Sets in Constant Distributed Rounds -- A Visibility vs. Memory Trade-off for Stand-Up Indulgent Gathering on Lines -- Simplicial Belief -- When MIS and Maximal Matching are Easy in the Congested Clique -- Bankrupting DoS Attackers -- Low-Distortion Clustering in Bounded Growth Graphs -- Multimodal Search on a Line -- Multi-Agent Disk Inspection -- Pointer Chasing with Unlimited Interaction -- Oblivious Robots Under Sequential Schedulers: Universal Pattern Formation -- On the Dynamical Hierarchy in Gathering Protocols with Circulant Topologies -- Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity -- Lower bounds for uniform read-once threshold formulae in the randomized decision tree model -- Distributed Distance Sensitivity Oracles -- Self-stabilizing Graph Exploration by a Single Agent -- Labeling Embeddings of Planar Graphs for Face-Adjacency -- Brief Announcements -- Brief Announcement: Relaxation for Efficient Asynchronous Queues -- Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems -- Brief Announcement: Hardness of Approximate Vertex Ranking by Betweenness Centrality in the CONGEST Model -- Brief Announcement: Perfect Matching with Few Link Activations.
520 $a This book constitutes the refereed proceedings of the 32nd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2025, held in Delphi, Greece in June 2025. The 24 full papers and 4 brief announcements included in the proceedings were carefully reviewed and selected from a total of 57 submissions. They focus on innovative methodological and solution approaches in structural knowledge, communication, and computing in decentralized systems of multiple comunicating entities. .
650 0 $a Electronic data processing $x Distributed processing $v Congresses. $3 384493
650 0 $a Computer networks $v Congresses. $3 384494
650 0 $a Digital communications $v Congresses. $3 388692
650 1 4 $a Design and Analysis of Algorithms. $3 913142
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Computer and Information Systems Applications. $3 913125
650 2 4 $a Operating Systems. $3 274474
650 2 4 $a Computer Engineering and Networks. $3 913124
650 2 4 $a Discrete Mathematics in Computer Science. $3 274791
700 1 $a Schmid, Ulrich. $3 866813
700 1 $a Kuznets, Roman. $3 991082
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-91736-3
950 $a Computer Science (SpringerNature-11645)