Priority queues: small, monotone and trans-dichotomous
From MaRDI portal
Publication:4595482
DOI10.1007/3-540-61680-2_51zbMATH Open1379.68108DBLPconf/esa/Raman96OpenAlexW1599325086WikidataQ56454626 ScholiaQ56454626MaRDI QIDQ4595482FDOQ4595482
Publication date: 5 December 2017
Published in: Algorithms — ESA '96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61680-2_51
Recommendations
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10)
Cited In (16)
- A Linear Time Algorithm for Ordered Partition
- A Survey on Priority Queues
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Improved fast integer sorting in linear space
- 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
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- On perfect hashing of numbers with sparse digit representation via multiplication by a constant
- Sorting in linear time?
- Minimal indices for predecessor search
- Predecessor queries in dynamic integer sets
- Construct a perfect word hash function in time independent of the size of integers
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- Optimal bounds for the predecessor problem and related problems
- Optimal Las Vegas reduction from one-way set reconciliation to error correction
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)
