Memoriam
May 21 10:30-11:30
10:30-11:30 Outsourcing the Self: How Using AI Words Changes What—and How—We Self-Disclose
May 21 11:30-12:30
11:30-12:30 Stable Marriage: Loyalty vs. Competition
May 25 12:30-13:00
12:30-13:00 Efficient Learning on Large Graphs using a Densifying Regularity Lemma
May 29 11:00-12:00
11:00-12:00 Fine-Grained Factual Inconsistency Detection: Evaluating the Capabilities of Large Language Models
June 08 12:30-13:00
12:30-13:00 Finding minimal separators with small cardinality in graphs
June 15 12:30-13:00
12:30-13:00 Blackwell’s Approachability with Approximation Algorithms
Bloomfield 527
