Algorithms achieve almost-linear time for ℓ_p-norm flow and dual regression problems on unit-weighted graphs for a range of p, plus applications to max-flow and total variation.
Self-adjusting binary search trees
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
A multi-agent LLM system autonomously produced publishable results on five out of eight mathematical and theoretical computer science problems.
citing papers explorer
-
Flows in Almost Linear Time via Adaptive Preconditioning
Algorithms achieve almost-linear time for ℓ_p-norm flow and dual regression problems on unit-weighted graphs for a range of p, plus applications to max-flow and total variation.
-
Bolzano: Case Studies in LLM-Assisted Mathematical Research
A multi-agent LLM system autonomously produced publishable results on five out of eight mathematical and theoretical computer science problems.