Fine-Grained Complexity, Logic, and Query Evaluation

Program

Logic and Algorithms in Database Theory and AI

Location

Calvin Lab Auditorium

Date

Monday, Sept. 25 – Friday, Sept. 29, 2023

Back to calendar

All talks listed in Pacific Time. Schedule subject to change.

9 – 9:25 a.m.

Coffee and Check-in

9:25 – 9:30 a.m.

Opening Remarks

9:30 – 10:10 a.m.

Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees: I

Nofar Carmeli (Inria Montpellier)

10:10 – 10:15 a.m.

Short Break

10:15 – 10:55 a.m.

Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees: II

Nofar Carmeli (Inria Montpellier)

10:55 – 11:15 a.m.

Break

11:15 a.m. – 12 p.m.

Fine Grained Complexity

Andrea Lincoln ()

12 – 2 p.m.

Lunch (on your own)

2 – 3 p.m.

Group Discussions

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Group Discussions (optional)

4:30 – 5:30 p.m.

Reception

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:30 a.m.

Introduction to Relational Algorithms

Mahmoud Abo Khamis (Relational AI)

10:30 – 11 a.m.

Break

11 a.m. – 12 p.m.

Intermediate Relational Algorithm Design

Kirk Pruhs (University of Pittsburgh)

12 – 2 p.m.

Lunch (on your own)

2 – 3 p.m.

Group Discussions (in-person only)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Group Discussions (in-person only)

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:10 a.m.

Massively Parallel Evaluation of Relational Queries I

Xiao Hu (University of Waterloo), Paris Koutris (UW Madison)

10:10 – 10:15 a.m.

Short Break

10:15 – 10:55 a.m.

Massively Parallel Evaluation of Relational Queries II

Xiao Hu (University of Waterloo), Paris Koutris (UW Madison)

10:55 – 11:15 a.m.

Break

11:15 a.m. – 12 p.m.

Distributed Graph Techniques in the MPC Model

Quanquan C. Liu (Northwestern University)

12 – 2 p.m.

Lunch (on your own)

2 – 3 p.m.

Group Discussions (in-person only)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Group Discussions (in-person only) (optional)

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:10 a.m.

Optimizing Relational Programs I

Remy Wang (University of Washington)

10:10 – 10:15 a.m.

Short Break

10:15 – 10:55 a.m.

Optimizing Relational Programs II

Remy Wang (University of Washington)

10:55 – 11:15 a.m.

Break

11:15 a.m. – 12 p.m.

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

Karl Bringmann (Max Planck Institute for Informatics)

12 – 2 p.m.

Lunch (on your own)

2 – 3 p.m.

Group Discussions (in-person only)

3 – 3:30 p.m.

Break

3:30 – 4:30 p.m.

Group Discussions (in-person only) (optional)

9 – 9:30 a.m.

Coffee and Check-in

9:30 – 10:10 a.m.

Incremental View Maintenance: Beyond Worst-Case Analysis I

Xiao Hu (University of Waterloo)

10:10 – 10:15 a.m.

Short Break

10:15 – 10:55 a.m.

Incremental View Maintenance: Beyond Worst-Case Analysis II

Xiao Hu (University of Waterloo)

10:55 – 11:15 a.m.

Break

11:15 a.m. – 12 p.m.

Group Discussions (in-person only)

12 – 2 p.m.

Lunch (on your own)

2 – 3 p.m.

Group Discussions (in-person only) (optional)