scientific article; zbMATH DE number 871899
From MaRDI portal
Publication:4875168
zbMATH Open0847.68037MaRDI QIDQ4875168FDOQ4875168
Publication date: 16 June 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (32)
- Title not available (Why is that?)
- Two new methods for constructing double-ended priority queues from priority queues
- Cascade heap: towards time-optimal extractions
- Cascade heap: towards time-optimal extractions
- Worst-case data structures for the priority queue with attrition
- Reflected min-Max heaps
- Two-tier relaxed heaps
- A Survey on Priority Queues
- Algorithm Theory - SWAT 2004
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Priority queues on parallel machines
- A Back-to-Basics Empirical Study of Priority Queues
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic
- Algorithm Theory - SWAT 2004
- Regular numeral systems for data structures
- Dynamically Maintaining Shortest Path Trees under Batches of Updates
- Title not available (Why is that?)
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- Hash functions for priority queues
- Privacy-preserving Dijkstra
- Priority queueing involving orientation and the problems of their software implementation
- Probabilistic data structures for priority queues
- Worst-Case Optimal Priority Queues via Extended Regular Counters
- Fast meldable priority queues
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY
- Worst case constant time priority queue
- Title not available (Why is that?)
- Quantum algorithm for shortest path search in directed acyclic graph
- Hollow Heaps
- Algorithms and Data Structures
- Title not available (Why is that?)
- Fishspear: a priority queue algorithm
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 Q4875168)
