Long-term balanced allocation via thinning
Fuente:
arXiv
Saved in:
| Main Authors: | Feldheim, Ohad N., Gurel-Gurevich, Ori, Li, Jiange |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the Locality of the Lovász Local Lemma
by: Davies-Peck, Peter
Published: (2025)
by: Davies-Peck, Peter
Published: (2025)
Balls and Bins and the Infinite Process with Random Deletions
by: Berenbrink, Petra, et al.
Published: (2025)
by: Berenbrink, Petra, et al.
Published: (2025)
Parallel Sampling via Autospeculation
by: Anari, Nima, et al.
Published: (2025)
by: Anari, Nima, et al.
Published: (2025)
Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024)
by: Hsieh, Chou-Ying, et al.
Published: (2024)
Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
by: Ngo, Vinh Quang, et al.
Published: (2024)
by: Ngo, Vinh Quang, et al.
Published: (2024)
A Randomised Approach to Distributed Sorting
by: Olesker-Taylor, Sam
Published: (2025)
by: Olesker-Taylor, Sam
Published: (2025)
Global certification via perfect hashing
by: Bousquet, Nicolas, et al.
Published: (2024)
by: Bousquet, Nicolas, et al.
Published: (2024)
Distributed Santa Claus via Global Rounding
by: de Vos, Tijn, et al.
Published: (2026)
by: de Vos, Tijn, et al.
Published: (2026)
Min-Max Correlation Clustering via Neighborhood Similarity
by: Cao, Nairen, et al.
Published: (2025)
by: Cao, Nairen, et al.
Published: (2025)
Faster Distributed $Δ$-Coloring via Ruling Subgraphs
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Faster Distributed $Δ$-Coloring via a Reduction to MIS
by: Bourreau, Yann, et al.
Published: (2025)
by: Bourreau, Yann, et al.
Published: (2025)
Parallel Set Cover and Hypergraph Matching via Uniform Random Sampling
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
by: Khoury, Seri, et al.
Published: (2025)
by: Khoury, Seri, et al.
Published: (2025)
Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
by: Elkin, Michael, et al.
Published: (2025)
by: Elkin, Michael, et al.
Published: (2025)
Fully-Dynamic Parallel Algorithms for Single-Linkage Clustering
by: De Man, Quinten, et al.
Published: (2025)
by: De Man, Quinten, et al.
Published: (2025)
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
by: Chang, Yi-Jun, et al.
Published: (2022)
by: Chang, Yi-Jun, et al.
Published: (2022)
Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
by: Censor-Hillel, Keren, et al.
Published: (2023)
by: Censor-Hillel, Keren, et al.
Published: (2023)
Optimal Parallel Algorithms for Dendrogram Computation and Single-Linkage Clustering
by: Dhulipala, Laxman, et al.
Published: (2024)
by: Dhulipala, Laxman, et al.
Published: (2024)
Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)
by: Li, Minming, et al.
Published: (2024)
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)
by: Li, Qian, et al.
Published: (2024)
Designing Parallel Algorithms for Community Detection using Arachne
by: Li, Fuhuan, et al.
Published: (2025)
by: Li, Fuhuan, et al.
Published: (2025)
Parallel Point-to-Point Shortest Paths and Batch Queries
by: Dong, Xiaojun, et al.
Published: (2025)
by: Dong, Xiaojun, et al.
Published: (2025)
Online Load and Graph Balancing for Random Order Inputs
by: Im, Sungjin, et al.
Published: (2024)
by: Im, Sungjin, et al.
Published: (2024)
Memory Bounds for Concurrent Bounded Queues
by: Aksenov, Vitaly, et al.
Published: (2021)
by: Aksenov, Vitaly, et al.
Published: (2021)
Efficient Dynamic MaxFlow Computation on GPUs
by: Kannappan, Shruthi, et al.
Published: (2025)
by: Kannappan, Shruthi, et al.
Published: (2025)
Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)
by: Blin, Lelia, et al.
Published: (2026)
Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)
by: Jakob, Manuel, et al.
Published: (2025)
Perfect Matching with Few Link Activations
by: Mirault, Hugo, et al.
Published: (2025)
by: Mirault, Hugo, et al.
Published: (2025)
Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
by: Ghaffari, Mohsen, et al.
Published: (2025)
by: Ghaffari, Mohsen, et al.
Published: (2025)
Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
by: Feist, Dankrad, et al.
Published: (2025)
by: Feist, Dankrad, et al.
Published: (2025)
New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)
by: Gil, Yuval, et al.
Published: (2025)
WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
by: McCoy, Hunter, et al.
Published: (2025)
by: McCoy, Hunter, et al.
Published: (2025)
Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)
by: Bui, Hong Duc, et al.
Published: (2024)
A Scalable and Unified Framework to Weighted Rank Aggregation
by: Carmel, Amir, et al.
Published: (2026)
by: Carmel, Amir, et al.
Published: (2026)
FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
by: Dang'ana, Michael
Published: (2026)
by: Dang'ana, Michael
Published: (2026)
On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)
by: Censor-Hillel, Keren, et al.
Published: (2024)
Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
by: Baumecker, Malte, et al.
Published: (2025)
by: Baumecker, Malte, et al.
Published: (2025)
Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
by: Yang, Mingqi
Published: (2024)
by: Yang, Mingqi
Published: (2024)
Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)
by: Wang, Letong, et al.
Published: (2024)
HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
by: Dindoost, Mohammad, et al.
Published: (2025)
by: Dindoost, Mohammad, et al.
Published: (2025)
Similar Items
-
On the Locality of the Lovász Local Lemma
by: Davies-Peck, Peter
Published: (2025) -
Balls and Bins and the Infinite Process with Random Deletions
by: Berenbrink, Petra, et al.
Published: (2025) -
Parallel Sampling via Autospeculation
by: Anari, Nima, et al.
Published: (2025) -
Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024) -
Cuckoo Heavy Keeper and the balancing act of maintaining heavy hitters in stream processing
by: Ngo, Vinh Quang, et al.
Published: (2024)