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

Efficient low-contention parallel algorithms

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

DOI10.1006/JCSS.1996.0079zbMath0870.68083OpenAlexW4213083648MaRDI QIDQ676446

Phillip B. Gibbons, Vijaya Ramachandran, Yossi Matias

Publication date: 15 September 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1996.0079


zbMATH Keywords

parallel random access machine


Mathematics Subject Classification ID

Distributed algorithms (68W15)


Related Items (4)

The queue-read queue-write asynchronous PRAM model ⋮ Simple fast parallel hashing ⋮ Delayed path coupling and generating random permutations ⋮ The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms







This page was built for publication: Efficient low-contention parallel algorithms

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