:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Liang, Ya-Chun, Li, Meng-Hsi, Liao, Chung-Shou, Stein, Clifford
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2507.12822
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Waiting is not easy but worth it: the online TSP on the line revisited
por: Chen, Pei-Chuan, et al.
Publicado: (2019)

Learning-Augmented Online Packet Scheduling with Deadlines
por: Liang, Ya-Chun, et al.
Publicado: (2023)

A Competitive Algorithm for Throughput Maximization on Identical Machines
por: Moseley, Benjamin, et al.
Publicado: (2021)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
por: Clifford, Peter, et al.
Publicado: (2026)

Asymptotically Robust Learning-Augmented Algorithms for Preemptive FIFO Buffer Management
por: Hsieh, Wen-Han, et al.
Publicado: (2026)

Energy-Efficient Scheduling with Predictions
por: Balkanski, Eric, et al.
Publicado: (2024)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Scheduling with Obligatory Tests
por: Dogeas, Konstantinos, et al.
Publicado: (2024)

Drawing Competitive Districts in Redistricting
por: Chuang, Gabriel, et al.
Publicado: (2024)

An Empirical Study of Online Packet Scheduling Algorithms
por: Sakr, Nourhan, et al.
Publicado: (2016)

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
por: Pan, Yueyang, et al.
Publicado: (2025)

Scalable and Provable Kemeny Constant Computation on Static and Dynamic Graphs: A 2-Forest Sampling Approach
por: Li, Cheng, et al.
Publicado: (2025)

A Simple Algorithm for Dynamic Carpooling with Recourse
por: Efron, Yuval, et al.
Publicado: (2024)

Learning Partitions using Rank Queries
por: Chakrabarty, Deeparnab, et al.
Publicado: (2024)

Improved Algorithms for Effective Resistance Computation on Graphs
por: Yang, Yichun, et al.
Publicado: (2025)

A short note about the learning-augmented secretary problem
por: Choo, Davin, et al.
Publicado: (2024)

Submodular Maximization in Exactly $n$ Queries
por: Balkanski, Eric, et al.
Publicado: (2024)

Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
por: Huang, Chien-Chung, et al.
Publicado: (2026)

Root-to-Leaf Scheduling in Write-Optimized Trees
por: Chung, Christopher, et al.
Publicado: (2024)

Thinning to improve two-sample discrepancy
por: Smirnov, Gleb, et al.
Publicado: (2025)

An improved spectral lower bound of treewidth
por: Gima, Tatsuya, et al.
Publicado: (2024)

An improvement of degree-based hashing (DBH) graph partition method, using a novel metric
por: Mastikhina, Anna, et al.
Publicado: (2024)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
por: Chen, Yong, et al.
Publicado: (2025)

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

Socio-Spatial Group Queries for Impromptu Activity Planning
por: Shen, Chih-Ya, et al.
Publicado: (2015)

Non-adaptive Bellman-Ford: Yen's improvement is optimal
por: Hu, Jialu, et al.
Publicado: (2024)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
por: Meng, Lingkai, et al.
Publicado: (2024)

Compressed Set Representations based on Set Difference
por: Gagie, Travis, et al.
Publicado: (2026)

Ruler Rolling
por: Lyu, Xing, et al.
Publicado: (2022)

How fast can you find a good hypothesis?
por: Aamand, Anders, et al.
Publicado: (2025)

Optimal Static Fully Indexable Dictionaries
por: Liang, Jingxun, et al.
Publicado: (2025)

Approximation Schemes for Sequential Hiring Problems
por: Segev, Danny, et al.
Publicado: (2026)

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

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
por: Kuszmaul, William, et al.
Publicado: (2025)

Efficient Streaming Algorithms for Two-Dimensional Congruence Testing and Geometric Hashing
por: Chang, Yen-Cheng, et al.
Publicado: (2026)

Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition
por: Zhou, Tianshuo, et al.
Publicado: (2026)

PSSketch: Finding Persistent and Sparse Flow with High Accuracy and Efficiency
por: Wang, Jiayao, et al.
Publicado: (2025)

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
por: Chen, Ho-Lin, et al.
Publicado: (2026)

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

Conjugate queries can help
por: Tang, Ewin, et al.
Publicado: (2025)