scientific article; zbMATH DE number 871900
From MaRDI portal
Publication:4875169
Recommendations
Cited in
(25)- Sorting and searching revisted
- Worst-case efficient external-memory priority queues
- Integer priority queues with decrease key in constant time and the single source shortest paths problem
- Rank-Sensitive Priority Queues
- Improved parallel integer sorting without concurrent writing
- scientific article; zbMATH DE number 6469188 (Why is no real title available?)
- A faster external memory priority queue with DecreaseKeys
- A novel pseudo‐polynomial approach for shortest path problems
- Variable-priority queue and doughnut routing
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- scientific article; zbMATH DE number 1476490 (Why is no real title available?)
- Linear-algebraic implementation of Fibonacci heap
- Faster shortest-path algorithms for planar graphs
- Hash functions for priority queues
- scientific article; zbMATH DE number 6469130 (Why is no real title available?)
- Priority queues: small, monotone and trans-dichotomous
- Priority queues and sorting for read-only data
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
- Quasi-linear algorithms for the topological watershed
- Predecessor queries in dynamic integer sets
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- On RAM Priority Queues
- A simple implementation technique for priority search queues
- Paths with minimum range and ratio of arc lengths
- Equivalence between priority queues and sorting in external memory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875169)
