On RAM Priority Queues
From MaRDI portal
Publication:4507340
DOI10.1137/S0097539795288246zbMATH Open0968.68037WikidataQ56082331 ScholiaQ56082331MaRDI QIDQ4507340FDOQ4507340
Authors: Mikkel Thorup 
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 871900
- Fast priority queues for cached memory
- Priority queues
- Priority Queues Resilient to Memory Faults
- Randomized priority queues for fast parallel access
- scientific article; zbMATH DE number 1760164
- Worst-case efficient external-memory priority queues
- An experimental study of priority queues in external memory
- Priority queues on parallel machines
- Priority queues on parallel machines
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Searching and sorting (68P10)
Cited In (32)
- An experimental study of priority queues in external memory
- Weighted fusion graphs: Merging properties and watersheds
- Worst-case efficient external-memory priority queues
- Dynamic layers of maxima with applications to dominating queries
- Cascade heap: towards time-optimal extractions
- Cascade heap: towards time-optimal extractions
- Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem
- New method in information processing for maintaining an efficient dynamic ordered set
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Rank-Sensitive Priority Queues
- Title not available (Why is that?)
- Priority-Consistent Graphs
- A faster polynomial algorithm for the constrained maximum flow problem
- A novel pseudo‐polynomial approach for shortest path problems
- A double scaling algorithm for the constrained maximum flow problem
- The power of choice in priority scheduling
- Variable-priority queue and doughnut routing
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- Title not available (Why is that?)
- Hash functions for priority queues
- Title not available (Why is that?)
- Dynamic interpolation search revisited
- Priority queues: small, monotone and trans-dichotomous
- Improved bounds for finger search on a RAM
- Ordered priority queues
- Twol-amalgamated priority queues
- Probabilistic data structures for priority queues
- A simple implementation technique for priority search queues
- A survey on priority queues
- A novel linear algorithm for shortest paths in networks
- Title not available (Why is that?)
- New presentations of a link and virtual link
This page was built for publication: On RAM Priority Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507340)
