| A deterministic linear program solver in current matrix multiplication time J van den Brand Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020 | 111 | 2020 |
| Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances J van den Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, D Wang Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 104 | 2021 |
| Bipartite matching in nearly-linear time on moderately dense graphs J van den Brand, YT Lee, D Nanongkai, R Peng, T Saranurak, A Sidford, ... 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 90 | 2020 |
| Solving tall dense linear programs in nearly linear time J van den Brand, YT Lee, A Sidford, Z Song Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 77 | 2020 |
| Training (overparametrized) neural networks in near-linear time J Brand, B Peng, Z Song, O Weinstein 12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021 | 66 | 2021 |
| Dynamic matrix inverse: Improved algorithms and matching conditional lower bounds J van den Brand, D Nanongkai, T Saranurak 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 63 | 2019 |
| Fully-dynamic graph sparsifiers against an adaptive adversary A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ... 49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022 | 46 | 2022 |
| Dynamic approximate shortest paths and beyond: Subquadratic and worst-case update time J van den Brand, D Nanongkai 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 39 | 2019 |
| Sensitive distance and reachability oracles for large batch updates J van den Brand, T Saranurak 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019 | 35 | 2019 |
| Instance-level segmentation of vehicles by deep contours J van den Brand, M Ochs, R Mester Computer Vision–ACCV 2016 Workshops: ACCV 2016 International Workshops …, 2017 | 22 | 2017 |
| Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms J van den Brand Symposium on Simplicity in Algorithms (SOSA), 1-13, 2021 | 18 | 2021 |
| Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models J Brand, Z Song, T Zhou arXiv preprint arXiv:2304.02207, 2023 | 17* | 2023 |
| Faster maxflow via improved dynamic spectral vertex sparsifiers J van den Brand, Y Gao, A Jambulapati, YT Lee, YP Liu, R Peng, ... Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 17 | 2022 |
| Fast deterministic fully dynamic distance approximation J Van Den Brand, S Forster, Y Nazari 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 10 | 2022 |
| Breaking the quadratic barrier for matroid intersection J Blikstad, J van den Brand, S Mukhopadhyay, D Nanongkai Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 9 | 2021 |
| Nearly optimal communication and query complexity of bipartite matching J Blikstad, J Van Den Brand, Y Efron, S Mukhopadhyay, D Nanongkai 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022 | 5 | 2022 |
| Complexity Term Balancer J van den Brand https://www.ocf.berkeley.edu/~vdbrand/complexity/, 0 | 3 | |
| Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization J van den Brand KTH Royal Institute of Technology, 2021 | 2 | 2021 |
| Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary A Alokhina, J Brand arXiv preprint arXiv:2304.07403, 2023 | 1 | 2023 |
| On Dynamic Graph Algorithms with Predictions J Brand, S Forster, Y Nazari, A Polak arXiv preprint arXiv:2307.09961, 2023 | | 2023 |
Aaron SidfordStanford UniversityVerified email at stanford.edu
