Parallel algorithms for priority queue operations
From MaRDI portal
Publication:672391
DOI10.1016/0304-3975(95)00039-YzbMATH Open0873.68084OpenAlexW2031320374MaRDI QIDQ672391FDOQ672391
Authors: Maria Cristina Pinotti, Geppino Pucci
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00039-y
Recommendations
- Parallel algorithms for priority queue operations
- Parallel priority queues
- Priority queues on parallel machines
- Priority queues on parallel machines
- Parallel priority queues based on binomial heaps
- A parallel priority queue with constant time operations
- Parallel heap: an optimal parallel priority queue
- Randomized priority queues for fast parallel access
Analysis of algorithms (68W40) Data structures (68P05) Parallel algorithms in computer science (68W10)
Cites Work
Cited In (11)
- Parallel heap: an optimal parallel priority queue
- A parallel priority queue with constant time operations
- Randomized priority queues for fast parallel access
- Parallel priority queues
- Concurrent access of priority queues
- Parallel priority queues based on binomial heaps
- Priority queues on parallel machines
- A comparative study of parallel and sequential priority queue algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel algorithms for priority queue operations
This page was built for publication: Parallel algorithms for priority queue operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672391)