"Theory Reading Group" at Dartmouth Algorithms & TCS Group
We have an active student-led ``reading group'' where we have active, exciting discussions on recent research in TCS, both internal and external.
Some recent and upcoming talks are mentioned below.
- (2024-5-15) David Zheng from UIUC talked about massively parallel algorithms on embedded planar graphs.
- (2024-5-10) Jamie Schmidt from Dartmouth Math talked about lattice-based cryptography and quantum algorithms (part 2).
- (2024-5-03) Jamie Schmidt from Dartmouth Math talked about lattice-based cryptography and quantum algorithms (part 1).
- (2024-3-29) Li Song from Geisel School of Medicine at Dartmouth talked about "Centrifuger: lossless compression of microbial genomes for efficient and accurate metagenomic sequence classification"
- (2024-3-7) Jonathan talked about "Simple Dynamic Spanners with Near-optimal Recourse against an Adaptive Adversary".
- (2024-3-1) Raghav Singal from Tuck School of Business at Dartmouth talked about Counterfactual Analysis in Dynamic Latent-State Models.
- (2024-2-22) Hung Le from UMass Amherst talked about New Decompositions for Planar Graphs and Applications.
- (2024-2-7) Vishwa Prakash H.V. from Chennai Mathematical Institute talked about "Proportional Allocations of Indivisible Resources: Insights via Matchings"
- (2024-2-2) Manuel talked about "Unambiguous parity-query complexity".
- (2024-1-26) Jonathan talked about forbidden-set distance labeling schemes for planar graphs.
- (2024-01-19) Manuel talked about "Near-Optimal Sparse Recovery in the L1 Norm".
- (2023-12-15) Jonathan talked about his recent work resolving the Steiner Point Removal problem in minor-free graphs.
- (2023-12-8) Manuel talked about solving the Tree Evaluation problem in O(log n log log n) space.
- (2023-11-17) Tamalika Mukherjee from Columbia talked about "How to Make Your Approximation Algorithm Private".
- (2023-11-10) Jessica Sorrell from UPenn talked about connections between replicability, privacy, and perfect generalization.
- (2023-11-3) Jamie Schmidt from Dartmouth Math talked about his recent work on the Erdős vs. Szekeres combinatorial game.
- (2023-10-27) Vignesh Viswanath from UMass Amherst talked about fair allocation with simple submodular valuations.
- (2023-10-20) Ankita talked about her recent work on fault-tolerant k-supplier with outliers.
- (2023-10-13) Jamie Schmidt from Dartmouth Math talked about a Book proof of the middle levels theorem.
- (2023-10-12) Sruthi Gorantla from IISc Bangalore talked about her work on ex-post group fairness and individual fairness in ranking.
- (2023-10-6) Prantar Ghosh from Rutgers talked about his work on lower bounds in the Merlin-Arthur communication and graph streaming verification.
- (2023-10-4) Jonathan talked about the equivalence between GapUNSAT data structures and E^NP lower bounds.
- (2023-9-29) Luc Cote talked about maximizing monotone submodular functions over a matroid.
- (2023-9-22) Hsien-Chih talked about how to compute planar diameter in subquadratic time.
- (2023-9-15) Manuel talked about his recent work on the missing item finding problem.