arXiv (All)
open access
The Sync Heap: Delete First, Ask Questions Later
Heaps (priority queues) are among the best-studied data structures in computer science. In this paper, we critically revisit the textbook assumption that in the comparison model at least one of the two standard heap operations of inserting an element and deleting the minimum must take logarithmic ti
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
- Principles of Computer Systems#3326
- Two Holes Make a Difference: Deterministic Paging with Delay and Deadlines#1344264
- Enforcing Textual Alignment of Collectives Using Dynamic Checks#814637
- The Execution Dilemma in Pessimistic Blockchains: Profitability XOR Fair Ordering / Artjom Pugatsov, Can Umut Ileri, Jérémie Decouchant#1188442
- CVE-2026-92573 — MEDIUM 6.5#1098234
Record · ID 1357239
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