scientific article; zbMATH DE number 871900
From MaRDI portal
Publication:4875169
zbMATH Open0848.68024MaRDI QIDQ4875169FDOQ4875169
Authors: Mikkel Thorup 
Publication date: 28 April 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (19)
- 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
- Title not available (Why is that?)
- Improved parallel integer sorting without concurrent writing
- 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
- Title not available (Why is that?)
- Faster shortest-path algorithms for planar graphs
- Hash functions for priority queues
- Title not available (Why is that?)
- Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
- Predecessor queries in dynamic integer sets
- Quasi-linear algorithms for the topological watershed
- Trans-dichotomous algorithms without multiplication — some upper and lower bounds
- On RAM Priority Queues
- Paths with minimum range and ratio of arc lengths
- Sorting and searching revisted
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)
