expected parallel time sequential de john (23 résultats)

Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : New.

Etat : New.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : As New. Unread book in perfect condition.

HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : As New. Unread book in perfect condition.

Paperback. Etat : 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.

Taschenbuch. Etat : Neu. Neuware.

Gebunden. Etat : New.

Taschenbuch. Etat : Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.

Buch. Etat : Neu. Neuware.

Buch. Etat : Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

Leather Bound. Etat : New. Language: English. Presenting an Exquisite Leather-Bound Edition, expertly crafted with Original Natural Leather that gracefully adorns the spine and corners. The allure continues with Golden Leaf Printing that adds a touch of elegance, while Hand Embossing on the rounded spine lends an artistic flair. This masterpiece has been meticulously reprinted in 2025, utilizing the invaluable guidance of the original edition published many years ago in 1983. The contents of this book are presented in classic black and white. Its durability is ensured through a meticulous sewing binding technique, enhancing its longevity. Imprinted on top-tier quality paper. A team of professionals has expertly processed each page, delicately preserving its content without alteration. Due to the vintage nature of these books, every page has been manually restored for legibility. However, in certain instances, occasional blurriness, missing segments, or faint black spots might persist. We sincerely hope for your understanding of the challenges we faced with these books. Recognizing their significance for readers seeking insight into our historical treasure, we've diligently restored and reissued them. Our intention is to offer this valuable resource once again. We eagerly await your feedback, hoping that you'll find it appealing and will generously share your thoughts and recommendations. Lang: - English, Pages:- 56, Print on Demand. If it is a multi-volume set, then it is only a single volume. We are specialised in Customisation of books, if you wish to opt different color leather binding, you may contact us. This service is chargeable. Product Disclaimer: Kindly be informed that, owing to the inherent nature of leather as a natural material, minor discolorations or textural variations may be perceptible. Explore the FOLIO EDITION (12x19 Inches): Available Upon Request. 56.

Paperback. Etat : new. Paperback. This book explores the expected parallel time and sequential space complexity of various graph and digraph problems. It provides an in-depth analysis of algorithms designed to solve these problems, focusing on their efficiency in terms of both time and space. The work is aimed at researchers and students in computer science, mathematics, and related fields who are interested in the theoretical aspects of computation and algorithm design.Key topics include graph theory, parallel processing, algorithm analysis, and computational complexity. The book offers a rigorous treatment of the subject, combining theoretical results with practical considerations. It serves as a valuable resource for understanding the fundamental limitations and possibilities of solving graph and digraph problems using parallel and sequential computing models.This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Hardcover. Etat : new. Hardcover. This book explores the expected parallel time and sequential space complexity of various graph and digraph problems. It provides an in-depth analysis of algorithms designed to solve these problems, focusing on their efficiency in terms of both time and space. The work is aimed at researchers and students in computer science, mathematics, and related fields who are interested in the theoretical aspects of computation and algorithm design.Key topics include graph theory, parallel processing, algorithm analysis, and computational complexity. The book offers a rigorous treatment of the subject, combining theoretical results with practical considerations. It serves as a valuable resource for understanding the fundamental limitations and possibilities of solving graph and digraph problems using parallel and sequential computing models.This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.