Study notebook

Press N to jot a timestamped note or B to pin a moment while watching.

Efficient Fine-Grained Algorithms

Barna Saha UC Berkeley

Associate Professor

43:10·2020·research level·Research Seminar

Barna Saha of UC Berkeley presents on the cutting-edge of fine-grained complexity, exploring new algorithmic approaches for fundamental problems.

Theory & Algos Algorithms & Data Structures Computational Complexity fine-grained complexity algorithm design

Theory-Fest 2019-2020: Fine-Grained Complexity

Seminar notes & discussion

Sign in to comment

No public seminar notes on this lecture yet.

Related lectures

The Role of Randomness in Local Distributed Graph Problems

Yannic Maus · Computational Complexity

Shared subfield · Algorithms & Data Structures & Computational Complexity

Scheduling with Time-Evolving Uncertainty for Content Review in Social Media

Thodoris Lykouris · MIT

Shared subfield · Algorithms & Data Structures & algorithm design

Lecture 16: Håstad's Hardness Theorems (15-859)

Ryan O'Donnell · Carnegie Mellon University

Shared subfield · Algorithms & Data Structures & Computational Complexity

All Non-Trivial Variants of 3-LDT

B. Dudek & P. Gawrychowski · University of Wrocław

Shared subfield · Algorithms & Data Structures & Computational Complexity

A Fine-Grained Analogue of Schaefer's Theorem in P

Marvin Kunneman · Max Planck Institute for Informatics

Shared subfield · Computational Complexity & fine-grained complexity

A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies

Santosh Vempala · Georgia Institute of Technology

Shared subfield · Algorithms & Data Structures & Computational Complexity