:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Guo, Anxin, Li, Jingwei, Sukprasert, Pattara, Khuller, Samir, Deshpande, Amol, Mukherjee, Koyel
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Computational Complexity Databases Distributed, Parallel, and Cluster Computing
Online Access:	https://arxiv.org/abs/2402.11741
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Finding a Fair Scoring Function for Top-$k$ Selection: From Hardness to Practice
by: Cai, Guangya
Published: (2025)

Access Control for Information-Theoretically Secure Key-Document Stores
by: Li, Yin, et al.
Published: (2025)

Distributed Triangle Detection is Hard in Few Rounds
by: Assadi, Sepehr, et al.
Published: (2025)

It's Hard to HAC with Average Linkage!
by: Bateni, MohammadHossein, et al.
Published: (2024)

Segmented Operations using Matrix Multiplications
by: Sobczyk, Aleksandros, et al.
Published: (2025)

Parallel Hierarchical Agglomerative Clustering in Low Dimensions
by: Bateni, MohammadHossein, et al.
Published: (2025)

Testing Spreading Behavior in Networks with Arbitrary Topologies
by: Modanese, Augusto, et al.
Published: (2023)

Work-Efficient Parallel Counting via Sampling
by: Liu, Hongyang, et al.
Published: (2024)

Harmonic Decomposition in Data Sketches
by: Wang, Dingyu
Published: (2024)

JumpBackHash: Say Goodbye to the Modulo Operation to Distribute Keys Uniformly to Buckets
by: Ertl, Otmar
Published: (2024)

Towards Scalable and Practical Batch-Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2024)

Auditable Shared Objects: From Registers to Synchronization Primitives
by: Attiya, Hagit, et al.
Published: (2025)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
by: Kreis, Lara, et al.
Published: (2026)

$O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN
by: Gan, Junhao, et al.
Published: (2025)

Model-Agnostic Approximation of Constrained Forest Problems
by: Coupette, Corinna, et al.
Published: (2024)

Setchain Algorithms for Blockchain Scalability
by: Karmegam, Arivarasan, et al.
Published: (2025)

Parallel $k$d-tree with Batch Updates
by: Men, Ziyang, et al.
Published: (2024)

Parallel Two-Stage Approach for Joint Symbolic Approximation of Time Series
by: Chen, Xinye
Published: (2023)

A parallel algorithm for the odd two-face shortest k-disjoint path problem
by: Chakraborty, Srijan, et al.
Published: (2025)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
by: Zhang, Ziyu, et al.
Published: (2025)

TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge Graphs
by: Dhulipala, Laxman, et al.
Published: (2023)

FliX: Flipped-Indexing for Scalable GPU Queries and Updates
by: Kharal, Rosina, et al.
Published: (2026)

CIDER: Boosting Memory-Disaggregated Key-Value Stores with Pessimistic Synchronization
by: Du, Yuxuan, et al.
Published: (2026)

A Fault-Tolerant Version of Safra's Termination Detection Algorithm
by: Fokkink, Wan, et al.
Published: (2026)

Employ SmartNICs' Data Path Accelerators for Ordered Key-Value Stores
by: Schimmelpfennig, Frederic, et al.
Published: (2026)

Next Generation Cloud-native In-Memory Stores: From Redis to Valkey and Beyond
by: Rosensch"old, Carl-Johan Fauvelle Munck af, et al.
Published: (2025)

Nezha: A Key-Value Separated Distributed Store with Optimized Raft Integration
by: Wang, Yangyang, et al.
Published: (2026)

TierBase: A Workload-Driven Cost-Optimized Key-Value Store
by: Shen, Zhitao, et al.
Published: (2025)

Keigo: Co-designing Log-Structured Merge Key-Value Stores with a Non-Volatile, Concurrency-aware Storage Hierarchy (Extended Version)
by: Adão, Rúben, et al.
Published: (2025)

Flock: A Low-Cost Streaming Query Engine on FaaS Platforms
by: Liao, Gang, et al.
Published: (2023)

Optimal local certification on graphs of bounded pathwidth
by: Baterisna, Dan Alden, et al.
Published: (2025)

PolarStore: High-Performance Data Compression for Large-Scale Cloud-Native Databases
by: Hu, Qingda, et al.
Published: (2025)

LatentBox: Storing AI-Generated Images at Scale via a Latent-First Design
by: Wang, Zirui, et al.
Published: (2026)

New Concurrent Order Maintenance Data Structure
by: Guo, Bin, et al.
Published: (2022)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
by: Lingas, Andrzej
Published: (2026)

On the Effectiveness of Graph Reordering for Accelerating Approximate Nearest Neighbor Search on GPU
by: Oguri, Yutaro, et al.
Published: (2025)

CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs
by: Ootomo, Hiroyuki, et al.
Published: (2023)

Efficient Dynamic MaxFlow Computation on GPUs
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)

Towards Optimal Distributed Edge Coloring with Fewer Colors
by: Jakob, Manuel, et al.
Published: (2025)