Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A parallel priority queue with constant time operations

From MaRDI portal
Publication:1130313
Jump to:navigation, search

DOI10.1006/JPDC.1998.1425zbMath0914.68099OpenAlexW2003969379MaRDI QIDQ1130313

Christos D. Zaroliagis, Gerth Stølting Brodal, Jesper Larsson Träff

Publication date: 5 November 1998

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4eebe795c4bd37da58cbc12948cc85574a5559b0


zbMATH Keywords

Dijkstra's algorithmdata structure


Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)


Related Items (2)

Unnamed Item ⋮ Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models







This page was built for publication: A parallel priority queue with constant time operations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1130313&oldid=13180297"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki