arXiv (All)
open access
Optimal High Probability Bounds for Random Order Online Sorting
In random order online sorting, a fixed multiset of $n$ real numbers arrives in a uniformly random order. Each value must be placed immediately and irrevocably into an empty position of an array with exactly $n$ positions. The objective is to minimize the sum of the absolute differences between cons
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
- A 3.1462-Competitive Algorithm for Matroid Secretary#1160784
- A 3.7321-Competitive Algorithm for Matroid Secretary#1011503
- How long is a game of Uno? A counting law for large hands and the Wild Draw Four hoard#1324677
- Two Holes Make a Difference: Deterministic Paging with Delay and Deadlines#1344264
- Clique covers and decompositions of cliques of graphs#1122901
Record · ID 1326688
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