Imagen de Portada

Time-Optimal Directed q-Analysis

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Windisch, Felix, Unger, Florian
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Enumerating All Directed Spanning Trees in Optimal Time
por: Gawrychowski, Paweł, et al.
Publicado: (2026)

Near-Optimal Directed Low-Diameter Decompositions
por: Bringmann, Karl, et al.
Publicado: (2025)

Near-Optimal Algorithm for Directed Expander Decompositions
por: Sulser, Aurelio L., et al.
Publicado: (2024)

Time-Optimal $k$-Server
por: Frei, Fabian, et al.
Publicado: (2025)

Simpler Optimal Sorting from a Directed Acyclic Graph
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Optimal-Time Move Structure Construction
por: Brown, Nathaniel K., et al.
Publicado: (2026)

Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
por: Parter, Merav, et al.
Publicado: (2025)

Approximating Directed Connectivity in Almost-Linear Time
por: Quanrud, Kent
Publicado: (2025)

Optimal Pure Differentially Private Sparse Histograms in Deterministic Linear Time
por: Kerschbaum, Florian, et al.
Publicado: (2025)

Time-Optimal Construction of String Synchronizing Sets
por: Ellert, Jonas, et al.
Publicado: (2026)

Optimal Smoothed Analysis of the Simplex Method
por: Bach, Eleon, et al.
Publicado: (2025)

Deterministic $k$-Median Clustering in Near-Optimal Time
por: Costa, Martín, et al.
Publicado: (2025)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
por: Dai, Jiangqi, et al.
Publicado: (2025)

Optimal-Time Mapping in Run-Length Compressed PBWT
por: Bonizzoni, Paola, et al.
Publicado: (2026)

Optimal Static Dictionary with Worst-Case Constant Query Time
por: Hu, Yang, et al.
Publicado: (2024)

An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination
por: Papadopoulos, Kleitos
Publicado: (2026)

Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
por: Kosolobov, Dmitry, et al.
Publicado: (2021)

Fully Dynamic k-Means Coreset in Near-Optimal Update Time
por: la Tour, Max Dupré, et al.
Publicado: (2024)

Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)

Time, Message and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation
por: Goldenfeld, Michael Elkin Tanya
Publicado: (2026)

Nearly Optimal Dynamic Set Cover: Breaking the Quadratic-in-$f$ Time Barrier
por: Bukov, Anton, et al.
Publicado: (2023)

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
por: Rutschmann, Daniel
Publicado: (2026)

A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
por: Chen, Kuowen, et al.
Publicado: (2025)

Fully-Dynamic All-Pairs Shortest Paths: Likely Optimal Worst-Case Update Time
por: Mao, Xiao
Publicado: (2023)

Tight Bounds for Sampling q-Colorings via Coupling from the Past
por: Ding, Tianxing, et al.
Publicado: (2025)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
por: Kiran, Mekala, et al.
Publicado: (2026)

Optimal Enumeration of Eulerian Trails in Directed Graphs
por: Bals, Ben, et al.
Publicado: (2026)

Minimum-Peak-Cost Flows Over Time
por: Anapolska, Mariia, et al.
Publicado: (2025)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
por: Gupta, Anupam, et al.
Publicado: (2026)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2026)

TUCKET: A Tensor Time Series Data Structure for Efficient and Accurate Factor Analysis over Time Ranges
por: Qiu, Ruizhong, et al.
Publicado: (2025)

Directed Token Sliding
por: Banerjee, Niranka, et al.
Publicado: (2024)

Directed Ear Anonymity
por: Milani, Marcelo Garlet
Publicado: (2024)

Approximating Directed Minimum Cut and Arborescence Packing via Directed Expander Hierarchies
por: Jiang, Yonggang, et al.
Publicado: (2025)

From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
por: Chekuri, Chandra, et al.
Publicado: (2024)

Entrywise Low-Rank Approximation and Matrix $p \rightarrow q$ Norms via Global Correlation Rounding
por: Anderson, Prashanti, et al.
Publicado: (2026)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
por: Dhar, Saurav, et al.
Publicado: (2024)

Fingerprint Filters Are Optimal
por: Kuszmaul, William, et al.
Publicado: (2025)

Optimal antimatroid sorting
por: Berendsohn, Benjamin Aram
Publicado: (2025)