Nima Anari
Nima Anari
Preverjeni e-poštni naslov na cs.stanford.edu - Domača stran
Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid
N Anari, K Liu, SO Gharan, C Vinzant
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 1-12, 2019
Monte Carlo Markov chain algorithms for sampling strongly Rayleigh distributions and determinantal point processes
N Anari, SO Gharan, A Rezaei
Conference on Learning Theory, 103-115, 2016
Spectral independence in high-dimensional expanders and applications to the hardcore model
N Anari, K Liu, SO Gharan
SIAM Journal on Computing, FOCS20-1-FOCS20-37, 2021
Log-concave polynomials I: entropy, and a deterministic approximation algorithm for counting bases of matroids
N Anari, SO Gharan, C Vinzant
arXiv preprint arXiv:1807.00929, 2018
Nash social welfare for indivisible items under separable, piecewise-linear concave utilities
N Anari, T Mai, SO Gharan, VV Vazirani
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
Mechanism design for crowdsourcing: An optimal 1-1/e competitive budget-feasible mechanism for large markets
N Anari, G Goel, A Nikzad
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 266-275, 2014
Nash social welfare, matrix permanent, and stable polynomials
N Anari, SO Gharan, A Saberi, M Singh
arXiv preprint arXiv:1609.07056, 2016
Effective-resistance-reducing flows, spectrally thin trees, and asymmetric TSP
N Anari, SO Gharan
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 20-39, 2015
Log-concave polynomials III: Mason's ultra-log-concavity conjecture for independent sets of matroids
N Anari, K Liu, SO Gharan, C Vinzant
arXiv preprint arXiv:1811.01600, 2018
Batch active learning using determinantal point processes
E Bıyık, K Wang, N Anari, D Sadigh
arXiv preprint arXiv:1906.07975, 2019
A generalization of permanent inequalities and applications in counting and optimization
N Anari, SO Gharan
Advances in Mathematics 383, 107657, 2021
Equilibrium pricing with positive externalities
N AhmadiPourAnari, S Ehsani, M Ghodsi, N Haghpanah, N Immorlica, ...
Theoretical Computer Science 476, 1-15, 2013
Graph clustering using effective resistance
VL Alev, N Anari, LC Lau, SO Gharan
arXiv preprint arXiv:1711.06530, 2017
Entropic independence I: Modified log-Sobolev inequalities for fractionally log-concave distributions and high-temperature ising models
N Anari, V Jain, F Koehler, HT Pham, TD Vuong
arXiv preprint arXiv:2106.04105, 2021
The Kadison-Singer problem for strongly Rayleigh measures and applications to Asymmetric TSP
N Anari, SO Gharan
arXiv preprint arXiv:1412.1143, 2014
Fractionally log-concave and sector-stable polynomials: counting planar matchings and more
Y Alimohammadi, N Anari, K Shiragur, TD Vuong
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Structured robust submodular maximization: Offline and online algorithms
N Anari, N Haghtalab, S Naor, S Pokutta, M Singh, A Torrico
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
Log-concave polynomials IV: approximate exchange, tight mixing times, and near-optimal sampling of forests
N Anari, K Liu, SO Gharan, C Vinzant, TD Vuong
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Learning multimodal rewards from rankings
V Myers, E Biyik, N Anari, D Sadigh
Conference on Robot Learning, 342-352, 2022
Planar graph perfect matching is in NC
N Anari, VV Vazirani
Journal of the ACM (JACM) 67 (4), 1-34, 2020
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20