Title / Author / Series

Books by letter :

Cover
Book
Rating
My rating
Do you want / have this?
The mystery finished! The negro has a soul. His normal relation is that of a servant of tribute to Shem and Japheth. The negro is not a citizen of the state, but a member of the church by divine ap[point]ment_cover
The mystery finished! The negro has a soul. His normal relation is that of a servant of tribute to Shem and Japheth. The negro is not a citizen of the state, but a member of the church by divine ap[point]ment by Voice, A series: Unknown first published: Unknown
Avg: 3.5/5
My rating
add to favoritesadd
Lucid-boxes vs. black-boxes_cover
Lucid-boxes vs. black-boxes by Vishkin, U series: Unknown first published: Unknown
Avg: 2.5/5
My rating
add to favoritesadd
Trade-offs between depth and width in parallel computation. Rev. ed_cover
Trade-offs between depth and width in parallel computation. Rev. ed by Vishkin, U series: Unknown first published: Unknown
Avg: 3/5
My rating
add to favoritesadd
On the detection of robust curves_cover
On the detection of robust curves by Vishkin, U series: Unknown first published: Unknown
Avg: 4/5
My rating
add to favoritesadd
Matching patterns in strings subject to multi-linear transformations_cover
Matching patterns in strings subject to multi-linear transformations by Vishkin, U series: Unknown first published: Unknown
Avg: 4/5
My rating
add to favoritesadd
Approximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time_cover
Approximate parallel scheduling. Part II: Applications to optimal parallel graph algorithms in logarithmic time by Vishkin, U series: Unknown first published: Unknown
Avg: 4/5
My rating
add to favoritesadd
Faster optimal parallel prefix sums and list ranking_cover
Faster optimal parallel prefix sums and list ranking by Vishkin, U series: Unknown first published: Unknown
Avg: 4.5/5
My rating
add to favoritesadd
Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time_cover
Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time by Vishkin, U series: Unknown first published: Unknown
Avg: 3.5/5
My rating
add to favoritesadd
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time_cover
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time by Vishkin, U series: Unknown first published: Unknown
Avg: 3/5
My rating
add to favoritesadd
Tight comparison bounds on the complexity of parallel sorting_cover
Tight comparison bounds on the complexity of parallel sorting by Vishkin, U series: Unknown first published: Unknown
Avg: 2.5/5
My rating
add to favoritesadd

Do you want to read a book that interests you? It’s EASY!

Create an account and send a request for reading to other users on the Webpage of the book!

register now

OnRead

The site is set up for educational purposes. We respect copyright and give users the opportunity to get to know the world literature and communicate also. More details about us.

contact & support

stay connected