Data Structures

Arctic: A Practical Lock-Free Adaptive Radix Tree OSDI 2026 Counting and Sampling Subsets Using Block Covers UAI 2026 PlanB: Efficient Software IPv6 Lookup with Linearized B+-Tree NSDI 2026 Dynamic DBSCAN with Euler Tour Sequences AISTATS 2025 Dynamic Maintenance of Kernel Density Estimation Data Structure: From Practice to Theory UAI 2025 Efficient Image Similarity Search with Quadtrees (Student Abstract) AAAI 2025 On the Power of Learning-Augmented Search Trees ICML 2025 Approximate Distance Oracle for Fault-Tolerant Geometric Spanners AAAI 2024 Building a Broad Infrastructure for Uniform Meaning Representations COLING 2024 Mayfly: a Neural Data Structure for Graph Stream Summarization ICLR 2024 Memory-Efficient Sequential Pattern Mining with Hybrid Tries JMLR 2024 OmniSDF: Scene Reconstruction using Omnidirectional Signed Distance Functions and Adaptive Binoctrees CVPR 2024 Simplified Chinese Character Distance Based on Ideographic Description Sequences COLING 2024 The Swedish Parliament Corpus 1867 – 2022 COLING 2024 Unmasking Vulnerabilities: Cardinality Sketches under Adaptive Inputs ICML 2024 Back to Patterns: Efficient Japanese Morphological Analysis with Feature-Sequence Trie ACL 2023 Meta-Sketch: A Neural Data Structure for Estimating Item Frequencies of Data Streams AAAI 2023 NCDL: A Framework for Deep Learning on non-Cartesian Lattices NeurIPS 2023 On Distribution Dependent Sub-Logarithmic Query Time of Learned Indexing ICML 2023 Online List Labeling with Predictions NeurIPS 2023 SOAR: Improved Indexing for Approximate Nearest Neighbor Search NeurIPS 2023 VBASE: Unifying Online Vector Similarity Search and Relational Queries via Relaxed Monotonicity OSDI 2023 Learning Augmented Binary Search Trees ICML 2022 ListDB: Union of Write-Ahead Logs and Persistent SkipLists for Incremental Checkpointing on Persistent Memory OSDI 2022 Occualizer: Optimistic Concurrent Search Trees From Sequential Code OSDI 2022