cs.DC

Papers

• Valori: A Deterministic Memory Substrate for AI Systems (2025)
  Varshith Gudur
  8.42
• SQUASH: Serverless and Distributed Quantization-based Attributed Vector Similarity Search (2025)
  Joe Oakley et al.
  4.52
• Semantica: Decentralized Search using a LLM-Guided Semantic Tree Overlay (2025)
  Petru Neague et al.
  3.58
• PI : a Parallel in-memory skip list based Index (2016)
  Zhongle Xie et al.
  —
• A Generic Inverted Index Framework for Similarity Search on the GPU - Technical Report (2018)
  Jingbo Zhou et al.
  —
• Improving Raw Image Storage Efficiency by Exploiting Similarity (2016)
  Binqi Zhang et al.
  —
• Computing Web-scale Topic Models using an Asynchronous Parameter Server (2017)
  Rolf Jagerman et al.
  —
• Scalable Construction of Text Indexes (2016)
  Timo Bingmann et al.
  —
• A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs (2017)
  Elias Stehle et al.
  —
• Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube (2016)
  Paul Beame and Cyrus Rashtchian
  —
• PAM: Parallel Augmented Maps (2018)
  Yihan Sun and Daniel Ferizovic and Guy E. Blelloch
  —
• Partitioning, Indexing and Querying Spatial Data on Cloud (2016)
  Afsin Akdogan
  —
• Distributed Evolutionary k-way Node Separators (2017)
  Peter Sanders et al.
  —
• Better Process Mapping and Sparse Quadratic Assignment (2019)
  Christian Schulz and Jesper Larsson Tr\"aff and Konrad von Kirchbach
  —
• Even faster sorting of (not only) integers (2017)
  Marek Kokot and Sebastian Deorowicz and Maciej Dlugosz
  —
• An analysis of budgeted parallel search on conditional Galton-Watson trees (2019)
  David Avis and Luc Devroye
  —
• Optimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches (2017)
  Julian Romera
  —
• Linearizable Iterators for Concurrent Sets (2018)
  Archita Agarwal et al.
  —
• Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner (2017)
  Igor Kabiljo and Brian Karrer and Mayank Pundir and Sergey Pupyrev and Alon Shalita and Alessandro Presta and Yaroslav Akhremtsev
  —
• Tail-Tolerant Distributed Search (2017)
  Naama Kraus et al.
  —
• SOCRATES: A System For Scalable Graph Analytics (2017)
  Cetin Savkli et al.
  —
• Faster Concurrent Range Queries with Contention Adapting Search Trees Using Immutable Data (2017)
  Kjell Winblad
  —
• FLASH: Randomized Algorithms Accelerated over CPU-GPU for Ultra-High Dimensional Similarity Search (2018)
  Yiqiu Wang et al.
  —
• A distributed system for SearchOnMath based on the Microsoft BizSpark program (2018)
  Ricardo M. Oliveira et al.
  —
• A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization (2017)
  Yang Yang et al.
  —
• A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search (2017)
  Alexander Ponomarenko et al.
  —
• Onion Curve: A Space Filling Curve with Near-Optimal Clustering (2018)
  Pan Xu et al.
  —
• Recurrent Binary Embedding for GPU-Enabled Exhaustive Retrieval from Billion-Scale Semantic Vectors (2018)
  Ying Shan and Jian Jiao and Jie Zhu and JC Mao
  —
• ILP-based Local Search for Graph Partitioning (2018)
  Alexandra Henzinger et al.
  —
• Scalable Breadth-First Search on a GPU Cluster (2018)
  Yuechao Pan et al.
  —
• GPU Accelerated Self-join for the Distance Similarity Metric (2018)
  Michael Gowanlock et al.
  —
• A Modular Design for Geo-Distributed Querying (2018)
  Dimitrios Vasilas (LIP6 et al.
  —
• Parallel Working-Set Search Structures (2018)
  Kunal Agrawal et al.
  —
• Fast Locality Sensitive Hashing for Beam Search on GPU (2018)
  Xing Shi et al.
  —
• Privacy-Preserving Identification via Layered Sparse Code Design: Distributed Servers and Multiple Access Authorization (2018)
  Behrooz Razeghi et al.
  —
• Tune: A Research Platform for Distributed Model Selection and Training (2018)
  Richard Liaw et al.
  —
• An optimized Parallel Failure-less Aho-Corasick algorithm for DNA sequence matching (2018)
  Vajira Thambawita and Roshan G. Ragel and Dhammike Elkaduwe
  —
• Speeding-up the Verification Phase of Set Similarity Joins in the GPGPU paradigm (2018)
  Christos Bellas and Anastasios Gounaris
  —
• A Distributed and Approximated Nearest Neighbors Algorithm for an Efficient Large Scale Mean Shift Clustering (2022)
  Ga\"el Beck et al.
  —
• Low-Latency Graph Streaming Using Compressed Purely-Functional Trees (2019)
  Laxman Dhulipala et al.
  —
• A graphical heuristic for reduction and partitioning of large datasets for scalable supervised training (2019)
  Sumedh Yadav and Mathis Bode
  —
• Parallel Finger Search Structures (2019)
  Seth Gilbert et al.
  —
• Efficient Lock-Free Durable Sets (2019)
  Yoav Zuriel et al.
  —
• Finding Neighbors in a Forest: A b-tree for Smoothed Particle Hydrodynamics Simulations (2020)
  Aur\'elien Cavelan et al.
  —
• Lock-Free Hopscotch Hashing (2019)
  Robert Kelly et al.
  —
• Age-Partitioned Bloom Filters (2020)
  Ariel Shtul and Carlos Baquero and Paulo S\'ergio Almeida
  —
• A Prototype of Serverless Lucene (2020)
  Jimmy Lin
  —
• LSF-Join: Locality Sensitive Filtering for Distributed All-Pairs Set Similarity Under Skew (2020)
  Cyrus Rashtchian et al.
  —
• A1: A Distributed In-Memory Graph Database (2020)
  Chiranjeeb Buragohain et al.
  —
• Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising (2020)
  Xiaotian Hao et al.
  —