Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (by J. Lengler, K. Bringmann, B. Gärtner, M. Hoffmann, R. Kyng, D.Steurer, V. Traub)

Mittagsseminar Talk Information

Date and Time: Friday, October 17, 2025, 03:30 pm

Duration: 30 minutes

Location: OAT S15 (15:30)

Speaker: Argyris Mouzakis (University of Waterloo)

Optimal Differentially Private Sampling of Unbounded Gaussians

We provide the first O_{α, ε, δ}(d)-sample algorithm for sampling from unbounded Gaussian distributions under the constraint of (ε, δ)-differential privacy. This is a quadratic improvement over previous results for the same problem, settling an open question of Ghazi, Hu, Kumar, and Manurangsi. This is joint work with Valentio Iverson and Gautam Kamath, and has appeared in COLT 2025.


Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2026  2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks


Automatic MiSe System Software Version 1.4803M   |   admin login