| Publication | Date of Publication | Type |
|---|
| The price of stability for network design with fair cost allocation | 2026-05-29 | Paper |
| Spectral analysis of random graphs with skewed degree distributions | 2026-05-29 | Paper |
| Approximate modularity | 2025-08-05 | Paper |
Valid confidence intervals for \(\mu, \sigma\) when there is only one observation available
Sankhyā. Series A | 2024-12-05 | Paper |
Asymptotics of coverages of HD confidence sets and recentering at shrinkage estimates: phase transitions, large deviations
Japanese Journal of Statistics and Data Science | 2024-07-25 | Paper |
On additive approximate submodularity
Theoretical Computer Science | 2022-06-13 | Paper |
| Valid confidence intervals for \mu , \sigma when there is only one observation available | 2022-02-07 | Paper |
On Additive Approximate Submodularity
(available as arXiv preprint) | 2020-10-06 | Paper |
Learning entangled single-sample Gaussians
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A framework for estimating stream expression cardinalities
(available as arXiv preprint) | 2017-07-14 | Paper |
On learning mixture models for permutations
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
| On reconstructing a hidden permutation | 2017-03-22 | Paper |
| scientific article; zbMATH DE number 6381736 (Why is no real title available?) | 2014-12-18 | Paper |
scientific article; zbMATH DE number 6351476 (Why is no real title available?)
Theory of Computing | 2014-10-06 | Paper |
A sparse Johnson-Lindenstrauss transform
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Sparse and Lopsided Set Disjointness via Information Theory
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Near-optimal network design with selfish agents
Theory of Computing | 2011-05-24 | Paper |
Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
Internet Mathematics | 2010-10-27 | Paper |
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764828 (Why is no real title available?) | 2010-08-06 | Paper |
Sampling Algorithms and Coresets for \ell_p Regression
SIAM Journal on Computing | 2009-11-06 | Paper |
The Price of Stability for Network Design with Fair Cost Allocation
SIAM Journal on Computing | 2009-08-20 | Paper |
Spectral Clustering by Recursive Partitioning
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Finding (Short) Paths in Social Networks
Internet Mathematics | 2007-08-20 | Paper |
