:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Li, Jason
Format:	Preprint
Publié:	2021
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2106.05513
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Deterministic Almost-Linear-Time Gomory-Hu Trees
par: Abboud, Amir, et autres
Publié: (2025)

Vizing's Theorem in Deterministic Almost-Linear Time
par: Assadi, Sepehr, et autres
Publié: (2025)

Optimal Sensitivity Oracle for Steiner Mincut
par: Bhanja, Koustav
Publié: (2024)

Network Unreliability in Almost-Linear Time
par: Cen, Ruoxu, et autres
Publié: (2025)

Bellman-Ford in Almost-Linear Time for Dense Graphs
par: Li, George Z., et autres
Publié: (2026)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
par: Bucić, Matija, et autres
Publié: (2025)

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
par: Henzinger, Monika, et autres
Publié: (2024)

Approximating Directed Connectivity in Almost-Linear Time
par: Quanrud, Kent
Publié: (2025)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
par: Yoshida, Yuichi
Publié: (2026)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
par: Li, Jason
Publié: (2025)

Deterministic and Exact Fully-dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time
par: El-Hayek, Antoine, et autres
Publié: (2025)

Weighted $k$-Path and Other Problems in Almost $O^*(2^k)$ Deterministic Time via Dynamic Representative Sets
par: Nederlof, Jesper
Publié: (2025)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
par: Brand, Jan van den, et autres
Publié: (2024)

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
par: Elkin, Michael, et autres
Publié: (2024)

Almost Linear Size Edit Distance Sketch
par: Koucký, Michal, et autres
Publié: (2024)

Incremental Shortest Paths in Almost Linear Time via a Modified Interior Point Method
par: Liu, Yang P.
Publié: (2025)

Unbreakable Decomposition in Close-to-Linear Time
par: Anand, Aditya, et autres
Publié: (2024)

Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
par: Haeupler, Bernhard, et autres
Publié: (2025)

Separator Theorem for Minor-Free Graphs in Linear Time
par: Bonnet, Édouard, et autres
Publié: (2025)

Local Search for Clustering in Almost-linear Time
par: Jiang, Shaofeng H. -C., et autres
Publié: (2025)

Approximating Maximum Matching Requires Almost Quadratic Time
par: Behnezhad, Soheil, et autres
Publié: (2024)

Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
par: Kerschbaum, Florian, et autres
Publié: (2025)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time
par: Boneh, Itai, et autres
Publié: (2025)

Deterministic $k$-Median Clustering in Near-Optimal Time
par: Costa, Martín, et autres
Publié: (2025)

Deterministic Dynamic Maximal Matching in Sublinear Update Time
par: Bernstein, Aaron, et autres
Publié: (2025)

Deterministic $(2/3-\varepsilon)$-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries
par: Terao, Tatsuya
Publié: (2024)

Expander Decomposition with Almost Optimal Overhead
par: Bansal, Nikhil, et autres
Publié: (2026)

Almost succinct representation of maximal palindromes
par: Mieno, Takuya, et autres
Publié: (2025)

Almost-Optimal Sublinear Additive Spanners
par: Tan, Zihan, et autres
Publié: (2023)

Distances in Planar Graphs are Almost for Free!
par: Mozes, Shay, et autres
Publié: (2026)

Hypergraph Unreliability in Quasi-Polynomial Time
par: Cen, Ruoxu, et autres
Publié: (2024)

Fast Practical Compression of Deterministic Finite Automata
par: Bille, Philip, et autres
Publié: (2023)

Almost Tight Bounds for Online Hypergraph Matching
par: Tröbst, Thorben, et autres
Publié: (2024)

Deterministic Dynamic Edge Colouring
par: Christiansen, Aleksander B. G.
Publié: (2024)

Deterministic Cache-Oblivious Funnelselect
par: Brodal, Gerth Stølting, et autres
Publié: (2024)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
par: Haeupler, Bernhard, et autres
Publié: (2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
par: Liu, Yuxi, et autres
Publié: (2023)

Almost Tight Bounds for Differentially Private Densest Subgraph
par: Dinitz, Michael, et autres
Publié: (2023)

Deterministic Single Exponential Time Algorithms for Co-Path Packing and Co-Path Set Parameterized by Treewidth
par: Liu, Yuxi, et autres
Publié: (2026)

Faster Pseudo-Deterministic Minimum Cut
par: Kenneth-Mordoch, Yotam
Publié: (2026)