Embedded Files
Texas Area Theory and Algorithms Day
at L.F. Peterson Building, Texas A&M University
Mission
This one-day workshop aims to foster collaboration and engagement among researchers in theoretical computer science (TCS) and algorithms across Texas and the surrounding regions.Our hope is that this workshop will strengthen the TCS community by bringing together researchers from different institutions to share ideas, establish collaborations, and provide exposure to junior researchers.
Plenary Speakers
Invited Speakers
Venue
Room 118
Room 118
L.F. Peterson Building
L.F. Peterson Building
435 Nagle St
435 Nagle St
College Station, TX 77843
College Station, TX 77843
Invited speakers will receive vouchers to park at Central Campus Garage (address: 450 Spence St, College Station, TX 77843 ). All other visitors may park at Lot 55 without charge (address 282 Bizzell St, College Station, TX 77840).
Schedule
10: Organizers: Welcoming Remarks
10:05-11: David P. Woodruff: Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
11-11:30: Dana Moshkovitz: Coding Theory in Almost-Linear Time and Sub-Linear Space
11:30-12: Nate Veldt: Learning-Augmented Algorithms for Metric MST with Subquadratic Complexity
12-1: Lunch (Provided)
1-2: Aaron Sidford: The Complexity of Solving Matrix Games
2-2:30: Shuchi Chawla: Costly Information Combinatorial Selection
2:30-3: Vladimir Braverman: Coresets for Medical Imaging and Sketches for Networking
3-3:30: Break
3:30-4:30: Mark Bun: Interactive Proofs For Distribution Testing With Conditional Oracles
4:30-5: Nai-Hui Chia: Adversarially Robust Quantum State Learning
5-5:30: Chun-Hung Liu: Disjoint Paths Problem with Group-expressable Constraints
5:30-7: Social Hour and Poster Session
Organizers
Texas A&M Institute of Data Science
Rice University
UT Austin
Texas A&M University
Page updated
Google Sites
Report abuse