:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Scala, Alessandro
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing E.1
Online Access:	https://arxiv.org/abs/2401.10118
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

How to Relax Instantly: Elastic Relaxation of Concurrent Data Structures
by: von Geijer, Kåre, et al.
Published: (2024)

BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
by: Coluzzi, Massimo, et al.
Published: (2024)

Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations
by: Haeupler, Bernhard, et al.
Published: (2025)

DISTRIBUTEDANN: Efficient Scaling of a Single DISKANN Graph Across Thousands of Computers
by: Adams, Philip, et al.
Published: (2025)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
by: Bui, Hong Duc, et al.
Published: (2024)

On Distributed Computation of the Minimum Triangle Edge Transversal
by: Censor-Hillel, Keren, et al.
Published: (2024)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
by: Yang, Mingqi
Published: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
by: Wang, Letong, et al.
Published: (2024)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
by: Hsieh, Chou-Ying, et al.
Published: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
by: Liu, Quanquan C., et al.
Published: (2024)

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
by: Prokopenko, Andrey, et al.
Published: (2024)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
by: Pourdamghani, Arash, et al.
Published: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
by: Ghaffari, Mohsen, et al.
Published: (2024)

Parallel Integer Sort: Theory and Practice
by: Dong, Xiaojun, et al.
Published: (2024)

Multi-Agent Online Graph Exploration on Cycles and Tadpole Graphs
by: Akker, Erik van den, et al.
Published: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
by: Chang, Yi-Jun, et al.
Published: (2024)

Slipstream: Ebb-and-Flow Consensus on a DAG with Fast Confirmation for UTXO Transactions
by: Polyanskii, Nikita, 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)

Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)

Dynamic Maximal Matching in Clique Networks
by: Li, Minming, et al.
Published: (2024)

Massively Parallel Ruling Set Made Deterministic
by: Giliberti, Jeff, et al.
Published: (2024)

The Blocklace: A Byzantine-repelling and Universal Conflict-free Replicated Data Type
by: Almeida, Paulo Sérgio, et al.
Published: (2024)

Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
by: Sanders, Peter, et al.
Published: (2024)

Efficient Enumeration of Large Maximal k-Plexes
by: Cheng, Qihao, et al.
Published: (2024)

Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs
by: Gil, Yuval
Published: (2024)

Deterministic Expander Routing: Faster and More Versatile
by: Chang, Yi-Jun, et al.
Published: (2024)

Distributed Lovász Local Lemma under Bandwidth Limitations
by: Halldórsson, Magnús M., et al.
Published: (2024)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
by: Bai, Sirui, et al.
Published: (2024)

History Trees and Their Applications
by: Viglietta, Giovanni
Published: (2024)

Adaptive Massively Parallel Coloring in Sparse Graphs
by: Latypov, Rustam, et al.
Published: (2024)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)

Distributed Download from an External Data Source in Faulty Majority Settings
by: Augustine, John, et al.
Published: (2024)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
by: Wan, Zijin, et al.
Published: (2024)

Massively Parallel Algorithms for Approximate Shortest Paths
by: Dory, Michal, et al.
Published: (2024)

Round and Communication Efficient Graph Coloring
by: Chang, Yi-Jun, et al.
Published: (2024)

Global certification via perfect hashing
by: Bousquet, Nicolas, et al.
Published: (2024)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
by: Liu, Quanquan C., et al.
Published: (2024)

Content-Oblivious Leader Election on Rings
by: Frei, Fabian, et al.
Published: (2024)

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

Sorting in One and Two Rounds using $t$-Comparators
by: Gelles, Ran, et al.
Published: (2024)