Imagen de Portada

History-Independent Load Balancing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bender, Michael A., Kuszmaul, William, Shi, Elaine, Silver, Rose
Formato:	Preprint
Publicado:	2026
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

Optimal Non-Oblivious Open Addressing
por: Bender, Michael A., et al.
Publicado: (2025)

Tight Bounds for Classical Open Addressing
por: Bender, Michael A., et al.
Publicado: (2024)

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
por: Kuszmaul, William, et al.
Publicado: (2025)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
por: Kuszmaul, William
Publicado: (2025)

Layered List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
por: Kuszmaul, William, et al.
Publicado: (2024)

The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
por: Kuszmaul, William, et al.
Publicado: (2021)

Tight Analyses of Ordered and Unordered Linear Probing
por: Braverman, Mark, et al.
Publicado: (2025)

Nearly Optimal List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

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)

A Nearly Quadratic Improvement for Memory Reallocation
por: Farach-Colton, Martin, et al.
Publicado: (2024)

Optimal Bounds for Open Addressing Without Reordering
por: Farach-Colton, Martin, et al.
Publicado: (2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
por: Kuszmaul, William, et al.
Publicado: (2024)

History-Independent Concurrent Hash Tables
por: Attiya, Hagit, et al.
Publicado: (2025)

Load Balancing with Duration Predictions
por: Azar, Yossi, et al.
Publicado: (2025)

Static Retrieval Revisited: To Optimality and Beyond
por: Hu, Yang, et al.
Publicado: (2025)

Preprocessed 3SUM for Unknown Universes with Subquadratic Space
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

Improved Online Load Balancing in the Two-Norm
por: Borst, Sander, et al.
Publicado: (2025)

Streaming and Communication Complexity of Load-Balancing via Matching Contractors
por: Assadi, Sepehr, et al.
Publicado: (2024)

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
por: Kesselheim, Thomas, et al.
Publicado: (2025)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
por: Blankenburg, Daniel, et al.
Publicado: (2025)

Time To Replace Your Filter: How Maplets Simplify System Design
por: Bender, Michael A., et al.
Publicado: (2025)

Online Load and Graph Balancing for Random Order Inputs
por: Im, Sungjin, et al.
Publicado: (2024)

Pairwise-Independent Contention Resolution
por: Gupta, Anupam, et al.
Publicado: (2024)

A Tolerant Independent Set Tester
por: Seth, Cameron
Publicado: (2025)

The Case for External Graph Sketching
por: Bender, Michael A., et al.
Publicado: (2025)

Fast and Compact Sketch-Based Dynamic Connectivity
por: De Man, Quinten, et al.
Publicado: (2025)

Improved Certificates for Independence Number in Semirandom Hypergraphs
por: Kothari, Pravesh, et al.
Publicado: (2026)

Optimal Neighborhood Exploration for Dynamic Independent Sets
por: Borowitz, Jannick, et al.
Publicado: (2024)

Limitations of Stochastic Selection with Pairwise Independent Priors
por: Dughmi, Shaddin, et al.
Publicado: (2023)

Strengths and Limitations of Greedy in Cup Games
por: Jasińska, Kalina, et al.
Publicado: (2026)

Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
por: Cardinal, Jean, et al.
Publicado: (2026)

Concurrent Balanced Augmented Trees
por: Wrench, Evan, et al.
Publicado: (2026)

Maximum Weight Independent Set in Hereditary Classes of Ordered Graphs
por: Bieliński, Paweł Rafał, et al.
Publicado: (2026)

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

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
por: Großmann, Ernestine, et al.
Publicado: (2026)

Sublinear Metric Steiner Forest via Maximal Independent Set
por: Mahabadi, Sepideh, et al.
Publicado: (2025)

Finding Triangles or Independent Sets; and Other Dual Pair Approximations
por: Dumitrescu, Adrian
Publicado: (2021)

Enumerating Graphlets with Amortized Time Complexity Independent of Graph Size
por: Conte, Alessio, et al.
Publicado: (2024)