A parallel priority queue with constant time operations
type: Item
instance of: scholarly article
title: A parallel priority queue with constant time operations
zbMATH Open document ID: 0914.68099
author: Gerth Stølting Brodal
author: Jesper Larsson Träff
author: Christos Zaroliagis
published in: Journal of Parallel and Distributed Computing
publication date: 1998-11-05T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 1192552
zbMATH Keywords: data structure
zbMATH Keywords: Dijkstra's algorithm
MaRDI profile type: Publication
OpenAlex ID: W2003969379
DOI: 10.1006/JPDC.1998.1425
Recommended article: Parallel algorithms for priority queue operations
Recommended article: Parallel priority queues
Recommended article: Priority queues on parallel machines
Recommended article: A parallel priority queueing system with finite buffers
Recommended article: Parallel heap: an optimal parallel priority queue
Recommended article: Parallel priority queues based on binomial heaps
Recommended article: Concurrent access of priority queues
Recommended article: A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms
description: scientific article; zbMATH DE number 1192552