default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNima Anari
Nima AhmadiPourAnari
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j6]Erdem Biyik
, Nima Anari, Dorsa Sadigh:
Batch Active Learning of Reward Functions from Human Preferences. ACM Trans. Hum. Robot Interact. 13(2): 24:1-24:27 (2024)- [c41]Nima Anari, Sinho Chewi, Thuy-Duong Vuong:
Fast parallel sampling under isoperimetry. COLT 2024: 161-185 - [c40]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses. SODA 2024: 5029-5056 - [c39]Nima Anari, Ruiquan Gao, Aviad Rubinstein:
Parallel Sampling via Counting. STOC 2024: 537-548 - [c38]Nima Anari, Frederic Koehler, Thuy-Duong Vuong:
Trickle-Down in Localization Schemes and Applications. STOC 2024: 1094-1105 - [i42]Nima Anari, Sinho Chewi, Thuy-Duong Vuong:
Fast parallel sampling under isoperimetry. CoRR abs/2401.09016 (2024) - [i41]Erdem Biyik, Nima Anari, Dorsa Sadigh:
Batch Active Learning of Reward Functions from Human Preferences. CoRR abs/2402.15757 (2024) - [i40]Nima Anari, Frederic Koehler, Thuy-Duong Vuong:
Trickle-Down in Localization Schemes and Applications. CoRR abs/2407.16104 (2024) - [i39]Nima Anari, Ruiquan Gao, Aviad Rubinstein:
Parallel Sampling via Counting. CoRR abs/2408.09442 (2024) - 2023
- [c37]Andy Shih, Suneel Belkhale, Stefano Ermon, Dorsa Sadigh, Nima Anari:
Parallel Sampling of Diffusion Models. NeurIPS 2023 - [c36]Nima Anari, Moses Charikar, Prasanna Ramakrishnan:
Distortion in metric matching with ordinal preferences. EC 2023: 90-110 - [c35]Nima Anari, Callum Burgess, Kevin Tian, Thuy-Duong Vuong:
Quadratic Speedups in Parallel Sampling from Determinantal Distributions. SPAA 2023: 367-377 - [c34]Nima Anari, Yizhi Huang, Tianyu Liu, Thuy-Duong Vuong, Brian Xu, Katherine Yu:
Parallel Discrete Sampling via Continuous Walks. STOC 2023: 103-116 - [i38]Nima Anari, Moses Charikar, Prasanna Ramakrishnan:
Distortion in metric matching with ordinal preferences. CoRR abs/2305.12119 (2023) - [i37]Andy Shih, Suneel Belkhale, Stefano Ermon, Dorsa Sadigh, Nima Anari:
Parallel Sampling of Diffusion Models. CoRR abs/2305.16317 (2023) - [i36]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses. CoRR abs/2307.10466 (2023) - 2022
- [c33]Nima Anari, Thuy-Duong Vuong:
From Sampling to Optimization on Discrete Domains with Applications to Determinant Maximization. COLT 2022: 5596-5618 - [c32]Nima Anari, Yang P. Liu, Thuy-Duong Vuong:
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. FOCS 2022: 123-134 - [c31]Nima Anari, Michal Derezinski, Thuy-Duong Vuong, Elizabeth Yang:
Domain Sparsification of Discrete Distributions Using Entropic Independence. ITCS 2022: 5:1-5:23 - [c30]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Entropic independence: optimal mixing of down-up random walks. STOC 2022: 1418-1430 - [i35]Nima Anari, Callum Burgess, Kevin Tian, Thuy-Duong Vuong:
Improved Sampling-to-Counting Reductions in High-Dimensional Expanders and Faster Parallel Determinantal Sampling. CoRR abs/2203.11190 (2022) - [i34]Nima Anari, Yang P. Liu, Thuy-Duong Vuong:
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence. CoRR abs/2204.02570 (2022) - 2021
- [j5]Alfredo Torrico, Mohit Singh, Sebastian Pokutta, Nika Haghtalab, Joseph (Seffi) Naor, Nima Anari:
Structured Robust Submodular Maximization: Offline and Online Algorithms. INFORMS J. Comput. 33(4): 1590-1607 (2021) - [c29]Nima Anari, Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood. COLT 2021: 93-158 - [c28]Vivek Myers, Erdem Biyik, Nima Anari, Dorsa Sadigh:
Learning Multimodal Rewards from Rankings. CoRL 2021: 342-352 - [c27]Nima Anari, Nathan Hu, Amin Saberi, Aaron Schild:
Sampling Arborescences in Parallel. ITCS 2021: 83:1-83:18 - [c26]Nima Anari, Cynthia Vinzant:
Log-concave polynomials in theory and applications (tutorial). STOC 2021: 12 - [c25]Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant, Thuy-Duong Vuong:
Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests. STOC 2021: 408-420 - [c24]Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur, Thuy-Duong Vuong:
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more. STOC 2021: 433-446 - [i33]Yeganeh Alimohammadi, Nima Anari, Kirankumar Shiragur, Thuy-Duong Vuong:
Fractionally Log-Concave and Sector-Stable Polynomials: Counting Planar Matchings and More. CoRR abs/2102.02708 (2021) - [i32]Nima Anari, Thuy-Duong Vuong:
Simple and Near-Optimal MAP Inference for Nonsymmetric DPPs. CoRR abs/2102.05347 (2021) - [i31]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Entropic Independence in High-Dimensional Expanders: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Polynomials and the Ising Model. CoRR abs/2106.04105 (2021) - [i30]Nima Anari, Michal Derezinski, Thuy-Duong Vuong, Elizabeth Yang:
Domain Sparsification of Discrete Distributions using Entropic Independence. CoRR abs/2109.06442 (2021) - [i29]Vivek Myers, Erdem Biyik, Nima Anari, Dorsa Sadigh:
Learning Multimodal Rewards from Rankings. CoRR abs/2109.12750 (2021) - [i28]Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, Thuy-Duong Vuong:
Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities. CoRR abs/2111.03247 (2021) - 2020
- [j4]Nima Anari, Vijay V. Vazirani:
Planar Graph Perfect Matching Is in NC. J. ACM 67(4): 21:1-21:34 (2020) - [c23]Nima Anari, Thuy-Duong Vuong:
An Extension of Plücker Relations with Applications to Subdeterminant Maximization. APPROX-RANDOM 2020: 56:1-56:16 - [c22]Nima Anari, Kuikui Liu, Shayan Oveis Gharan:
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model. FOCS 2020: 1319-1330 - [c21]Nima Anari, Michal Derezinski:
Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases. FOCS 2020: 1331-1344 - [c20]Nima Anari, Vijay V. Vazirani:
Matching Is as Easy as the Decision Problem, in the NC Model. ITCS 2020: 54:1-54:25 - [c19]Nima Anari, Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
Instance Based Approximations to Profile Maximum Likelihood. NeurIPS 2020 - [i27]Nima Anari, Kuikui Liu, Shayan Oveis Gharan:
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model. CoRR abs/2001.00303 (2020) - [i26]Nima Anari, Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood. CoRR abs/2004.02425 (2020) - [i25]Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant:
Log-Concave Polynomials IV: Exchange Properties, Tight Mixing Times, and Faster Sampling of Spanning Trees. CoRR abs/2004.07220 (2020) - [i24]Nima Anari, Michal Derezinski:
Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases. CoRR abs/2004.09079 (2020) - [i23]Nima Anari, Thuy-Duong Vuong:
An Extension of Plücker Relations with Applications to Subdeterminant Maximization. CoRR abs/2004.13018 (2020) - [i22]Nima Anari, Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
Instance Based Approximations to Profile Maximum Likelihood. CoRR abs/2011.02761 (2020) - [i21]Nima Anari, Nathan Hu, Amin Saberi, Aaron Schild:
Sampling Arborescences in Parallel. CoRR abs/2012.09502 (2020)
2010 – 2019
- 2019
- [c18]Nima Anari, Nika Haghtalab, Seffi Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Structured Robust Submodular Maximization: Offline and Online Algorithms. AISTATS 2019: 3128-3137 - [c17]Nima Anari, Rad Niazadeh, Amin Saberi, Ali Shameli:
Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection. EC 2019: 91-92 - [c16]Nima Anari, Alireza Rezaei:
A Tight Analysis of Bethe Approximation for Permanent. FOCS 2019: 1434-1445 - [c15]Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant:
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid. STOC 2019: 1-12 - [i20]Nima Anari, Vijay V. Vazirani:
A Pseudo-Deterministic RNC Algorithm for General Graph Perfect Matching. CoRR abs/1901.10387 (2019) - [i19]Erdem Biyik, Kenneth Wang, Nima Anari, Dorsa Sadigh:
Batch Active Learning Using Determinantal Point Processes. CoRR abs/1906.07975 (2019) - 2018
- [j3]Nima Anari, Gagan Goel, Afshin Nikzad:
Budget Feasible Procurement Auctions. Oper. Res. 66(3): 637-652 (2018) - [c14]Nima Anari, Shayan Oveis Gharan, Cynthia Vinzant:
Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids. FOCS 2018: 35-46 - [c13]Nima Anari, Vijay V. Vazirani:
Planar Graph Perfect Matching Is in NC. FOCS 2018: 650-661 - [c12]Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan:
Graph Clustering using Effective Resistance. ITCS 2018: 41:1-41:16 - [c11]Nima Anari, Constantinos Daskalakis, Wolfgang Maass, Christos H. Papadimitriou, Amin Saberi, Santosh S. Vempala:
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons. NeurIPS 2018: 10880-10890 - [c10]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava:
Approximating the Largest Root and Applications to Interlacing Families. SODA 2018: 1015-1028 - [c9]Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani:
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. SODA 2018: 2274-2290 - [i18]Nima Anari, Shayan Oveis Gharan, Cynthia Vinzant:
Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids. CoRR abs/1807.00929 (2018) - [i17]Nima Anari, Rad Niazadeh, Amin Saberi, Ali Shameli:
Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection. CoRR abs/1807.05477 (2018) - [i16]Nima Anari, Constantinos Daskalakis, Wolfgang Maass, Christos H. Papadimitriou, Amin Saberi, Santosh S. Vempala:
Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons. CoRR abs/1810.11896 (2018) - [i15]Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant:
Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids. CoRR abs/1811.01600 (2018) - [i14]Nima Anari, Kuikui Liu, Shayan Oveis Gharan, Cynthia Vinzant:
Log-Concave Polynomials II: High-Dimensional Walks and an FPRAS for Counting Bases of a Matroid. CoRR abs/1811.01816 (2018) - [i13]Nima Anari, Alireza Rezaei:
A Tight Analysis of Bethe Approximation for Permanent. CoRR abs/1811.02933 (2018) - 2017
- [c8]Nima Anari, Leonid Gurvits, Shayan Oveis Gharan, Amin Saberi:
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices. FOCS 2017: 914-925 - [c7]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
Nash Social Welfare, Matrix Permanent, and Stable Polynomials. ITCS 2017: 36:1-36:12 - [c6]Nima Anari, Shayan Oveis Gharan:
A generalization of permanent inequalities and applications in counting and optimization. STOC 2017: 384-396 - [i12]Nima Anari, Shayan Oveis Gharan:
A Generalization of Permanent Inequalities and Applications in Counting and Optimization. CoRR abs/1702.02937 (2017) - [i11]Nima Anari, Leonid Gurvits, Shayan Oveis Gharan, Amin Saberi:
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices. CoRR abs/1704.03486 (2017) - [i10]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Nikhil Srivastava:
Approximating the Largest Root and Applications to Interlacing Families. CoRR abs/1704.03892 (2017) - [i9]Nima Anari, Vijay V. Vazirani:
Planar Graph Perfect Matching is in NC. CoRR abs/1709.07822 (2017) - [i8]Nima Anari, Nika Haghtalab, Joseph Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Robust Submodular Maximization: Offline and Online Algorithms. CoRR abs/1710.04740 (2017) - [i7]Vedat Levi Alev, Nima Anari, Lap Chi Lau, Shayan Oveis Gharan:
Graph Clustering using Effective Resistance. CoRR abs/1711.06530 (2017) - 2016
- [j2]Nima Anari, MohammadAmin Fazli, Mohammad Ghodsi, MohammadAli Safari:
Euclidean movement minimization. J. Comb. Optim. 32(2): 354-367 (2016) - [c5]Nima Anari, Shayan Oveis Gharan, Alireza Rezaei:
Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes. COLT 2016: 103-115 - [i6]Nima Anari, Shayan Oveis Gharan, Alireza Rezaei:
Monte Carlo Markov Chains Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes. CoRR abs/1602.05242 (2016) - [i5]Nima Anari, Shayan Oveis Gharan, Amin Saberi, Mohit Singh:
Nash Social Welfare, Matrix Permanent, and Stable Polynomials. CoRR abs/1609.07056 (2016) - [i4]Nima Anari, Tung Mai, Shayan Oveis Gharan, Vijay V. Vazirani:
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities. CoRR abs/1612.05191 (2016) - 2015
- [b1]Nima Anari:
New Approaches to the Asymmetric Traveling Salesman and Related Problems. University of California, Berkeley, USA, 2015 - [c4]Nima Anari, Shayan Oveis Gharan:
Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP. FOCS 2015: 20-39 - 2014
- [c3]Nima Anari, Gagan Goel, Afshin Nikzad:
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets. FOCS 2014: 266-275 - [i3]Nima Anari, Gagan Goel, Afshin Nikzad:
Mechanisms Design for Crowdsourcing: An Optimal 1-1/e Approximate Budget-Feasible Mechanism for Large Markets. CoRR abs/1405.2452 (2014) - [i2]Nima Anari, Shayan Oveis Gharan:
Effective-Resistance-Reducing Flows and Asymmetric TSP. CoRR abs/1411.4613 (2014) - [i1]Nima Anari, Shayan Oveis Gharan:
The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP. CoRR abs/1412.1143 (2014) - 2013
- [j1]Nima AhmadiPourAnari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium pricing with positive externalities. Theor. Comput. Sci. 476: 1-15 (2013) - 2011
- [c2]MohammadAmin Fazli, MohammadAli Safari, Nima Anari, Pooya Jalaly Khalilabadi, Mohammad Ghodsi:
Euclidean Movement Minimization. CCCG 2011 - 2010
- [c1]Nima Anari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni:
Equilibrium Pricing with Positive Externalities (Extended Abstract). WINE 2010: 424-431
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
