Geschäftskunden Kundenprogramme

KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
Produktbild: Structural Information and Communication Complexity
Band 15671

Structural Information and Communication Complexity 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2–4, 2025, Proceedings

Aus der Reihe Lecture Notes in Computer Science

Fr. 191.00

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

15.05.2025

Abbildungen

XXVII, 446 p. 97 illus., 32 illus. in color.

Herausgeber

Ulrich Schmid + weitere

Verlag

Springer

Seitenzahl

446

Maße (L/B/H)

23.5/15.5/2.6 cm

Gewicht

715 g

Sprache

Englisch

ISBN

978-3-031-91735-6

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

15.05.2025

Abbildungen

XXVII, 446 p. 97 illus., 32 illus. in color.

Herausgeber

Verlag

Springer

Seitenzahl

446

Maße (L/B/H)

23.5/15.5/2.6 cm

Gewicht

715 g

Sprache

Englisch

ISBN

978-3-031-91735-6

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Structural Information and Communication Complexity

  • 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.