We are pleased to announce that two papers co-authored by INSAIT researcher Jakub Tetek, in collaboration with Richard Hladík (PhD student at ETH Zurich and former INSAIT visitor), have been accepted to the Foundations of Responsible Computing (FORC) 2025 symposium. One of the papers was honored with the Best Student Paper Award.
FORC 2025, held from June 4–6 at Stanford University, is a premier interdisciplinary symposium that brings together researchers in theoretical computer science, statistics, economics, and related fields to tackle challenges of emerging societal importance.
The two accepted papers explore advances in differential privacy, a provable framework for ensuring data privacy in fields ranging from AI to data analysis.
Paper Highlights
- Near-Universally-Optimal Differentially Private Minimum Spanning Trees
This work presents the first mechanism achieving near-universal optimality for computing minimum spanning trees under differential privacy, setting a new benchmark for the field.
Read the paper - Smooth Sensitivity Revisited: Towards Optimality (Best Student Paper Award)
This paper introduces a new distribution that improves accuracy in privacy-preserving computations via smooth sensitivity. The result is a simple and effective drop-in replacement for a core framework in the area.
Read the paper