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
    • Research Pods
    • Workshops & Symposia
    • Public Lectures
    • Internal Program Activities
  • 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
    • Ways to Participate
    • Plan Your Visit
    • Location & Directions
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
    • Academic Partnerships
  • News & Videos
    • News
    • Videos
  • About

Fine-Grained Complexity and Algorithm Design

Wednesday, Aug. 19 – Friday, Dec. 18, 2015

Breadcrumb

  1. Home
  2. Programs & Events
  3. Fine-Grained Complexity and Algorithm Design

Secondary tabs

  • The Program
  • Workshops(active tab)
  • Internal Activities
Fine-Grained Complexity and Algorithm Design Boot Camp
Aug. 31 – Sept. 4, 2015
Fine-Grained Complexity and Algorithm Design Boot Camp
Mohan Paturi (UC San Diego)
Details of Fine-Grained Complexity and Algorithm Design Boot Camp
Connections Between Algorithm Design and Complexity Theory
Sept. 28 – Oct. 1, 2015
Connections Between Algorithm Design and Complexity Theory
Valentine Kabanets (Simon Fraser University)
Ryan Williams (MIT)
Details of Connections Between Algorithm Design and Complexity Theory
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
Nov. 2 – 6, 2015
Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
Thore Husfeldt (IT University of Copenhagen)
Dániel Marx (Hungarian Academy of Sciences)
Mohan Paturi (UC San Diego)
Details of Satisfiability Lower Bounds and Tight Results for Parameterized and Exponential-Time Algorithms
Computational Complexity of Low-Polynomial Time Problems
Nov. 30 – Dec. 3, 2015
Computational Complexity of Low-Polynomial Time Problems
Piotr Indyk (Massachusetts Institute of Technology)
Virginia Vassilevska Williams (Massachusetts Institute of Technology)
Details of Computational Complexity of Low-Polynomial Time Problems
Fine-Grained Complexity and Algorithm Design Reunion
Dec. 12 – 15, 2016
Fine-Grained Complexity and Algorithm Design Reunion
Russell Impagliazzo (UC San Diego)
Dániel Marx (Hungarian Academy of Sciences)
Mohan Paturi (UC San Diego)
Ryan Williams (MIT)
Virginia Vassilevska Williams (Massachusetts Institute of Technology)
Details of Fine-Grained Complexity and Algorithm Design Reunion
Share this page
Copy URL of this page
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

Footer social media

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

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Research Pods
    • Workshops & Symposia
    • Public Lectures
    • Internal Program Activities
  • 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
    • Ways to Participate
    • Plan Your Visit
    • Location & Directions
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
    • Academic Partnerships
  • News & Videos
    • News
    • Videos
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • Make a Gift
link to homepage