arXiv (All)
open access
FastHeapDict: Permanent Slot Indexing for Efficient Decrease-Key Operations in Indexed Priority Queues
Efficient decrease-key support remains an important practical concern in priority queues used by shortest-path and graph-processing algorithms. Although duplicate-entry heaps avoid explicit decrease-key operations and are simple to implement, they may accumulate many stale entries when tentative pri
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
- The Sync Heap: Delete First, Ask Questions Later#1357239
- Operation-Aware Hybrid Locking for Modern In-Memory Indexes#378128
- PASCAL: A Phase-Aware Shared-Cache Model for Parallel Scans#997387
- Capacitated Line Aggregation with Maximum Delay#1401662
- ANCHOR: A Vision for Secure Persistent Key-Value Stores in Disaggregated Data Centers#781108
Record · ID 1535699
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