default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan van den Brand
Person information
- affiliation: Georgia Institute of Technology, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c26]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. FOCS 2024: 2010-2032- [c25]Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang:
The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants. ICALP 2024: 10:1-10:20 - [c24]Jan van den Brand, Zhao Song, Tianyi Zhou:
Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models. ICML 2024 - [c23]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:
Key Research Areas for Building and Deploying a Common Data Model for an Intensive Medicine Data Space in Europe and Beyond. MIE 2024: 1465-1466 - [c22]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. SODA 2024: 2980-2998 - [c21]Anastasiia Alokhina, Jan van den Brand:
Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary. SODA 2024: 3027-3039 - [c20]Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak:
On Dynamic Graph Algorithms with Predictions. SODA 2024: 3534-3557 - [i25]Emile Anand, Jan van den Brand, Mehrdad Ghadiri, Daniel J. Zhang:
The Bit Complexity of Dynamic Algebraic Formulas and their Determinants. CoRR abs/2401.11127 (2024) - [i24]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Simon Meierhans, Maximilian Probst Gutenberg, Sushant Sachdeva:
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality. CoRR abs/2407.10830 (2024) - 2023
- [c19]Jan van den Brand, Daniel J. Zhang:
Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques. FOCS 2023: 493-502 - [c18]Jan van den Brand, Li Chen, Richard Peng, Rasmus Kyng, Yang P. Liu, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. FOCS 2023: 503-514 - [c17]Jan van den Brand, Adam Karczmarz:
Deterministic Fully Dynamic SSSP and More. FOCS 2023: 2312-2321 - [c16]Jan van den Brand, Yang P. Liu, Aaron Sidford:
Dynamic Maxflow via Dynamic Interior Point Methods. STOC 2023: 1215-1228 - [i23]Jan van den Brand, Zhao Song, Tianyi Zhou:
Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models. CoRR abs/2304.02207 (2023) - [i22]Anastasiia Alokhina, Jan van den Brand:
Fully Dynamic Shortest Path Reporting Against an Adaptive Adversary. CoRR abs/2304.07403 (2023) - [i21]Jan van den Brand, Daniel J. Zhang:
Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques. CoRR abs/2304.12992 (2023) - [i20]Jan van den Brand, Sebastian Forster, Yasamin Nazari, Adam Polak:
On Dynamic Graph Algorithms with Predictions. CoRR abs/2307.09961 (2023) - [i19]Jan van den Brand, Adam Karczmarz:
Deterministic Fully Dynamic SSSP and More. CoRR abs/2309.16594 (2023) - [i18]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow. CoRR abs/2309.16629 (2023) - [i17]Jan van den Brand, Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, Sushant Sachdeva, Aaron Sidford:
Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time. CoRR abs/2311.03174 (2023) - 2022
- [c15]Jan van den Brand, Sebastian Forster, Yasamin Nazari:
Fast Deterministic Fully Dynamic Distance Approximation. FOCS 2022: 1011-1022 - [c14]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. FOCS 2022: 1174-1185 - [c13]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. ICALP 2022: 20:1-20:20 - [c12]Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford:
Faster maxflow via improved dynamic spectral vertex sparsifiers. STOC 2022: 543-556 - [i16]Joakim Blikstad, Jan van den Brand, Yuval Efron, Sagnik Mukhopadhyay, Danupon Nanongkai:
Nearly Optimal Communication and Query Complexity of Bipartite Matching. CoRR abs/2208.02526 (2022) - [i15]Jan van den Brand, Yang P. Liu, Aaron Sidford:
Dynamic Maxflow via Dynamic Interior Point Methods. CoRR abs/2212.06315 (2022) - 2021
- [b1]Jan van den Brand:
Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization. KTH Royal Institute of Technology, Sweden, 2021 - [c11]Jan van den Brand, Binghui Peng, Zhao Song, Omri Weinstein:
Training (Overparametrized) Neural Networks in Near-Linear Time. ITCS 2021: 63:1-63:15 - [c10]Jan van den Brand:
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms. SOSA 2021: 1-13 - [c9]Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the quadratic barrier for matroid intersection. STOC 2021: 421-432 - [c8]Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances. STOC 2021: 859-869 - [i14]Jan van den Brand, Yin Tat Lee, Yang P. Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Minimum Cost Flows, MDPs, and 𝓁1-Regression in Nearly Linear Time for Dense Instances. CoRR abs/2101.05719 (2021) - [i13]Joakim Blikstad, Jan van den Brand, Sagnik Mukhopadhyay, Danupon Nanongkai:
Breaking the Quadratic Barrier for Matroid Intersection. CoRR abs/2102.05548 (2021) - [i12]Jan van den Brand, Sebastian Forster, Yasamin Nazari:
Fast Deterministic Fully Dynamic Distance Approximation. CoRR abs/2111.03361 (2021) - [i11]Jan van den Brand, Yu Gao, Arun Jambulapati, Yin Tat Lee, Yang P. Liu, Richard Peng, Aaron Sidford:
Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers. CoRR abs/2112.00722 (2021) - 2020
- [c7]Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. FOCS 2020: 919-930 - [c6]Jan van den Brand:
A Deterministic Linear Program Solver in Current Matrix Multiplication Time. SODA 2020: 259-278 - [c5]Jan van den Brand, Yin Tat Lee, Aaron Sidford, Zhao Song:
Solving tall dense linear programs in nearly linear time. STOC 2020: 775-788 - [i10]Jan van den Brand, Yin Tat Lee, Aaron Sidford, Zhao Song:
Solving Tall Dense Linear Programs in Nearly Linear Time. CoRR abs/2002.02304 (2020) - [i9]Aaron Bernstein, Jan van den Brand, Maximilian Probst Gutenberg, Danupon Nanongkai, Thatchaphol Saranurak, Aaron Sidford, He Sun:
Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary. CoRR abs/2004.08432 (2020) - [i8]Jan van den Brand, Binghui Peng, Zhao Song, Omri Weinstein:
Training (Overparametrized) Neural Networks in Near-Linear Time. CoRR abs/2006.11648 (2020) - [i7]Jan van den Brand, Yin Tat Lee, Danupon Nanongkai, Richard Peng, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, Di Wang:
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs. CoRR abs/2009.01802 (2020) - [i6]Jan van den Brand:
Unifying Matrix Data Structures: Simplifying and Speeding up Iterative Algorithms. CoRR abs/2010.13888 (2020)
2010 – 2019
- 2019
- [c4]Jan van den Brand, Thatchaphol Saranurak:
Sensitive Distance and Reachability Oracles for Large Batch Updates. FOCS 2019: 424-435 - [c3]Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. FOCS 2019: 436-455 - [c2]Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. FOCS 2019: 456-480 - [i5]Jan van den Brand, Danupon Nanongkai, Thatchaphol Saranurak:
Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional Lower Bounds. CoRR abs/1905.05067 (2019) - [i4]Jan van den Brand, Thatchaphol Saranurak:
Sensitive Distance and Reachability Oracles for Large Batch Updates. CoRR abs/1907.07982 (2019) - [i3]Jan van den Brand, Danupon Nanongkai:
Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time. CoRR abs/1909.10850 (2019) - [i2]Jan van den Brand:
A Deterministic Linear Program Solver in Current Matrix Multiplication Time. CoRR abs/1910.11957 (2019) - 2017
- [i1]Jan van den Brand, Nor Jaafari:
The Mutual information of LDGM codes. CoRR abs/1707.04413 (2017) - 2016
- [c1]Jan van den Brand, Matthias Ochs, Rudolf Mester:
Instance-Level Segmentation of Vehicles by Deep Contours. ACCV Workshops (1) 2016: 477-492
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
