Efficient parallel algorithms
By Gibbons, Alan
"Efficient parallel algorithms" is published by Cambridge University Press in 1988 - Cambridge [England], it has 259 pages and the language of the book is English.
“Efficient parallel algorithms” Metadata:
- Title: Efficient parallel algorithms
- Author: Gibbons, Alan
- Language: English
- Number of Pages: 259
- Publisher: Cambridge University Press
- Publish Date: 1988
- Publish Location: Cambridge [England]
“Efficient parallel algorithms” Subjects and Themes:
- Subjects: ➤ Parallel algorithms - Parallel programming (Computer science) - Algorithmes - Paralleler Algorithmus - Algorithmus - Programmation parallele (Informatique) - Programmierung - Parallelverarbeitung - Programmation parallèle (Informatique) - Parallel processing (electronic computers) - Algorithms
Edition Specifications:
- Pagination: viii, 259 p. :
Edition Identifiers:
- The Open Library ID: OL2400996M - OL4981841W
- Online Computer Library Center (OCLC) ID: 16983022
- Library of Congress Control Number (LCCN): 87031185
- ISBN-10: 0521345855
- All ISBNs: 0521345855
AI-generated Review of “Efficient parallel algorithms”:
Read “Efficient parallel algorithms”:
Read “Efficient parallel algorithms” by choosing from the options below.
Search for “Efficient parallel algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Efficient parallel algorithms" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: restricted
- Check if available: The Open Library & The Internet Archive
Find “Efficient parallel algorithms” in Libraries Near You:
Read or borrow “Efficient parallel algorithms” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Efficient parallel algorithms” at a library near you.
Buy “Efficient parallel algorithms” online:
Shop for “Efficient parallel algorithms” on popular online marketplaces.