5 papers
Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
Faruk Alpay, Levent Sarioglu
We study a list-constrained extension of modular equation deletion over powers of two, called Coset-List Min-2-Lin over . Each variable is restric…
Algorithmic Barriers to Detecting and Repairing Structural Overspecification in Adaptive Data-Structure Selection
Faruk Alpay, Levent Sarioglu
We study algorithmic barriers to detecting and repairing a systematic form of structural overspecification in adaptive data-structure selection. An input instance induces an implie…
Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
Faruk Alpay, Levent Sarioglu
We study the problem of grammar-constrained context-free language reachability in graphs, focusing on complexity and empirical performance. We present an algorithmic framework for…
Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
Faruk Alpay, Levent Sarioglu
We present three algorithms with formal correctness guarantees and complexity bounds for the problem of selecting a diverse, multi-locale set of sources from ranked search results.…
Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
Faruk Alpay, Levent Sarioglu
Random access remains a central bottleneck in DNA-based data storage. Existing systems typically retrieve records by PCR enrichment or other multi-step biochemical procedures, whic…