arXiv (All)
open access
Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
In 1972, Fredman proposes the problem of sorting under partial information: preprocess a directed acyclic graph $G$ with vertex set $X$ so that you can sort $X$ in $O(\log e(G))$ time, where $e(G)$ is the number of sorted orders compatible with $G$. Cardinal, Fiorini, Joret, Jungers and Munro [STOC'
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
- Subtree Counts and the Maximum Mean Subtree Order#1083800
- Optimally large cuts in both directions#1356717
- Acyclic Dicolourings of Oriented Graphs: Paths, Random Tournaments, and Critical Orders#1037614
- Bidirectional Dijkstra's Algorithm is Instance-Optimal#1014476
- AI-Enhanced Sorting Techniques: Revolutionizing Data Processing and Analysis#726562
Record · ID 1249372
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