Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Algorithms and Complexity Group     Display Documents



ID: 517711.0, MPI für Informatik / Algorithms and Complexity Group
A parallel priority data structure with applications
Authors:Brodal, Gerth Stølting; Träff, Jesper Larsson; Zaroliagis, Christos
Language:English
Publisher:IEEE
Place of Publication:Los Alamitos, USA
Date of Publication (YYYY-MM-DD):1997
Title of Proceedings:11th Internatinal Parallel Processing Symposium (IPPS-97)
Start Page:689
End Page:693
Place of Conference/Meeting:Geneva, Switzerland
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
1997-04-01
End Date of Conference/Meeting 
 (YYYY-MM-DD):
1997-04-05
Audience:Experts Only
Intended Educational Use:No
Abstract / Description:We present a parallel priority data structure that improves
the running time of certain algorithms for problems
that lack a fast and work-efficient parallel solution.
As a main application, we give a parallel implementation
of Dijkstra's algorithm which runs in $O(n)$ time
while performing $O(m\log n)$ work on a CREW PRAM\@.
This is a logarithmic factor improvement for the running
time compared with previous approaches. The main
feature of our data structure is that the operations needed
in each iteration of Dijkstra's algorithm can be
supported in $O(1)$ time.
Last Change of the Resource (YYYY-MM-DD):2010-03-02
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Kurt Mehlhorn
Affiliations:MPI für Informatik/Algorithms and Complexity Group
Identifiers:LOCALID:C1256428004B93B8-2723CC2AC3956601C125648400557687-...
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.