Media Summary: Siqi Liu (UC Berkeley), Sidhanth Mohanty (UC Berkeley), Tselil Schramm (Stanford) and Elizabeth Yang (UC Berkeley) Worst-Case to Average-Case Reductions via Additive Combinatorics Vahid R. Asadi (University of Waterloo), Alexander Golovnev ... Siqi Liu (UC Berkeley) Structural Results In the random ...

Stoc 2022 Testing Thresholds For - Detailed Analysis & Overview

Siqi Liu (UC Berkeley), Sidhanth Mohanty (UC Berkeley), Tselil Schramm (Stanford) and Elizabeth Yang (UC Berkeley) Worst-Case to Average-Case Reductions via Additive Combinatorics Vahid R. Asadi (University of Waterloo), Alexander Golovnev ... Siqi Liu (UC Berkeley) Structural Results In the random ... The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in ... Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV ... Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary Adam Karczmarz (University of Warsaw ...

Faster Min-Plus Product for Monotone Instances Shucheng Chi (Tsinghua University), Ran Duan (Tsinghua University), Tianle Xie ... An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem Anna Karlin (University of ... TraderTV Live is a professional day trading broadcast — two active traders, real money, live from our Toronto trading floor. Counting Small Induced Subgraphs with Hereditary Properties Jacob Focke (CISPA Helmholtz Center for Information Security) ...

Photo Gallery

STOC 2022 - Testing thresholds for high-dimensional sparse random geometric graphs
STOC 2022 - Worst-Case to Average-Case Reductions via Additive Combinatorics
Testing thresholds for sparse random geometric graphs
Testing Thresholds for High-dimensional Sparse Random Geometric Graphs
STOC 2022 - The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier
STOC 2023 - 5A - Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees.
STOC 2022 - Hardness for Triangle Problems under Even More Believable Hypotheses
STOC 2022 - Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary
[STOC 2022] No-Regret Learning for Correlated Equilibria
STOC 2022 - Faster Min-Plus Product for Monotone Instances
STOC 2022 - An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Prob
Stocks Head For Losing Week as AI, Tech Selloff Accelerates | Stock Market Live
View Detailed Profile
STOC 2022 - Testing thresholds for high-dimensional sparse random geometric graphs

STOC 2022 - Testing thresholds for high-dimensional sparse random geometric graphs

Siqi Liu (UC Berkeley), Sidhanth Mohanty (UC Berkeley), Tselil Schramm (Stanford) and Elizabeth Yang (UC Berkeley)

STOC 2022 - Worst-Case to Average-Case Reductions via Additive Combinatorics

STOC 2022 - Worst-Case to Average-Case Reductions via Additive Combinatorics

Worst-Case to Average-Case Reductions via Additive Combinatorics Vahid R. Asadi (University of Waterloo), Alexander Golovnev ...

Testing thresholds for sparse random geometric graphs

Testing thresholds for sparse random geometric graphs

https://kyng.inf.ethz.ch/acseminar/talk.html?id=2021-04-21_schramm Tselil Schramm (Stanford): https://tselilschramm.org/ ...

Testing Thresholds for High-dimensional Sparse Random Geometric Graphs

Testing Thresholds for High-dimensional Sparse Random Geometric Graphs

Siqi Liu (UC Berkeley) https://simons.berkeley.edu/talks/siqi-liu-uc-berkeley-2023-07-25 Structural Results In the random ...

STOC 2022 - The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier

STOC 2022 - The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier

The Exact Complexity of Pseudorandom Functions and the Black-Box Natural Proof Barrier for Bootstrapping Results in ...

STOC 2023 - 5A - Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees.

STOC 2023 - 5A - Depth-d Threshold Circuits vs. Depth-(d + 1) AND-OR Trees.

Depth-d

STOC 2022 - Hardness for Triangle Problems under Even More Believable Hypotheses

STOC 2022 - Hardness for Triangle Problems under Even More Believable Hypotheses

Hardness for Triangle Problems under Even More Believable Hypotheses: Reductions from Real APSP, Real 3SUM, and OV ...

STOC 2022 - Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary

STOC 2022 - Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary

Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary Adam Karczmarz (University of Warsaw ...

[STOC 2022] No-Regret Learning for Correlated Equilibria

[STOC 2022] No-Regret Learning for Correlated Equilibria

My talk from

STOC 2022 - Faster Min-Plus Product for Monotone Instances

STOC 2022 - Faster Min-Plus Product for Monotone Instances

Faster Min-Plus Product for Monotone Instances Shucheng Chi (Tsinghua University), Ran Duan (Tsinghua University), Tianle Xie ...

STOC 2022 - An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Prob

STOC 2022 - An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Prob

An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem Anna Karlin (University of ...

Stocks Head For Losing Week as AI, Tech Selloff Accelerates | Stock Market Live

Stocks Head For Losing Week as AI, Tech Selloff Accelerates | Stock Market Live

TraderTV Live is a professional day trading broadcast — two active traders, real money, live from our Toronto trading floor.

STOC 2022 - Counting Small Induced Subgraphs with Hereditary Properties

STOC 2022 - Counting Small Induced Subgraphs with Hereditary Properties

Counting Small Induced Subgraphs with Hereditary Properties Jacob Focke (CISPA Helmholtz Center for Information Security) ...