Muutke küpsiste eelistusi

Structural Information and Communication Complexity: 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 24, 2025, Proceedings [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 446 pages, kõrgus x laius: 235x155 mm, 32 Illustrations, color; 65 Illustrations, black and white; XXVII, 446 p. 97 illus., 32 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15671
  • Ilmumisaeg: 15-May-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031917359
  • ISBN-13: 9783031917356
Teised raamatud teemal:
  • Pehme köide
  • Hind: 141,35 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 166,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Structural Information and Communication Complexity: 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 24, 2025, ProceedingsSuurem pilt
  • Formaat: Paperback / softback, 446 pages, kõrgus x laius: 235x155 mm, 32 Illustrations, color; 65 Illustrations, black and white; XXVII, 446 p. 97 illus., 32 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 15671
  • Ilmumisaeg: 15-May-2025
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031917359
  • ISBN-13: 9783031917356
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031917356.html
Märksõnad:
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. 
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.