9781333329112 - faster optimal parallel prefix sums and list ranking (classic reprint) de cole, richard (3 resultados)
- Tapa blanda
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de AmericaPBShop.store US
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 23,91
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 15 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa blanda
Librería: PBShop.store UK, Fairford, GLOS, Reino UnidoPBShop.store UK
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 24,26
Envío por EUR 3,85Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 15 disponibles
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
- Tapa blanda
- Impresión bajo demanda
Librería: Forgotten Books, London, Reino UnidoForgotten Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 15,23
Gastos de envío gratisSe envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Paperback. Condición: New. Print on Demand. This book presents a new algorithm for the prefix sums problem which runs in optimal time using an optimal number of processors. This algorithm has applications to the list ranking problem. The author provides a detailed analysis of the algorithm and its implementation, as well as a di…scussion of its significance. The book is well-written and accessible to readers with a basic understanding of computer science. It is a valuable resource for researchers and practitioners working in the field of parallel algorithms. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
