Imagen de Portada

Latency Guarantees for Caching with Delayed Hits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gurushankar, Keerthana, Singer, Noah G., Subercaseaux, Bernardo
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

Nine lower bound conjectures on streaming approximation algorithms for CSPs
por: Singer, Noah G.
Publicado: (2025)

Oblivious Algorithms for Maximum Directed Cut: New Upper and Lower Bounds
por: Hwang, Samuel, et al.
Publicado: (2024)

Asymptotically Smaller Encodings for Graph Problems and Scheduling
por: Subercaseaux, Bernardo
Publicado: (2025)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
por: Saxena, Raghuvansh R., et al.
Publicado: (2024)

Estimating Hitting Times Locally At Scale
por: Haris, Themistoklis, et al.
Publicado: (2025)

Subexponential Parameterized Algorithms for Hitting Subgraphs
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Sketching approximations and LP approximations for finite CSPs are related
por: Singer, Noah G., et al.
Publicado: (2025)

Optimal Single-Pass Streaming Lower Bounds for Approximating CSPs
por: Singer, Noah G., et al.
Publicado: (2026)

Streaming approximation resistance of every ordering CSP
por: Singer, Noah G., et al.
Publicado: (2021)

A Refined Kernel for $d$-Hitting Set
por: Liu, Yuxi, et al.
Publicado: (2025)

Hitting Geodesic Intervals in Structurally Restricted Graphs
por: Gima, Tatsuya, et al.
Publicado: (2025)

On Fair Epsilon Net and Geometric Hitting Set
por: Dehghankar, Mohsen, et al.
Publicado: (2025)

Faster parameterized algorithm for 3-Hitting Set
por: Tsur, Dekel
Publicado: (2025)

Hitting Meets Packing: How Hard Can it Be?
por: Focke, Jacob, et al.
Publicado: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
por: Ihalainen, Hannes, et al.
Publicado: (2025)

Optimal and Efficient Partite Decompositions of Hypergraphs
por: Krapivin, Andrew, et al.
Publicado: (2025)

Enumeration of Minimal Hitting Sets Parameterized by Treewidth
por: Kenig, Batya, et al.
Publicado: (2024)

Caching Connections in Matchings
por: Sadeh, Yaniv, et al.
Publicado: (2023)

Streaming Complexity Separations for Dense and Sparse Graphs
por: Liu, Yang P., et al.
Publicado: (2026)

Deterministic Cache-Oblivious Funnelselect
por: Brodal, Gerth Stølting, et al.
Publicado: (2024)

Dependency-Aware Online Caching
por: Dallot, Julien, et al.
Publicado: (2024)

Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
por: Sharma, Roohani, et al.
Publicado: (2026)

The Probability to Hit Every Bin with a Linear Number of Balls
por: Walzer, Stefan
Publicado: (2024)

A simple $(2+ε)$-approximation for knapsack interdiction
por: Weninger, Noah
Publicado: (2026)

LLM Query Scheduling with Prefix Reuse and Latency Constraints
por: Dexter, Gregory, et al.
Publicado: (2025)

New Approximation Guarantees for The Inventory Staggering Problem
por: Alon, Noga, et al.
Publicado: (2025)

An Optimal Algorithm for Half-plane Hitting Set
por: Liu, Gang, et al.
Publicado: (2025)

Minimum-Weight Half-Plane Hitting Set
por: Liu, Gang, et al.
Publicado: (2025)

Hitting Axis-Parallel Segments with Weighted Points
por: Raman, Rajiv, et al.
Publicado: (2026)

PackIt! Gamified Rectangle Packing
por: Garrison, Thomas, et al.
Publicado: (2024)

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
por: Zhao, Jingyang, et al.
Publicado: (2023)

Subsetwise and Multi-Level Additive Spanners with Lightness Guarantees
por: Ahmed, Reyan, et al.
Publicado: (2024)

Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference
por: Feng, Yiding, et al.
Publicado: (2026)

Knapsack with Vertex Cover, Set Cover, and Hitting Set
por: Dey, Palash, et al.
Publicado: (2024)

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

Sample and Expand: Discovering Low-rank Submatrices With Quality Guarantees
por: Ciaperoni, Martino, et al.
Publicado: (2025)

Fast Construction of Partitioned Learned Bloom Filter with Theoretical Guarantees
por: Sato, Atsuki, et al.
Publicado: (2024)

List Update with Delays or Time Windows
por: Azar, Yossi, et al.
Publicado: (2023)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
por: Chen, Chi-Yeh
Publicado: (2025)