PODC 2021 — Session 8 Talk 6 — Brief Announcement: An Improved Distributed Approximate Single...

preview_player
Показать описание
Full title: Brief Announcement: An Improved Distributed Approximate Single Source Shortest Paths Algorithm
  1. Association for Computing Machinery (ACM)
Рекомендации по теме
PODC 2021 — 0:20:11

PODC 2021 — Session 8 Talk 2 — Fault-Tolerant Labeling and Compact Routing Schemes

PODC 2021 — 0:20:21

PODC 2021 — Session 8 Talk 1 — Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs

PODC 2021 — 0:09:55

PODC 2021 — Session 8 Talk 6 — Brief Announcement: An Improved Distributed Approximate Single...

PODC 2021 — 0:18:44

PODC 2021 — Session 8 Talk 5 — Component Stability in Low-Space Massively Parallel Computation

PODC 2021 — 0:20:01

PODC 2021 — Session 8 Talk 3 — Time-Optimal Construction of Overlay Networks

PODC 2021 — 0:19:50

PODC 2021 — Session 8 Talk 4 — Improved Deterministic (Δ+1) Coloring in Low-Space MPC

OPODIS 2021 - 1:12:35

OPODIS 2021 - Session 8 - Shared objects and data structures

PODC 2021 — 0:17:14

PODC 2021 — Session 2 Talk 6 — Tight Trade-off in Contention Resolution without Collision Detection...

PODC 2021 — 0:09:42

PODC 2021 — Session 9 Talk 8 — Brief Announcement: What's Live? Understanding Distributed Conse...

PODC 2021 — 0:19:46

PODC 2021 — Session 7 Talk 1 — Approximate Byzantine Fault-Tolerance in Distributed Optimization

PODC 2021 — 0:17:47

PODC 2021 — Session 3 Talk 2 — All You Need is DAG

PODC 2021 — 0:07:40

PODC 2021 — Session 5 Talk 1 — Locally Checkable Problems in Rooted Trees

PODC 2021 — 0:21:00

PODC 2021 — Session 4 Talk 1 — Low-Congestion Shortcuts in Constant Diameter Graphs

PODC 2021 — 0:20:13

PODC 2021 — Session 1 Talk 2 — On Implementing Stabilizing Leader Election with Weak Assumptions......

Randomized Local Fast 0:33:17

Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion

The Canonical Amoebot 0:27:57

The Canonical Amoebot Model: Algorithms and Concurrency Control

Wake Up and 0:14:03

Wake Up and Join Me! An Energy-Efficient Algorithm for Maximal Matching in Radio Networks

PODC 2021 — 0:17:10

PODC 2021 — Session 2 Talk 1 — Search via Parallel Lévy Walks on Z^2

PODC 2021 — 0:09:13

PODC 2021 — Session 7 Talk 6 — Brief Announcement: A Randomness-efficient Massively Parallel...

Constant RMR Group 0:18:36

Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions

Locally Checkable Labelings 0:23:54

Locally Checkable Labelings with Small Messages

Deterministic Size Discovery 0:14:20

Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels

PODC 2021 — 0:19:47

PODC 2021 — Session 6 Talk 4 — A New Way to Achieve Round-Efficient Byzantine Agreement

OPODIS 2021 - 0:58:59

OPODIS 2021 - Session 1 - Byzantine fault-tolerance