Cover Image

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alpay, Faruk, Sarioglu, Levent
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms 68P05, 68P20, 68W20, 68P10 E.1; F.2.2; H.3.3
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
by: Alpay, Faruk, et al.
Published: (2026)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
by: Alpay, Faruk, et al.
Published: (2026)

Memento Filter: A Fast, Dynamic, and Robust Range Filter
by: Eslami, Navid, et al.
Published: (2024)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data
by: Prior, Morgan E., et al.
Published: (2023)

Mycelium-Index: A Streaming Approximate Nearest Neighbor Index with Myelial Edge Decay, Traffic-Driven Reinforcement, and Adaptive Living Hierarchy
by: Pakhunov, Anton
Published: (2026)

Huffman-Bucket Sketch: A Simple $O(m)$ Algorithm for Cardinality Estimation
by: Karppa, Matti
Published: (2026)

The Li-Chao Tree: Algorithm Specification and Analysis
by: Li, Chao
Published: (2026)

Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
by: Alpay, Faruk, et al.
Published: (2026)

CUBO: Self-Contained Retrieval-Augmented Generation on Consumer Laptops 10 GB Corpora, 16 GB RAM, Single-Device Deployment
by: Astrino, Paolo
Published: (2026)

XiSort: Deterministic Sorting via IEEE-754 Total Ordering and Entropy Minimization
by: Alpay, Faruk
Published: (2025)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
by: Shlyk, Vasiliy S.
Published: (2026)

A Reproducible, Scalable Pipeline for Synthesizing Autoregressive Model Literature
by: Alpay, Faruk, et al.
Published: (2025)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
by: Alpay, Faruk, et al.
Published: (2026)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Efficient $k$-NN Search in IoT Data: Overlap Optimization in Tree-Based Indexing Structures
by: Benrazek, Ala-Eddine, et al.
Published: (2024)

Competitive Data-Structure Dynamization
by: Mathieu, Claire, et al.
Published: (2020)

An innovative data collection method to eliminate the preprocessing phase in web usage mining
by: Canay, Ozkan, et al.
Published: (2025)

Ask Safely: Privacy-Aware LLM Query Generation for Knowledge Graphs
by: Tosi, Mauro Dalle Lucca, et al.
Published: (2025)

Generalized compression and compressive search of large datasets
by: Prior, Morgan E., et al.
Published: (2024)

Classification via Two-Way Comparisons
by: Chrobak, Marek, et al.
Published: (2023)

The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)

Heterogeneity in Entity Matching: A Survey and Experimental Analysis
by: Moslemi, Mohammad Hossein, et al.
Published: (2025)

New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage
by: Kong, Xiangliang, et al.
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

EnterpriseRAG-Bench: A RAG Benchmark for Company Internal Knowledge
by: Sun, Yuhong, et al.
Published: (2026)

Auditing Search Query Suggestion Bias Through Recursive Algorithm Interrogation
by: Haak, Fabian, et al.
Published: (2026)

A Replicability Study of XTR
by: Jha, Rohan, et al.
Published: (2026)

Supercharging Federated Intelligence Retrieval
by: Stripelis, Dimitris, et al.
Published: (2026)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
by: Swenson, Krister M.
Published: (2024)

Distributed Hybrid Sketching for $\ell_2$-Embeddings
by: Charalambides, Neophytos, et al.
Published: (2024)

PPSZ is better than you think
by: Scheder, Dominik
Published: (2022)

GLEAN: Grounded Lightweight Evaluation Anchors for Contamination-Aware Tabular Reasoning
by: Wang, Qizhi
Published: (2026)

Learning to Refine: An Agentic RL Approach for Iterative SPARQL Query Construction
by: Vossebeld, Floris, et al.
Published: (2025)

Closing the Performance Gap in Generative Recommenders with Collaborative Tokenization and Efficient Modeling
by: Lepage, Simon, et al.
Published: (2025)

A Question Answering Dataset for Temporal-Sensitive Retrieval-Augmented Generation
by: Chen, Ziyang, et al.
Published: (2025)

Efficient fine-tuning methodology of text embedding models for information retrieval: contrastive learning penalty (clp)
by: Yu, Jeongsu
Published: (2024)

From Unstructured Recall to Schema-Grounded Memory: Reliable AI Memory via Iterative, Schema-Aware Extraction
by: Petrov, Alex, et al.
Published: (2026)

ORPHEAS: A Cross-Lingual Greek-English Embedding Model for Retrieval-Augmented Generation
by: Livieris, Ioannis E., et al.
Published: (2026)