Concepedia

Nima Anari

NA

20

Publications

588

Citations

15

H-Index

2010

Active since

Affiliations

Stanford University(Current)

University of Washington

North Carolina State University

University of California, Berkeley

Massachusetts Institute of Technology

Nima Anari is an author at Stanford University specializing in engineering, computer science, and combinatorial optimization.

Top concepts

EngineeringCombinatorial OptimizationComputer ScienceDiscrete MathematicsMathematical ProgrammingApproximation TheoryComputational ComplexityOperations ResearchEntropyProbability

Publications per year

2010–2024

20

Publications

20

Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid

Nima Anari, Kuikui Liu, Shayan Oveis Gharan et al. · 2019 · 98 citations · Full text

Log-concave Polynomials Ii, Engineering, Reliability Polynomial +18

Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets

Nima Anari, Gagan Goel, Afshin Nikzad · 2014 · 77 citations

Mathematical Programming, Large Markets, Engineering +20

Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids

Nima Anari, Shayan Oveis Gharan, Cynthia Vinzant · 2018 · 47 citations

Mathematical Programming, Engineering, Computational Complexity +17

A generalization of permanent inequalities and applications in counting and optimization

Nima Anari, Shayan Oveis Gharan · 2017 · 41 citations

Mathematical Programming, Engineering, Computational Complexity +16

Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP

Nima Anari, Shayan Oveis Gharan · 2015 · 34 citations

Rows per page

1–5 of 20