Nima Anari
Orcid: 0000-0002-4394-3530
According to our database1,
Nima Anari
authored at least 57 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Universality of Spectral Independence with Applications to Fast Mixing in Spin Glasses.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023
Proceedings of the 24th ACM Conference on Economics and Computation, 2023
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023
2022
Improved Sampling-to-Counting Reductions in High-Dimensional Expanders and Faster Parallel Determinantal Sampling.
CoRR, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
From Sampling to Optimization on Discrete Domains with Applications to Determinant Maximization.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022
2021
INFORMS J. Comput., 2021
Entropic Independence II: Optimal Sampling and Concentration via Restricted Modified Log-Sobolev Inequalities.
CoRR, 2021
Entropic Independence in High-Dimensional Expanders: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Polynomials and the Ising Model.
CoRR, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Proceedings of the Conference on Robot Learning, 8-11 November 2021, London, UK., 2021
The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood.
Proceedings of the Conference on Learning Theory, 2021
2020
Log-Concave Polynomials IV: Exchange Properties, Tight Mixing Times, and Faster Sampling of Spanning Trees.
CoRR, 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Proceedings of the Approximation, 2020
2019
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019
2018
Log-Concave Polynomials III: Mason's Ultra-Log-Concavity Conjecture for Independent Sets of Matroids.
CoRR, 2018
Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
Log-Concave Polynomials, Entropy, and a Deterministic Approximation Algorithm for Counting Bases of Matroids.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018
2017
A generalization of permanent inequalities and applications in counting and optimization.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017
2016
Monte Carlo Markov Chains Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes.
CoRR, 2016
Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes.
Proceedings of the 29th Conference on Learning Theory, 2016
2015
PhD thesis, 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
Mechanisms Design for Crowdsourcing: An Optimal 1-1/e Approximate Budget-Feasible Mechanism for Large Markets.
CoRR, 2014
The Kadison-Singer Problem for Strongly Rayleigh Measures and Applications to Asymmetric TSP.
CoRR, 2014
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets.
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010