Keynote.- On Distributed Computing: A View, Physical vs Logical Objects, and a Look at Fully Anonymous Systems.- Invited Papers.- Invited Paper: A Survey of the Impact of Knowledge on the Competitive.- Ratio in Linear Search.- Invited Paper: Gathering Oblivious Robots in the Plane.- Invited Paper: The Smart Contract Model.- Invited Paper: Using signed formulas for online certification.
- Papers.- Optimal Asynchronous Perpetual Grid Exploration.- Gathering of Robots in Butterfly Networks.- Brief Announcement: Pebble Guided Rendezvous Despite Fault.- Complete Graph Identification in Population Protocols.- Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots.- Brief Announcement: Perpetual Exploration of Triangular Grid by Myopic Oblivious Robots without Chirality.- An optimal algorithm for geodesic mutual visibility on hexagonal grids.
- Coating in SILBOT with One Axis Agreement.- Rendezvous and Merging for Two Metamorphic Robotic Systems without Global Compass.- Gathering Semi-Synchronously Scheduled Two-State Robots.- Selective Population Protocols.- Partially Disjoint Shortest Paths and Near-Shortest Paths Trees.- Brief Announcement: Towards Proportionate Fair Assignment.- BlindexTEE: A Blind Index Approach towards TEE-supported End-to-end Encrypted DBMS.- Tight Bounds for Constant-Round Domination on Graphs of High Girth and Low Expansion.
- Adding All Flavors: A Hybrid Random Number Generator for dApps and Web3.- SUPI-Rear: Privacy-Preserving Subscription Permanent Identification Strategy in 5G-AKA.- Anomaly Detection Within Mission-Critical Call Processing.- Brief Announcement: Make Master Private-Keys Secure by Keeping it Public.- Selection Guidelines for Geographical SMR Protocols: A Communication Pattern-based Latency Modeling Approach.- Byzantine Reliable Broadcast with One Trusted Monotonic Counter.- Brief Announcement: On the Feasibility of Local Failover Routing on Directed Graphs.- TRAIL: Cross-Shard Validation for Byzantine Shard Protection.
- Softening the Impact of Collisions in Contention Resolution.- Generating the Convergence Stairs of the Collatz Program.- Consensus Through Knot Discovery in Asynchronous Dynamic Networks.- A Self-Stabilizing Algorithm for the 1-Minimal Minus Domination Problem.- Brief Announcement: A Self-* and Persistent Hub Sampling Service.