Nima Anari

Identifiers

• name variant Nima Anari 0.60 · backfill

Papers (19)

1. Constant-Stretch Rounding on the Hypersimplex cs.DS · 2026 · author #1
2. Sampling Directed Eulerian Tours in $\widetilde O(m^{3/2})$ Time cs.DS · 2026 · author #1
3. Optimal $e^{(\gamma+o(1))n}$-Approximation of the Permanent of Positive Semidefinite Matrices cs.DS · 2026 · author #1
4. Batch Active Learning Using Determinantal Point Processes cs.LG · 2019 · author #3
5. Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid cs.DS · 2018 · author #1
6. Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids math.CO · 2018 · author #1
7. Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons cs.DS · 2018 · author #1
8. Log-Concave Polynomials I: Entropy and a Deterministic Approximation Algorithm for Counting Bases of Matroids cs.DS · 2018 · author #1
9. Graph Clustering using Effective Resistance cs.DS · 2017 · author #2
10. Planar Graph Perfect Matching is in NC cs.DS · 2017 · author #1
11. Approximating the Largest Root and Applications to Interlacing Families cs.DS · 2017 · author #1
12. Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices math.CO · 2017 · author #1
13. A Generalization of Permanent Inequalities and Applications in Counting and Optimization cs.DS · 2017 · author #1
14. Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities cs.GT · 2016 · author #1
15. Nash Social Welfare, Matrix Permanent, and Stable Polynomials cs.DS · 2016 · author #1
16. Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes cs.LG · 2016 · author #1
17. The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP cs.DS · 2014 · author #1
18. Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP cs.DS · 2014 · author #1
19. Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets cs.GT · 2014 · author #1

Mentions

• 2606.00996 #1 · arxiv_oai · confidence 0.70 Nima Anari
• 1412.1143 #1 · backfill · confidence 0.70 Nima Anari
• 1411.4613 #1 · backfill · confidence 0.70 Nima Anari
• 1405.2452 #1 · backfill · confidence 0.70 Nima Anari
• 2605.29566 #1 · arxiv_oai · confidence 0.70 Nima Anari
• 2605.21946 #1 · arxiv_oai · confidence 0.70 Nima Anari

Frequent Coauthors

• Shayan Oveis Gharan 12 shared papers
• Amin Saberi 4 shared papers
• Cynthia Vinzant 3 shared papers
• Kuikui Liu 2 shared papers
• Vijay V. Vazirani 2 shared papers
• Afshin Nikzad 1 shared papers
• Alireza Haqi 1 shared papers
• Alireza Rezaei 1 shared papers
• Christos H. Papadimitriou 1 shared papers
• Constantinos Daskalakis 1 shared papers
• Dorsa Sadigh 1 shared papers
• Erdem B{\i}y{\i}k 1 shared papers
• Eric Ma 1 shared papers
• Farzam Ebrahimnejad 1 shared papers
• Gagan Goel 1 shared papers
• Kenneth Wang 1 shared papers
• Lap Chi Lau 1 shared papers
• Leonid Gurvits 1 shared papers
• Mohit Singh 1 shared papers
• Nikhil Srivastava 1 shared papers