18 papers
Pattern-Derived Visual Swarm Games: Multi-Scale Drone-Vision States for Interception and Sustainability Audits
Faruk Alpay, Levent Sarioglu
We convert drone-vision annotation streams into virtual swarm-game states without controlling physical drones. VisDrone and UAVSwarm metadata are compressed into a Bloom representa…
Observer-Quotient Security: Composable Leakage Bounds for Hidden State Continuations
Faruk Alpay, Levent Sarioglu
Observer-quotient security studies interactive cryptographic systems whose security depends on what an admissible observer can distinguish across transcripts, leakage traces, and h…
Epistemic Horizon Minority Games: When Abundance Reduces Strategic Value
Faruk Alpay, Levent Sarioglu
Strategic value can fall when an option becomes visible. A route, signal, bet, or opportunity may be attractive because few agents see it; public attention can erase the advantage…
Service-Cut Certificates for Aligned Eviction in Tiered Cache Networks
Faruk Alpay, Levent Sarioglu
In a tiered cache, eviction is a graph decision: removing one aligned storage block can disconnect downstream demand that never addressed that block directly, so request recency al…
Auditing Combinatorial Randomness from Finite Transcripts
Faruk Alpay, Levent Sarioglu
Public randomness is a security primitive whose deployed behavior is often observable only through a finite transcript. We study black-box auditing of -subset draws from lab…
Guarded Epoch Bloom Filters for Sliding-Window Membership
Faruk Alpay, Levent Sarioglu
Approximate membership queries in streams often need recent-window semantics rather than membership over all items ever seen. This paper studies guarded epoch Bloom filters, a slid…
Renderable Partial Representations for Dynamic Gaussian Splatting under Incomplete Delivery
Faruk Alpay, Levent Sarioglu, Yaser Hadri
Dynamic Gaussian compression is normally optimized for complete files or complete progressive prefixes, but interactive rendering encounters partial representations: some spatiotem…
Comparison Patrols on Drifting Orders: Certified Rank Maintenance, Evolving Planar Maxima, and Selection under Drifting Fitness
Faruk Alpay, Levent Sarioglu
Rank-based selection in dynamic environments acts on order information that becomes stale while it is being used. Tournaments, elitism, truncation, and Pareto selection may therefo…
Split Tallies: A Discrete Certificate Calculus for Auditing Dynamic Ordered Sets in Constant Memory
Faruk Alpay, Levent Sarioglu
We study retrospective auditing for dynamic ordered sets maintained by an untrusted party. A passive auditor watches insert, delete, membership, predecessor, successor, min, and ma…
Value-Refined Modal Fixed-Point Semantics with Certified Choice and Public Share-Alike Certificates
Faruk Alpay, Levent Sarioglu
This paper presents a finite modal semantics where truth is closed under admissible continuation, then refined by discounted value, and finally certified by residual tests. The adm…
The Cascade Log: Reference-Stable Windowing over Tiered Append Sequences
Faruk Alpay, Levent Sarioglu
A long-running append-mostly sequence, such as an edit log, event store, or versioned working set, is usually tiered into a bounded hot stratum and colder folded summaries. This sa…
Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
Faruk Alpay, Levent Sarioglu
We study exact predecessor and rank search in a routed, atom-budgeted, certified-repair learned-index architecture. An ordered directory routes each query to a contiguous interval,…
Budgeted Dynamic Trace Structures for Token-Efficient Sequential Computation
Faruk Alpay, Levent Sarioglu
Sequential computation increasingly produces long traces containing nested branches, status transitions, textual payloads, and compact summaries of earlier execution. This paper in…
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…