| Invited Paper: Simple, Strict, Proper, Happy: A Study of Reachability in Temporal Graphs
|
2022 |
Casteigts, Arnaud |
| Invited Paper: Towards Practical Atomic Distributed Shared Memory: An Experimental Evaluation
|
2022 |
Trigeorgi, Andria |
| Self-stabilizing Byzantine Fault-Tolerant Repeated Reliable Broadcast
|
2022 |
Duvignau, Romaric |
| Reaching Consensus in the Presence of Contention-Related Crash Failures
|
2022 |
Durand, Anaïs |
| Brief Announcement: Dynamic Graph Models for the Bitcoin P2P Network: Simulation Analysis for Expansion and Flooding Time
|
2022 |
Cruciani, Antonio |
| Better Incentives for Proof-of-Work
|
2022 |
Sliwinski, Jakub |
| Blockchain in Dynamic Networks
|
2022 |
Bricker, Rachel |
| The Limits of Helping in Non-volatile Memory Data Structures
|
2022 |
Ben-Baruch, Ohad |
| Lower Bound for Constant-Size Local Certification
|
2022 |
Ardévol Martínez, Virgina |
| Capacity Planning for Dependable Services
|
2022 |
Faqeh, Rasha |
| Collaborative Dispersion by Silent Robots
|
2022 |
Gorain, Barun |
| Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles
|
2022 |
Shimoyama, Kohei |
| Brief Announcement: Mutually-Visible Uniform Circle Formation by Asynchronous Mobile Robots on Grid Plane
|
2022 |
Ito, Yoshiaki |
| Brief Announcement: Fully Lattice Linear Algorithms
|
2022 |
Gupta, Arya Tanmay |
| Flexible Scheduling of Transactional Memory on Trees
|
2022 |
Busch, Costas |
| Optimal Algorithms for Synchronous Byzantine k-Set Agreement
|
2022 |
Delporte-Gallet, Carole |
| Treasure Hunt in Graph Using Pebbles
|
2022 |
Bhattacharya, Adri |
| Brief Announcement: Self Masking for Hardening Inversions
|
2022 |
Cyprys, Paweł |
| Card-Based ZKP Protocol for Nurimisaki
|
2022 |
Robert, Léo |
| Brief Announcement: Self-stabilizing Total-Order Broadcast
|
2022 |
Lundström, Oskar |
Tag hinzufügen