Jan van den Brand

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

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

On Dynamic Graph Algorithms with Predictions.

Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

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

Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary.

Anastasiia Alokhina, Jan van den Brand

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Key Research Areas for Building and Deploying a Common Data Model for an Intensive Medicine Data Space in Europe and Beyond.

Carlos Luis Parra Calderón, Kirsten Colpaert, Felix Balzer, Marc Cuggia, Denis Delamarre, Christel Daniel, Maxim Moinat, Jan van den Brand, Michel E. van Genderen, Lucas M. Fleuren, Christian Jung, Celia Álvarez-Romero

Proceedings of the Digital Health and Informatics Innovations for Sustainable Health Care Systems, 2024

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

Jan van den Brand, Zhao Song, Tianyi Zhou

Proceedings of the Forty-first International Conference on Machine Learning, 2024

The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants.

Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality.

Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

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

Jan van den Brand, Zhao Song, Tianyi Zhou

CoRR, 2023

Dynamic Maxflow via Dynamic Interior Point Methods.

Jan van den Brand, Yang P. Liu, Aaron Sidford

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques.

Jan van den Brand, Daniel J. Zhang

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Deterministic Fully Dynamic SSSP and More.

Jan van den Brand, Adam Karczmarz

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

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

Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Faster maxflow via improved dynamic spectral vertex sparsifiers.

Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford

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.

Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Fast Deterministic Fully Dynamic Distance Approximation.

Jan van den Brand, Sebastian Forster, Yasamin Nazari

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Nearly Optimal Communication and Query Complexity of Bipartite Matching.

Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization.

Jan van den Brand

PhD thesis, 2021

Minimum cost flows, MDPs, and ℓ₁-regression in nearly linear time for dense instances.

Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Breaking the quadratic barrier for matroid intersection.

Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai

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.

Jan van den Brand

Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

Training (Overparametrized) Neural Networks in Near-Linear Time.

Jan van den Brand, Binghui Peng, Zhao Song, Omri Weinstein

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

Solving tall dense linear programs in nearly linear time.

Jan van den Brand, Yin Tat Lee, Aaron Sidford, Zhao Song

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

A Deterministic Linear Program Solver in Current Matrix Multiplication Time.

Jan van den Brand

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs.

Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Sensitive Distance and Reachability Oracles for Large Batch Updates.

Jan van den Brand, Thatchaphol Saranurak

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds.

Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak

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.

Jan van den Brand, Danupon Nanongkai

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017

The Mutual information of LDGM codes.

Jan van den Brand, Nor Jaafari

CoRR, 2017

2016

Instance-Level Segmentation of Vehicles by Deep Contours.

Jan van den Brand, Matthias Ochs, Rudolf Mester

Proceedings of the Computer Vision - ACCV 2016 Workshops, 2016