scientific article; zbMATH DE number 871899

zbMath0847.68037MaRDI QIDQ4875168

Gerth Stølting Brodal

Publication date: 16 June 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

priority queues

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (16)

Two new methods for constructing double-ended priority queues from priority queues ⋮ Hollow Heaps ⋮ Regular numeral systems for data structures ⋮ Probabilistic data structures for priority queues ⋮ Worst-Case Optimal Priority Queues via Extended Regular Counters ⋮ Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic ⋮ Two-tier relaxed heaps ⋮ Reflected min-Max heaps ⋮ Priority queues on parallel machines ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ Cascade heap: towards time-optimal extractions ⋮ Cascade heap: towards time-optimal extractions ⋮ Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates ⋮ Quantum algorithm for shortest path search in directed acyclic graph ⋮ A Survey on Priority Queues ⋮ Dynamically Maintaining Shortest Path Trees under Batches of Updates

This page was built for publication: