b'@techreport{BrodalTraffZaroliagis97,'b'\nTITLE = {A parallel priority queue with constant time operations},\nAUTHOR = {Brodal, Gerth St{\\o}lting and Tr{\\"a}ff, Jesper Larsson and Zaroliagis, Christos},\nLANGUAGE = {eng},\nNUMBER = {MPI-I-1997-1-011},\nINSTITUTION = {Max-Planck-Institut f{\\"u}r Informatik},\nADDRESS = {Saarbr{\\"u}cken},\nYEAR = {1997},\nDATE = {1997},\nABSTRACT = {We present a parallel priority queue that supports the following operations in constant time: {\\em parallel insertion\\/} of a sequence of elements ordered according to key, {\\em parallel decrease key\\/} for a sequence of elements ordered according to key, {\\em deletion of the minimum key element}, as well as {\\em deletion of an arbitrary element}. Our data structure is the first to support multi insertion and multi decrease key in constant time. The priority queue can be implemented on the EREW PRAM, and can perform any sequence of $n$ operations in $O(n)$ time and $O(m\\log n)$ work, $m$ being the total number of keys inserted and/or updated. A main application is a parallel implementation of Dijkstra\'s algorithm for the single-source shortest path problem, which runs in $O(n)$ time and $O(m\\log n)$ work on a CREW PRAM on graphs with $n$ vertices and $m$ edges. This is a logarithmic factor improvement in the running time compared with previous approaches.},\nTYPE = {Research Report / Max-Planck-Institut f\xc3\xbcr Informatik},\n}\n'