| Ranking with fairness constraints LE Celis, D Straszak, NK Vishnoi 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 360 | 2018 |
| Fair and diverse DPP-based data summarization LE Celis, V Keswani, D Straszak, A Deshpande, T Kathuria, NK Vishnoi International Conference on Machine Learning. 2018, 2018 | 126 | 2018 |
| Aleph: Efficient Atomic Broadcast in Asynchronous Networks with Byzantine Nodes A Gagol, D Lesniak, D Straszak, M Swietek arXiv preprint arXiv:1908.05156, 2019 | 81 | 2019 |
| Fast generation of random spanning trees and the effective resistance metric A Madry, D Straszak, J Tarnawski Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 80 | 2014 |
| Real stable polynomials and matroids: Optimization and counting D Straszak, NK Vishnoi Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 44 | 2017 |
| Strong inapproximability of the shortest reset word P Gawrychowski, D Straszak International Symposium on Mathematical Foundations of Computer Science, 243-255, 2015 | 41 | 2015 |
| Threshold ecdsa for decentralized asset custody A Gągol, J Kula, D Straszak, M Świętek Cryptology ePrint Archive, 2020 | 38 | 2020 |
| On a natural dynamics for linear programming D Straszak, NK Vishnoi arXiv preprint arXiv:1511.07020, 2015 | 29 | 2015 |
| On the complexity of constrained determinantal point processes LE Celis, A Deshpande, T Kathuria, D Straszak, NK Vishnoi arXiv preprint arXiv:1608.00554, 2016 | 28 | 2016 |
| IRLS and slime mold: Equivalence and convergence D Straszak, NK Vishnoi arXiv preprint arXiv:1601.02712, 2016 | 27 | 2016 |
| Natural algorithms for flow problems D Straszak, NK Vishnoi Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete …, 2016 | 26 | 2016 |
| Maximum entropy distributions: Bit complexity and stability D Straszak, NK Vishnoi Conference on Learning Theory, 2861-2891, 2019 | 22 | 2019 |
| Belief propagation, Bethe approximation and polynomials D Straszak, NK Vishnoi IEEE Transactions on Information Theory 65 (7), 4353-4363, 2019 | 16 | 2019 |
| Iteratively reweighted least squares and slime mold dynamics: connection and convergence D Straszak, NK Vishnoi Mathematical Programming 194 (1), 685-717, 2022 | 14 | 2022 |
| Subdeterminant maximization via nonconvex relaxations and anti-concentration J Ebrahimi, D Straszak, N Vishnoi SIAM Journal on Computing 49 (6), 1249-1270, 2020 | 11 | 2020 |
| Computing maximum entropy distributions everywhere D Straszak, NK Vishnoi ArXiv e-prints, 2017 | 10 | 2017 |
| Highway: Efficient consensus with flexible finality D Kane, A Fackler, A Gągol, D Straszak arXiv preprint arXiv:2101.02159, 2021 | 9 | 2021 |
| Beating in approximate LZW-compressed pattern matching P Gawrychowski, D Straszak International Symposium on Algorithms and Computation, 78-88, 2013 | 6 | 2013 |
| Generalized determinantal point processes: The linear case D Straszak, NK Vishnoi ArXiv e-prints, 2016 | 2 | 2016 |
| On convex programming relaxations for the permanent D Straszak, NK Vishnoi arXiv preprint arXiv:1701.01419, 2017 | 1 | 2017 |
Amit DeshpandeMicrosoft Research在 microsoft.com 的电子邮件经过验证
