Media Summary: CMU Theory lunch talk from October 10, 2018, by CMU Theory lunch talk from July 22nd, 2020 by Computer Science/Discrete Mathematics Seminar I Topic: Explicit near-fully X-Ramanujan graphs Speaker:

Xinyu Wu On Escaping Small - Detailed Analysis & Overview

CMU Theory lunch talk from October 10, 2018, by CMU Theory lunch talk from July 22nd, 2020 by Computer Science/Discrete Mathematics Seminar I Topic: Explicit near-fully X-Ramanujan graphs Speaker: From the CMU Theory Reading Group. Part 2 of 2. From the CMU Theory Reading Group. Part 1 of 2. Separations between classical and quantum computational complexity through stochastic calculus. The Forrelation problem is: ...

The Microsoft Research Ada Lovelace Fellowship will allow

Photo Gallery

Xinyu Wu on Escaping small sets on the Boolean cube and other domains
Xinyu Wu on Explicit near-fully X-Ramanujan graphs
Xinyu Wu
Explicit near-fully X-Ramanujan graphs - Xinyu Wu
Ryan O'Donnell and Xinyu Wu on Query-to-Communication Lifting for BPP, part 2
MSS26 - Day 2 - Xinyu Wu
Ryan O'Donnell and Xinyu Wu on Query-to-Communication Lifting for BPP, part 1
Xinyu Wu: Separations between classical and quantum computational complexity through stocha... (CMU)
2021 Microsoft Research Ada Lovelace Fellow: Xinyu Wu
Xinyu Wu
View Detailed Profile
Xinyu Wu on Escaping small sets on the Boolean cube and other domains

Xinyu Wu on Escaping small sets on the Boolean cube and other domains

CMU Theory lunch talk from October 10, 2018, by

Xinyu Wu on Explicit near-fully X-Ramanujan graphs

Xinyu Wu on Explicit near-fully X-Ramanujan graphs

CMU Theory lunch talk from July 22nd, 2020 by

Xinyu Wu

Xinyu Wu

Xinyu Wu

Explicit near-fully X-Ramanujan graphs - Xinyu Wu

Explicit near-fully X-Ramanujan graphs - Xinyu Wu

Computer Science/Discrete Mathematics Seminar I Topic: Explicit near-fully X-Ramanujan graphs Speaker:

Ryan O'Donnell and Xinyu Wu on Query-to-Communication Lifting for BPP, part 2

Ryan O'Donnell and Xinyu Wu on Query-to-Communication Lifting for BPP, part 2

From the CMU Theory Reading Group. Part 2 of 2.

MSS26 - Day 2 - Xinyu Wu

MSS26 - Day 2 - Xinyu Wu

Xinyu Wu

Ryan O'Donnell and Xinyu Wu on Query-to-Communication Lifting for BPP, part 1

Ryan O'Donnell and Xinyu Wu on Query-to-Communication Lifting for BPP, part 1

From the CMU Theory Reading Group. Part 1 of 2.

Xinyu Wu: Separations between classical and quantum computational complexity through stocha... (CMU)

Xinyu Wu: Separations between classical and quantum computational complexity through stocha... (CMU)

Separations between classical and quantum computational complexity through stochastic calculus. The Forrelation problem is: ...

2021 Microsoft Research Ada Lovelace Fellow: Xinyu Wu

2021 Microsoft Research Ada Lovelace Fellow: Xinyu Wu

The Microsoft Research Ada Lovelace Fellowship will allow

Xinyu Wu

Xinyu Wu

Xinyu Wu