Priority queues: small, monotone and trans-dichotomous
From MaRDI portal
Publication:4595482
Recommendations
Cited in
(18)- Predecessor queries in dynamic integer sets
- Construct a perfect word hash function in time independent of the size of integers
- Improved fast integer sorting in linear space
- Sorting in linear time?
- Minimal indices for predecessor search
- A faster polynomial algorithm for the constrained maximum flow problem
- On perfect hashing of numbers with sparse digit representation via multiplication by a constant
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- A survey on priority queues
- A Linear Time Algorithm for Ordered Partition
- A double scaling algorithm for the constrained maximum flow problem
- Rank-Sensitive Priority Queues
- Optimal Las Vegas reduction from one-way set reconciliation to error correction
- Optimal bounds for the predecessor problem and related problems
- A novel pseudo‐polynomial approach for shortest path problems
This page was built for publication: Priority queues: small, monotone and trans-dichotomous
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595482)