Details
Title
THL4
Formal Name (French)
Laboratoire de théorie du calcul 4
Formal Name (English)
Theory of Computation Laboratory 4
Group ID
U13122
Affiliated authors
Chiplunkar, Ashish Hari
Elias, Marek
Kapralov, Michael
Kochetkova, Ekaterina
Kumar, Akash
Makarov, Mikhail
Mazzali, Davide
Mousavifar, Aidasadat
Nouri, Navid
Raffestin, Pauline
Sheth, Kshiteej Jitesh
Tardos, Jakab
Ubezio, Fabienne
Velingker, Ameya
Weissenberg, Guy
Wrzos-Kaminska, Weronika
Zandieh, Amir
Elias, Marek
Kapralov, Michael
Kochetkova, Ekaterina
Kumar, Akash
Makarov, Mikhail
Mazzali, Davide
Mousavifar, Aidasadat
Nouri, Navid
Raffestin, Pauline
Sheth, Kshiteej Jitesh
Tardos, Jakab
Ubezio, Fabienne
Velingker, Ameya
Weissenberg, Guy
Wrzos-Kaminska, Weronika
Zandieh, Amir
Institute
IINFCOM
Faculty
IC
Note
Members of THL4-unit
Publications
A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms
An Optimal Space Lower Bound for Approximating MAX-CUT
Constructing a provably adversarially-robust classifier from a high accuracy one
Efficiently Learning Fourier Sparse Set Functions
Kernel Density Estimation through Density Constrained Near Neighbor Search
Motif Cut Sparsifiers
Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes
The (h, k)-Server Problem on Bounded Depth Trees
The Sketching Complexity of Graph and Hypergraph Counting
Towards Tight Bounds for Spectral Sparsification of Hypergraphs
See complete list of publications (24)
An Optimal Space Lower Bound for Approximating MAX-CUT
Constructing a provably adversarially-robust classifier from a high accuracy one
Efficiently Learning Fourier Sparse Set Functions
Kernel Density Estimation through Density Constrained Near Neighbor Search
Motif Cut Sparsifiers
Random walks and forbidden minors III: poly(d epsilon(-1))-time partition oracles for minor-free graph classes
The (h, k)-Server Problem on Bounded Depth Trees
The Sketching Complexity of Graph and Hypergraph Counting
Towards Tight Bounds for Spectral Sparsification of Hypergraphs
See complete list of publications (24)
Record appears in
Authorities > Lab