{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":29,"n_cols":5,"rows_kept":29,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[23,2,23,3],[24,2,24,3],[26,2,26,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNISA996660360703316"]
[null,null,"Titolo",null,"Structural Information and Communication Complexity : 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2–4, 2025, Proceedings / / edited by Ulrich Schmid, Roman Kuznets"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2025"]
[null,null,"ISBN",null,"3-031-91736-7"]
[null,null,"Edizione",null,"[1st ed. 2025.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XXVII, 446 p. 97 illus., 32 illus. in color.)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science, , 1611-3349 ; ; 15671"]
[null,null,"Disciplina",null,"005.13"]
[null,null,"Soggetti",null,"Algorithms"]
[{"$nulls":4},"Data structures (Computer science)"]
[{"$nulls":4},"Information theory"]
[{"$nulls":4},"Application software"]
[{"$nulls":4},"Operating systems (Computers)"]
[{"$nulls":4},"Computer engineering"]
[{"$nulls":4},"Computer networks"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Design and Analysis of Algorithms"]
[{"$nulls":4},"Data Structures and Information Theory"]
[{"$nulls":4},"Computer and Information Systems Applications"]
[{"$nulls":4},"Operating Systems"]
[{"$nulls":4},"Computer Engineering and Networks"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"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 "]
[{"$nulls":4},"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."]
[null,null,null,"Sommario/riassunto","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. ."]