arXiv (All)
open access
Batch range mode in O(n+Q)^1.395
We give a deterministic worst-case algorithm for exact Batched Range Mode on an arbitrary array of length n and a batch of Q intervals. The algorithm returns the mode frequency and the smallest mode identifier for each query in time (n+Q)^(tau+o(1)), where tau = 5 - sqrt(13) = 1.394448724536... . Th
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quantum Query Complexity Beyond the Worst Case#1130235
- A bijection between edges of the Turán graph and irreducible elements in the dominance order lattice#1076804
- Nearly Tight Lower Bound for Range Minimum Query via Probe-by-Probe Information Accounting#1389017
- Efficient Batch Search Algorithm for B+ Tree Index Structures with Level-Wise Traversal on FPGAs#126490
- INTRODUCTION TO QUERY PROCESSING#933660
Record · ID 1388839
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive