CompSci 269S, Spring 2022: Theory Seminar
The Theory Group normally meets Fridays at 1:00pm. This quarter we
are
in Bren
Hall 1423 (inside the building, at the end of the hall next to the
exterior door). However, some meetings may still be online, through
Zoom. Below is this quarter's schedule.
- April 1
- Organizational meeting
-
- Michael Shindler
- Student misconceptions of dynamic programming: a replication study
-
- April 8
- Hanna Komlós
- Online list labeling: breaking the \(\log^2n\)
barrier
- (Online through Zoom; link TBA)
-
- April 15
- Nitya Raju
- Multi-item auctions
-
- April 22
- Freddy Reiber
- Private interdependent valuations
-
- Rohith Reddy Gangam
- An efficient algorithm for fully robust
stable matchings via join semi-sublattices
-
- April 29
- Ofek Gila
- Practical fully dynamic minimum cut algorithms
-
- May 6
- Thorben Tröbst
- Fair and efficient allocations of chores under bivalued preferences
-
- May 13
- Daniel Frishberg
- On the treewidth and expansion of Hanoi graphs
-
- May 20
- Evrim Ozel
- Modeling the small-world phenomenon
-
- May 27
- Shion Fukuzawa
- Quantum random walks and near-optimal quantum algorithms for string problems
-
- Ryuto Kitagawa
- Straggler identification in round-trip data streams via Newton’s identities and invertible Bloom filters
-
- June 3
- Hadi Khodabandeh
- Spanner construction for unit ball graphs in the CONGEST model of distributed computation
-
- Ramtin Afshar
- Exact learning of multitrees and almost-trees using path queries
-
See also the ACO
seminar (Thursdays 4-5).
Previous
quarters' theory seminars