Publications

(2024). Weisfeiler-Leman at the margin: When more expressivity matters. ICML 2024.

Cite arXiv

(2023). Locality-Aware Graph-Rewiring in GNNs. ICLR 2024.

Cite arXiv

(2023). Affinity-Aware Graph Networks. NeurIPS 2023.

Cite Video arXiv URL

(2023). Exphormer: Sparse Transformers for Graphs. ICML 2023.

Cite Code Video arXiv URL

(2023). Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization. ICML 2023.

Cite Video arXiv URL

(2022). Private Robust Estimation by Stabilizing Convex Relaxations. COLT 2022.

Cite arXiv URL

(2022). Linear space streaming lower bounds for approximating CSPs. STOC 2022.

Cite Video arXiv ECCC URL

(2021). On the Power of Multiple Anonymous Messages: Frequency Estimation and Selection in the Shuffle Model of Differential Privacy. EUROCRYPT 2021. FORC 2020.

Cite Video arXiv IACR URL

(2020). Scaling up Kernel Ridge Regression via Locality Sensitive Hashing. AISTATS 2020.

Cite arXiv URL

(2020). Pure Differentially Private Summation from Anonymous Messages. ITC 2020.

Cite arXiv URL

(2020). Private Aggregation from Fewer Anonymous Messages. EUROCRYPT 2020.

Cite arXiv URL

(2020). Oblivious Sketching of High-Degree Polynomial Kernels. SODA 2020.

Cite arXiv URL

(2019). A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms. STOC 2019.

Cite arXiv URL

(2019). Dimension-independent Sparse Fourier Transform. SODA 2019.

Cite arXiv URL

(2017). Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. APPROX 2017.

Cite URL

(2017). Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees. ICML 2017.

Cite arXiv URL

(2017). (1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space. SODA 2017.

Cite URL

(2017). Constructing Ramanujan Graphs Using Shift Lifts. Linear Algebra and its Applications 529 (2017).

Cite arXiv URL

(2016). On the Sensitivity Conjecture for Read-k Formulas. MFCS 2016.

Cite ECCC URL

(2015). Communication with Partial Noiseless Feedback. RANDOM 2015.

Cite URL

(2015). Approximating Nearest Neighbor Distances. WADS 2015.

Cite arXiv URL

(2015). Limitations on Testable Affine-Invariant Codes in the High-Rate Regime. SODA 2015.

Cite ECCC URL

(2013). A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs. SoCG 2013.

Cite arXiv URL

(2013). Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes. SODA 2013. SIAM Journal on Computing 42(5).

Cite arXiv ECCC URL URL