Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Share This Author
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Pasin Manurangsi
- Mathematics, Computer ScienceSTOC
- 18 November 2016
TLDR
On Deep Learning with Label Differential Privacy
- Badih Ghazi, Noah Golowich, Ravi Kumar, Pasin Manurangsi, Chiyuan Zhang
- Computer ScienceNeurIPS
- 11 February 2021
TLDR
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs
- Pasin Manurangsi, P. Raghavendra
- Mathematics, Computer ScienceICALP
- 1 July 2016
TLDR
Asymptotic existence of fair divisions for groups
- Pasin Manurangsi, Warut Suksompong
- EconomicsMath. Soc. Sci.
- 26 June 2017
An Improved Integrality Gap for the Călinescu-Karloff-Rabani Relaxation for Multiway Cut
- Haris Angelidakis, Yury Makarychev, Pasin Manurangsi
- MathematicsIPCO
- 17 November 2016
TLDR
On the parameterized complexity of approximating dominating set
- S. KarthikC., B. Laekhanukit, Pasin Manurangsi
- Computer Science, MathematicsElectron. Colloquium Comput. Complex.
- 29 November 2017
TLDR
Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis
- Pasin Manurangsi
- MathematicsAlgorithms
- 10 May 2017
TLDR
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
- Arnab Bhattacharyya, Suprovat Ghoshal, S. KarthikC., Pasin Manurangsi
- Computer Science, MathematicsElectron. Colloquium Comput. Complex.
- 26 March 2018
TLDR
ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network
- Irit Dinur, Pasin Manurangsi
- Computer Science, MathematicsITCS
- 10 May 2018
TLDR
Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
- Pasin Manurangsi
- Mathematics, Computer ScienceICALP
- 2017
TLDR
...
1
2
3
4
5
...