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

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, October 15, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Micha Sharir (Tel Aviv University)

How to find a point in the convex hull? or: Tukey depth and differential privacy

Finding a point in the convex hull of a set of n points in d dimensions, while protecting the privacy of the input set, in the standard differential privacy model, turns out to be a rather nontrivial algorithmic task, and the best solution we have to date takes time that is exponential in d. I will present our current technique, which is based on the Tukey depth with respect to the input set, and discuss the many open questions that it raises. Joint work with Haim Kaplan and Uri Stemmer

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

Previous talks by year:   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