| Distributed Graph Problems Through an Automata-Theoretic Lens
|
2021 |
Chang, Yi-Jun |
| Distributed Algorithms for Fractional Coloring
|
2021 |
Bousquet, Nicolas |
| Wait-Free Approximate Agreement on Graphs
|
2021 |
Alistarh, Dan |
| Superfast Coloring in CONGEST via Efficient Color Sampling
|
2021 |
Halldórsson, Magnús M. |
| The Epigenetic Consensus Problem
|
2021 |
Rashid, Sabrina |
| Threshold-Based Network Structural Dynamics
|
2021 |
Kipouridis, Evangelos |
| Two-Agent Tree Evacuation
|
2021 |
Devillez, Henri |
| Testing Equality Under the Local Broadcast Model
|
2021 |
Khan, Muhammad Samir |
| Synchronous Concurrent Broadcasts for Intermittent Channels with Bounded Capacities
|
2021 |
Turau, Volker |
| A Distributed Computing Perspective of Unconditionally Secure Information Transmission in Russian Cards Problems
|
2021 |
Rajsbaum, Sergio |
| Collecting Coupons is Faster with Friends
|
2021 |
Alistarh, Dan |
| Fragmented Objects: Boosting Concurrency of Shared Large Objects
|
2021 |
Anta, Antonio Fernández |
| Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
|
2021 |
Gorain, Barun |
| GMA: A Pareto Optimal Distributed Resource-Allocation Algorithm
|
2021 |
Giuliari, Giacomo |
| Fault-Tolerant Distance Labeling for Planar Graphs
|
2021 |
Bar-Natan, Aviv |
| New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem
|
2021 |
Bilò, Davide |
| Graph Exploration by Energy-Sharing Mobile Agents
|
2021 |
Czyzowicz, Jurek |
| Constant Round Distributed Domination on Graph Classes with Bounded Expansion
|
2021 |
Kublenz, Simeon |
| Approximate Minimum Directed Spanning Trees Under Congestion
|
2021 |
Lenzen, Christoph |
| Near-Optimal Scheduling in the Congested Clique
|
2021 |
Censor-Hillel, Keren |
Tag hinzufügen