Conditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=jd-6TtqGBd0


Duration: 1:02:10
94 views
1

Artur Czumaj (University of Warwick)
https://simons.berkeley.edu/talks/artur-czumaj-university-warwick-2024-05-22
Sublinear Algorithms Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2024-06-13Toward a Theory of Perspective Perception in Pictures
2024-05-29Distribution Testing: Hypothesis Testing from Very Little (or Very Private) Data
2024-05-29Sublinear Time Algorithms for Estimating Edit Distance
2024-05-29Sketching and Randomized Linear Algebra
2024-05-29Testing Assumptions of Learning Algorithms
2024-05-29Adversarially Robust Streaming Algorithms
2024-05-29New Advances on Multi-Pass Graph Streaming Lower Bounds
2024-05-29Coresets and Their Applications to Design Sublinear Algorithms
2024-05-29An Overview on Data Streams Algorithms
2024-05-29Graph Coloring Through the Sublinear Lens
2024-05-29Conditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds
2024-05-29Graph Algorithms in the MPC Model
2024-05-29An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms
2024-05-29Sampling Big Ideas in Sublinear Algorithms
2024-05-29Counting Subgraphs in Sublinear Time
2024-05-29Testing Boolean Functions
2024-05-29Property Testing for Graphs
2024-04-30Using chaos to characterize a programmable analog quantum simulator
2024-04-30Fundamental limits to quantum computation
2024-04-30Evidence for the utility of quantum computing before fault tolerance
2024-04-30High-fidelity and Fault-tolerant Teleportation of a Logical Qubit on a Trapped-ion Quantum Computer


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Sublinear Algorithms Boot Camp
Artur Czumaj