Concepedia

Pasin Manurangsi

PM

Statistics

Publications

25

Citations

692

H-Index

16

Active since

2016

Affiliations

University of California, Berkeley(Current)

Google (United States)

University of Oxford

Weizmann Institute of Science

Charles University

Pasin Manurangsi is an author at University of California, Berkeley specializing in computer science, engineering, and combinatorial optimization.

Top concepts

EngineeringComputer ScienceComputational ComplexityCombinatorial OptimizationDiscrete MathematicsApproximation TheoryGraph TheoryMathematical ProgrammingCryptographyData Privacy

Publications per year

2016–2022

25

Publications

25

Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph

Pasin Manurangsi · 2017 · 142 citations · Full text

Mathematical Programming, K Vertices, Engineering +12

Large-Scale Differentially Private BERT

Rohan Anil, Badih Ghazi, Vineet Gupta et al. · 2022 · 57 citations · Full text

Llm Fine-tuning, Privacy Protection, Engineering +19

Inapproximability of Maximum Biclique Problems, Minimum k-Cut and Densest At-Least-k-Subgraph from the Small Set Expansion Hypothesis

Pasin Manurangsi · Algorithms · 2018 · 48 citations · Full text

Engineering, Small Subset, Computational Complexity +19

The Price of Fairness for Indivisible Goods

Xiaohui Bei, Xinhang Lu, Pasin Manurangsi et al. · Theory of Computing Systems · 2021 · 39 citations · Full text

Economics, Indivisible Goods, Algorithmic Fairness +3

Asymptotic existence of fair divisions for groups

Pasin Manurangsi, Warut Suksompong · Mathematical Social Sciences · 2017 · 37 citations · Full text

Group Structure, Fair Divisions, Fair Division +1

1–5 of 25