Jan van den Brand
Jan van den Brand
Simons Institute at UC Berkeley
Verified email at kth.se - Homepage
Title
Cited by
Cited by
Year
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
392020
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
322020
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
312020
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
312019
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
232021
Fully-dynamic graph sparsifiers against an adaptive adversary
A Bernstein, J Brand, MP Gutenberg, D Nanongkai, T Saranurak, ...
arXiv preprint arXiv:2004.08432, 2020
222020
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
212019
Instance-level segmentation of vehicles by deep contours
J van den Brand, M Ochs, R Mester
Asian Conference on Computer Vision, 477-492, 2016
212016
Training (overparametrized) neural networks in near-linear time
J van den Brand, B Peng, Z Song, O Weinstein
12th Innovations in Theoretical Computer Science Conference (ITCS 2021), 2021
202021
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
172019
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms
J van den Brand
Symposium on Simplicity in Algorithms (SOSA), 1-13, 2021
42021
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
22021
Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization
J van den Brand
KTH Royal Institute of Technology, 2021
12021
The Mutual information of LDGM codes
J Brand, N Jaafari
arXiv preprint arXiv:1707.04413, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–14