Order Total (1 Item Items):
Shipping Destination:
Expected Parallel Time Sequential by John (31 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (31)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (27)
- As New, Fine or Near Fine (4)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (5)
- Not Print on Demand (26)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
US$ 16.35
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New.
-
US$ 17.57
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Condition: New. SUPER FAST SHIPPING.
-
Condition: New. SUPER FAST SHIPPING.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 21.04
Convert currencyUS$ 4.44 shipping from United Kingdom to U.S.A.Quantity: 15 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Condition: New.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 26.51
Convert currencyUS$ 5.62 shipping from United Kingdom to U.S.A.Quantity: 15 available
Add to basketHRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
US$ 29.32
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Condition: New. SUPER FAST SHIPPING.
-
Condition: New. SUPER FAST SHIPPING.
-
Condition: New.
-
US$ 32.69
Convert currencyUS$ 2.64 shipping within U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 22.92
Convert currencyUS$ 20.26 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 26.46
Convert currencyUS$ 20.26 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 38.23
Convert currencyUS$ 20.26 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 42.05
Convert currencyUS$ 20.26 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
US$ 22.94
Convert currencyUS$ 49.98 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
US$ 17.55
Convert currencyFree shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: 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.
-
US$ 38.24
Convert currencyUS$ 49.98 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Published by Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 1024188329 ISBN 13: 9781024188325
Language: English
US$ 23.79
Convert currencyUS$ 70.80 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: Neu. Neuware.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Published by LIGHTNING SOURCE INC, 2015
ISBN 10: 1341548996 ISBN 13: 9781341548994
Language: English
US$ 40.21
Convert currencyUS$ 57.42 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketGebunden. Condition: New.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Published by Creative Media Partners, LLC Mär 2018, 2018
ISBN 10: 1378993373 ISBN 13: 9781378993378
Language: English
US$ 30.79
Convert currencyUS$ 70.83 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketTaschenbuch. Condition: 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.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Published by Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 102418529X ISBN 13: 9781024185294
Language: English
US$ 43.98
Convert currencyUS$ 71.79 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: Neu. Neuware.
-
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
Published by Penguin Random House LLC Sep 2015, 2015
ISBN 10: 1341548996 ISBN 13: 9781341548994
Language: English
US$ 50.08
Convert currencyUS$ 71.81 shipping from Germany to U.S.A.Quantity: 2 available
Add to basketBuch. Condition: 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.
-
US$ 23.44
Convert currencyUS$ 8.78 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand.
-
US$ 25.70
Convert currencyUS$ 8.78 shipping from United Kingdom to U.S.A.Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 50.
-
US$ 27.02
Convert currencyUS$ 11.66 shipping from Germany to U.S.A.Quantity: 4 available
Add to basketCondition: New. PRINT ON DEMAND.
