Approximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time
Our rough guess is there are 10,500 words in this book.
At a pace averaging 250 words per minute, this book will take 0 hours and 42 minutes to read. With a half hour per day, this will take 2 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Vishkin, U. - Contributor
Publication
1987 - Courant Institute of Mathematical Sciences, New York University, New York, New York (State)
Language
English
Word Count
10,500 words, Guess
Page Count
42 pages
Identifiers
- Internet Archiveapproximatepar00cole
- Open LibraryOL17977430M
Subjects
Series Statement
- Ultracomputer note -- 119
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!