Artículos relacionados a Expected Parallel Time and Sequential Space Complexity...
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems (Classic Reprint) - Tapa blanda
Sinopsis
Excerpt from Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
In another proposed machine model, the w - ram, simultaneous access to the same memory location is allowed for both read and write Operations. In the case of a simultaneous write attempt, exactly one processor succeeds but we make no assumption of which one succeeds. (see [shiloah, Vishkin, 80] and [goldschlager, 78] for similar models.)
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Excerpt from Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
In another proposed machine model, the w - ram, simultaneous access to the same memory location is allowed for both read and write Operations. In the case of a simultaneous write attempt, exactly one processor succeeds but we make no assumption of which one succeeds. (see [shiloah, Vishkin, 80] and [goldschlager, 78] for similar models.)
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 19,02
EUR 0,67 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoOtras ediciones populares con el mismo título
Resultados de la búsqueda para Expected Parallel Time and Sequential Space Complexity...
Imagen de archivo
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332088898
Cantidad disponible: 15 disponibles
Imagen de archivo
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332088898
Cantidad disponible: 15 disponibles
Imagen del vendedor
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: New. Print on Demand. This book investigates how parallel algorithms, which solve complex mathematical problems by distributing them across thousands of processors working together, can be used to solve graph and digraph problems faster and more efficiently. The author presents a novel probabilistic connectivity algorithm to enhance the performance of parallel graph algorithms that is 0(loglog n) faster than previous methods even as the number of processors is decreased. The book also explores expected sequential space and time complexities in parallel graph and digraph algorithms, providing a comprehensive view of the subject. These techniques can also improve the efficiency of algorithms for minimum spanning trees, minimum cost paths, and graph isomorphism. 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. Nº de ref. del artículo: 9781332088898_0
Cantidad disponible: Más de 20 disponibles