Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems

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


Duration: 52:08
348 views
7

Karl Bringmann (Max Planck Institute for Informatics)
https://simons.berkeley.edu/talks/karl-bringmann-max-planck-institute-informatics-2023-09-28
Fine-Grained Complexity, Logic, and Query Evaluation



Other Videos By Simons Institute for the Theory of Computing


2023-10-09Fast Attention Requires Bounded Entries
2023-10-09Randomized Embeddings and Neural Networks
2023-10-09Sublinear Time Eigenvalue Approximation via Random Sampling
2023-10-09Nikhil Srivastava and Venkatesan Guruswami | Polylogues
2023-10-06Machine-Checked Proofs and the Rise of Formal Methods in Mathematics | Theoretically Speaking
2023-10-04A Theory of Alternating Paths and Blossoms, from the Perspective of Minimum Length pt.2
2023-10-04A Theory of Alternating Paths and Blossoms, from the Perspective of Minimum Length
2023-10-03The Power of Graph Learning | Richard M. Karp Distinguished Lecture
2023-09-29Incremental View Maintenance: Beyond Worst-Case Analysis II
2023-09-29Incremental View Maintenance: Beyond Worst-Case Analysis I
2023-09-28Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems
2023-09-28Optimizing Relational Programs II
2023-09-28Optimizing Relational Programs I
2023-09-27Distributed Graph Techniques in the MPC Model
2023-09-27Massively Parallel Evaluation of Relational Queries II
2023-09-27Massively Parallel Evaluation of Relational Queries I
2023-09-26Intermediate Relational Algorithm Design
2023-09-26Introduction to Relational Algorithms
2023-09-25Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees: I
2023-09-25Fine Grained Complexity
2023-09-25Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees: II


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Fine-Grained Complexity Logic and Query Evaluation
Karl Bringmann