Skip to main content

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
Berkeley University of California
Home Home

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Apply to Participate
    • Plan Your Visit
    • Location & Directions
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
  • News & Videos
    • News
    • Videos
  • About
Image
Sublinear Algorithms Wide Format Logo

Sublinear Graph Simplification

Program
Sublinear Algorithms
Location

Calvin Lab auditorium

Date
Monday, July 29 – Friday, Aug. 2, 2024
Back to calendar

Breadcrumb

  1. Home
  2. Workshop & Symposia
  3. Videos

Secondary tabs

  • The Workshop
  • Schedule
  • Videos
Remote video URL
Workshops

Maximum Matching in $O(\log \log n)$ Passes in Dynamic Streams

Visit talk page
Remote video URL
Workshops

Improved streaming algorithms for Max-DICUT via local snapshots

Visit talk page
Remote video URL
Workshops

Online Algorithms for Spectral Hypergraph Sparsification

Visit talk page
Remote video URL
Workshops

Almost-Optimal Sublinear Additive Spanners

Visit talk page
Remote video URL
Workshops

New algorithms for directed spanner problems and generalizations

Visit talk page
Remote video URL
Workshops

Dynamic Matching and (Ordered) Ruzsa-Szemerédi Graphs: Towards Constructive Matching Sparsifiers

Visit talk page
Remote video URL
Workshops

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs

Visit talk page
Remote video URL
Workshops

Sublinear algorithms for correlation clustering

Visit talk page
Remote video URL
Workshops

Fast Streaming Euclidean Clustering with Constant Space

Visit talk page
Remote video URL
Workshops

Stochastic Minimum Vertex Cover with Few Queries: a 3/2-approximation

Visit talk page

Pagination

  • Current page 1
  • Page 2
  • Page 3
  • Next page Next
Home
The Simons Institute for the Theory of Computing is the world's leading venue for collaborative research in theoretical computer science.

Footer

  • Programs & Events
  • About
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar
  • Accessibility

Footer social media

  • Twitter
  • Facebook
  • Youtube
© 2013–2025 Simons Institute for the Theory of Computing. All Rights Reserved.
link to homepage

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Apply to Participate
    • Plan Your Visit
    • Location & Directions
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
  • News & Videos
    • News
    • Videos
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
link to homepage