Obserwuj
Jan van den Brand
Tytuł
Cytowane przez
Cytowane przez
Rok
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
882020
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
862021
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
792020
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
662020
Training (overparametrized) neural networks in near-linear time
J Brand, B Peng, Z Song, O Weinstein
arXiv preprint arXiv:2006.11648, 2020
482020
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
452019
Fully-dynamic graph sparsifiers against an adaptive adversary
A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ...
arXiv preprint arXiv:2004.08432, 2020
432020
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
302019
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
302019
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
192017
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms
J van den Brand
Symposium on Simplicity in Algorithms (SOSA), 1-13, 2021
162021
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
92021
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
82022
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
22022
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
12022
Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization
J van den Brand
KTH Royal Institute of Technology, 2021
12021
Dynamic Maxflow via Dynamic Interior Point Methods
J Brand, YP Liu, A Sidford
arXiv preprint arXiv:2212.06315, 2022
2022
The Mutual information of LDGM codes
J Brand, N Jaafari
arXiv preprint arXiv:1707.04413, 2017
2017
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–18