Jan van den Brand

Orcid: 0000-0001-8611-6896

Affiliations:
  • Georgia Institute of Technology, USA


According to our database1, Jan van den Brand authored at least 29 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Bit Complexity of Dynamic Algebraic Formulas and their Determinants.
CoRR, 2024

On Dynamic Graph Algorithms with Predictions.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time.
CoRR, 2023

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow.
CoRR, 2023

Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques.
CoRR, 2023

Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models.
CoRR, 2023

Dynamic Maxflow via Dynamic Interior Point Methods.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Deterministic Fully Dynamic SSSP and More.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Faster maxflow via improved dynamic spectral vertex sparsifiers.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Fast Deterministic Fully Dynamic Distance Approximation.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Nearly Optimal Communication and Query Complexity of Bipartite Matching.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization.
PhD thesis, 2021

Minimum cost flows, MDPs, and ℓ<sub>1</sub>-regression in nearly linear time for dense instances.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Breaking the quadratic barrier for matroid intersection.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Training (Overparametrized) Neural Networks in Near-Linear Time.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Solving tall dense linear programs in nearly linear time.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

A Deterministic Linear Program Solver in Current Matrix Multiplication Time.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Sensitive Distance and Reachability Oracles for Large Batch Updates.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017
The Mutual information of LDGM codes.
CoRR, 2017

2016
Instance-Level Segmentation of Vehicles by Deep Contours.
Proceedings of the Computer Vision - ACCV 2016 Workshops, 2016


  Loading...