The following pages link to Anirban Dasgupta (Q2672598):
Displaying 19 items.
- On additive approximate submodularity (Q2672599) (← links)
- A sparse Johnson (Q2875159) (← links)
- (Q2934697) (← links)
- (Q2969649) (← links)
- On Learning Mixture Models for Permutations (Q2989017) (← links)
- (Q3002793) (← links)
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters (Q3164211) (← links)
- Sparse and Lopsided Set Disjointness via Information Theory (Q3167423) (← links)
- (Q3191565) (← links)
- The Price of Stability for Network Design with Fair Cost Allocation (Q3395046) (← links)
- (Q3579418) (← links)
- Near-optimal network design with selfish agents (Q3581253) (← links)
- Sampling Algorithms and Coresets for $\ell_p$ Regression (Q3642876) (← links)
- (Q5276185) (← links)
- Learning Entangled Single-Sample Gaussians (Q5383998) (← links)
- Spectral Clustering by Recursive Partitioning (Q5449533) (← links)
- Finding (Short) Paths in Social Networks (Q5755199) (← links)
- Asymptotics of coverages of HD confidence sets and recentering at shrinkage estimates: phase transitions, large deviations (Q6578501) (← links)
- Valid confidence intervals for \(\mu, \sigma\) when there is only one observation available (Q6648796) (← links)
