Volgen
Jan van den Brand
Jan van den Brand
Geverifieerd e-mailadres voor gatech.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
1502020
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
1402021
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
1122020
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
1002020
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
802019
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
792021
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
552022
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
472019
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
462019
Algorithm and hardness for dynamic attention maintenance in large language models
J Brand, Z Song, T Zhou
arXiv preprint arXiv:2304.02207, 2023
312023
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
302022
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms
J van den Brand
Symposium on Simplicity in Algorithms (SOSA), 1-13, 2021
272021
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
222017
A deterministic almost-linear time algorithm for minimum-cost flow
J Van Den Brand, L Chen, R Peng, R Kyng, YP Liu, MP Gutenberg, ...
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
212023
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
132022
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
112021
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
82022
Dynamic maxflow via dynamic interior point methods
J van den Brand, YP Liu, A Sidford
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1215-1228, 2023
72023
Complexity Term Balancer
J van den Brand
https://www.ocf.berkeley.edu/~vdbrand/complexity/, 0
7
On dynamic graph algorithms with predictions
J Brand, S Forster, Y Nazari, A Polak
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024
52024
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20