cs.PF

Papers

• Cheesemap: A High-Performance Point-Indexing Data Structure for Neighbor Search in LiDAR Data (2025)
  Ruben Laso et al.
  0.00
• Sorting Data on Ultra-Large Scale with RADULS. New Incarnation of Radix Sort (2016)
  Marek Kokot et al.
  —
• Optimizing Communication by Compression for Multi-GPU Scalable Breadth-First Searches (2017)
  Julian Romera
  —
• Accelerated Nearest Neighbor Search with Quick ADC (2017)
  Fabien Andr\'e (Technicolor) and Anne-Marie Kermarrec (Inria) and Nicolas Le Scouarnec (Technicolor)
  —
• 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.
  —
• Exploiting Modern Hardware for High-Dimensional Nearest Neighbor Search (2017)
  Fabien Andr\'e
  —
• Zoom: SSD-based Vector Search for Optimizing Accuracy, Latency and Memory (2018)
  Minjia Zhang et al.
  —
• An optimized Parallel Failure-less Aho-Corasick algorithm for DNA sequence matching (2018)
  Vajira Thambawita and Roshan G. Ragel and Dhammike Elkaduwe
  —
• Quicker ADC : Unlocking the hidden potential of Product Quantization with SIMD (2019)
  Fabien Andr\'e et al.
  —
• Efficient Lock-Free Durable Sets (2019)
  Yoav Zuriel et al.
  —
• On the Reproducibility of Experiments of Indexing Repetitive Document Collections (2019)
  Antonio Fari\~na and Miguel A. Mart\'inez-Prieto and Francisco Claude and Gonzalo Navarro and Juan J. Lastra-D\'iaz and Nicola Prezza and Diego Seco
  —
• ProTuner: Tuning Programs with Monte Carlo Tree Search (2020)
  Ameer Haj-Ali et al.
  —
• A Streaming Approach For Efficient Batched Beam Search (2021)
  Kevin Yang et al.
  —
• A Full-Stack Search Technique for Domain Optimized Deep Learning Accelerators (2022)
  Dan Zhang et al.
  —
• GSGP-CUDA -- a CUDA framework for Geometric Semantic Genetic Programming (2021)
  Leonardo Trujillo et al.
  —
• Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search (2022)
  Harsha Vardhan Simhadri et al.
  —
• TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s (2022)
  Felix Chern et al.
  —
• HiStore: Rethinking Hybrid Index in RDMA-based Key-Value Store (2022)
  Shukai Han and Mi Zhang and Dejun Jiang and Jin Xiong
  —
• PIM-tree: A Skew-resistant Index for Processing-in-Memory (2022)
  Hongbo Kang et al.
  —
• RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search (2023)
  Vani Nagarajan et al.
  —
• Minuet: Accelerating 3D Sparse Convolutions on GPUs (2024)
  Jiacheng Yang et al.
  —
• Implementing and Evaluating E2LSH on Storage (2024)
  Yu Nakanishi et al.
  —
• VDTuner: Automated Performance Tuning for Vector Data Management Systems (2024)
  Tiannuo Yang et al.
  —
• Efficient $k$-NN Search in IoT Data: Overlap Optimization in Tree-Based Indexing Structures (2024)
  Ala-Eddine Benrazek et al.
  —
• VectorSearch: Enhancing Document Retrieval with Semantic Embeddings and Optimized Search (2024)
  Solmaz Seyed Monir et al.
  —
• Results of the Big ANN: NeurIPS'23 competition (2024)
  Harsha Vardhan Simhadri et al.
  —
• Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices (2024)
  Ali Ganbarov et al.
  —
• Automating Energy-Efficient GPU Kernel Generation: A Fast Search-Based Compilation Approach (2024)
  Yijia Zhang et al.
  —
• Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art (2025)
  Ilias Azizi et al.
  —
• Leveraging Approximate Caching for Faster Retrieval-Augmented Generation (2025)
  Shai Bergman et al.
  —
• FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update (2025)
  Yuan Chen et al.
  —
• PHast -- Perfect Hashing made fast (2025)
  Piotr Beling et al.
  —
• JSPIM: A Skew-Aware PIM Accelerator for High-Performance Databases Join and Select Operations (2025)
  Sabiha Tajdari et al.
  —
• Toward Efficient and Scalable Design of In-Memory Graph-Based Vector Search (2025)
  Ilias Azizi et al.
  —
• DCC: Data-Centric Compilation of Machine Learning Kernels for Processing-In-Memory Architectures (2026)
  Peiming Yang et al.
  —
• bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers (2026)
  Benjam\'in Guzm\'an
  —
• An Uncertainty-Aware Resilience Micro-Agent for Causal Observability in the Computing Continuum (2026)
  Suvi De Silva et al.
  —
• Energy per Successful Goal: Goal-Level Energy Accounting for Agentic AI Systems (2026)
  Deepak Panigrahy et al.
  —
• ModeSwitch-LLM: A Lightweight Phase-Aware Controller for Cross-Mode LLM Inference on a Single GPU (2026)
  Aman Sunesh et al.
  —
• Cost-Effective Model Evaluation with Meta-Learning (2026)
  Trinh Pham et al.
  —
• The Model Parking Tax: Quantifying the Hidden Energy Cost of Always-On GPU Model Deployment (2026)
  Sai Sathvik Vadari
  —
• Virtual-Memory Powersort (2026)
  Finn Moltmann et al.
  —
• TC-MIS: Maximal Independent Set on Tensor-cores (2026)
  Prajjwal Nijhara et al.
  —
• MarginGate: Sparse Margin-Triggered Verification for Batch-Invariant LLM Inference (2026)
  Kexin Chu et al.
  —