Media Summary: Whichever you think might be better addressed in the Due to technical difficulties, Yitong Yin's slides were not displayed correctly. Another version of his talk is available here: ... ... undirected graphs there's also some results that don't use hop sets these are due to Lee

Stoc 2020 Session 3a Distributed - Detailed Analysis & Overview

Whichever you think might be better addressed in the Due to technical difficulties, Yitong Yin's slides were not displayed correctly. Another version of his talk is available here: ... ... undirected graphs there's also some results that don't use hop sets these are due to Lee All right hi everyone good morning good afternoon or good evening or whatever and welcome to So maybe you can skip that yeah yeah okay okay yeah hello everyone welcome to the Hi wait wait let me start by presenting the start of the

Okay so it's a pleasure uh to have christian here uh he's the first speaker of Okay good yeah just maybe I'll just introduce the

Photo Gallery

STOC 2020 - Session 3A: Distributed and Parallel Algorithms II
STOC 2020 - Session 6C: Optimization
STOC 2020 - Session 5: Best Papers
Session 3A - Walking Randomly, Massively, and Efficiently
STOC 2020 - Workshop 1: New Frontiers in Approximate Counting
Session 3A - Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths
STOC 2020 - Session 2A: Dynamic Algorithms
STOC 2020 - Session 3C: Privacy and Fairness
STOC 2020 - Session 1C: Distributed and Parallel Algorithms I
STOC 2020 - Session 9B: Randomness in Computing
STOC 2020 - Session 8A: Fine-Grained Complexity
STOC 2020 - Session 6B: Complexity I
View Detailed Profile
STOC 2020 - Session 3A: Distributed and Parallel Algorithms II

STOC 2020 - Session 3A: Distributed and Parallel Algorithms II

All right welcome everyone to

STOC 2020 - Session 6C: Optimization

STOC 2020 - Session 6C: Optimization

Okay everyone hi welcome to

STOC 2020 - Session 5: Best Papers

STOC 2020 - Session 5: Best Papers

Whichever you think might be better addressed in the

Session 3A - Walking Randomly, Massively, and Efficiently

Session 3A - Walking Randomly, Massively, and Efficiently

... said that

STOC 2020 - Workshop 1: New Frontiers in Approximate Counting

STOC 2020 - Workshop 1: New Frontiers in Approximate Counting

Due to technical difficulties, Yitong Yin's slides were not displayed correctly. Another version of his talk is available here: ...

Session 3A - Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths

Session 3A - Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths

... undirected graphs there's also some results that don't use hop sets these are due to Lee

STOC 2020 - Session 2A: Dynamic Algorithms

STOC 2020 - Session 2A: Dynamic Algorithms

All right so welcome everyone to this

STOC 2020 - Session 3C: Privacy and Fairness

STOC 2020 - Session 3C: Privacy and Fairness

All right hi everyone good morning good afternoon or good evening or whatever and welcome to

STOC 2020 - Session 1C: Distributed and Parallel Algorithms I

STOC 2020 - Session 1C: Distributed and Parallel Algorithms I

Really so welcome to the first

STOC 2020 - Session 9B: Randomness in Computing

STOC 2020 - Session 9B: Randomness in Computing

So maybe you can skip that yeah yeah okay okay yeah hello everyone welcome to the

STOC 2020 - Session 8A: Fine-Grained Complexity

STOC 2020 - Session 8A: Fine-Grained Complexity

Hi wait wait let me start by presenting the start of the

STOC 2020 - Session 6B: Complexity I

STOC 2020 - Session 6B: Complexity I

Okay so it's a pleasure uh to have christian here uh he's the first speaker of

STOC 2020 - Session 4A: Graph Theory and Algorithms

STOC 2020 - Session 4A: Graph Theory and Algorithms

Okay good yeah just maybe I'll just introduce the