Vishkin uzi (42 risultati)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Paperback. Condizione: New. New copy - Usually dispatched within 4 working days.

Paperback. Condizione: New. New copy - Usually dispatched within 4 working days.

Paperback. Condizione: New. New copy - Usually dispatched within 4 working days.

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

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

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

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

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

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

Paperback. Condizione: New. Print on Demand. This book offers a comprehensive overview of synchronous parallel computation, a form of computing that harnesses multiple processors simultaneously to tackle complex problems. The author, a leading expert in the field, delves into the history and evolution of parallel computing, tracing its roots to the early days of computer science. The book explores various models of parallel computation and their underlying principles, providing a solid foundation for understanding the subject. Beyond theoretical foundations, the book delves into the practical aspects of parallel computing, examining how abstract models can be implemented in real-world systems. It discusses the challenges and trade-offs involved in designing parallel algorithms, ensuring they efficiently utilize available resources while minimizing computational complexity. The author also explores the relationship between time and processor utilization in parallel computation, providing insights into the optimal allocation of resources for different problem domains. The book's significance lies in its ability to bridge the gap between theory and practice, offering a comprehensive guide to synchronous parallel computation. It empowers readers with the knowledge and tools to understand, design, and implement efficient parallel algorithms for a wide range of applications. Whether you're a student, researcher, or practitioner in computer science, this book will prove an invaluable resource, deepening your understanding of parallel computing and its profound impact on modern technology. 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.…

Paperback. Condizione: New. Print on Demand. This book examines the String Matching with k Differences problem in computer science. String matching, or pattern matching, is an essential and fundamental problem in computer science. This book investigates a particular type of string matching problem: finding all occurrences of a pattern in a text with at most k differences. In this problem, the differences between characters of the pattern and text can be mismatches, superfluous characters in the text, or superfluous characters in the pattern. The author presents an efficient algorithm for solving the k differences problem, running in 0(m2En) time for a fixed alphabet size and 0(mEn) time for general input. The algorithm has two implementations, the first prioritizing time complexity and the second prioritizing space complexity. The book also discusses the broader context of string matching, including the history of the problem, existing algorithms, and applications in fields such as molecular biology. By providing a comprehensive analysis of the k differences problem, this book serves as a valuable resource for researchers, practitioners, and students in computer science and related fields. 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. …

Paperback. Condizione: New. Print on Demand. This book delves into the efficient implementation of a shifting algorithm for solving tree partitioning problems. The approach used in this book is a top-down greedy technique, in contrast to the traditional bottom-up approach. It introduces a novel data structure that elegantly represents subsets of edges on a given tree while preserving their interrelation, leading to a significant improvement in the algorithm's complexity. The book provides a detailed description of the algorithm, from its high-level conception to its low-level implementation. It covers topics such as min-max tree partitioning, shifting algorithm techniques, junction tree data structures, and cut-free data structures. Through these concepts, the book offers valuable insights into designing efficient algorithms for tree partitioning problems. Its findings are of great significance in the field of computer science, particularly in the realm of graph theory and algorithm design. 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.…

Paperback. Condizione: New. Print on Demand. This book unveils a groundbreaking parallel algorithmic technique for computations on trees, accelerating the process of tree expression evaluation and presenting a novel reduction to list ranking. The technique opens up possibilities for solving a range of tree problems with logarithmic time complexity using an optimal number of processors. The author systematizes fundamental parallel algorithmic ideas for trees, establishing a clear order of importance among them. This book not only provides a valuable tool for researchers and practitioners in the field but also deepens our understanding of parallel tree algorithms, offering a comprehensive framework for their design and analysis. Its insights will undoubtedly have a lasting impact on the development of efficient parallel algorithms for tree-related problems. 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.…

Paperback. Condizione: New. Print on Demand. This book is an account of the string matching algorithm designed by Gad M. Landau and Uzi Vishkin, and Ruth Nussinov. Adding to existing algorithms that allow mismatches, the newly designed algorithm uniquely allows mismatches, deletions, and insertions. This algorithm operates in significantly reduced time compared to existing algorithms, making this book important reading for those in the field of computer science. This book provides historical context, an outline of the algorithm's development, and insight into its usefulness. 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. …

Paperback. Condizione: New. Print on Demand. This book delves into the intricate relationship between communication and efficiency in parallel computing, illuminating the profound impact of communication capacity on the performance of computational algorithms. The author, a leading expert in the field, explores the fundamental trade-offs between the depth and width of parallel computation, demonstrating how these factors govern the time required to solve computational problems. By introducing novel techniques to overcome analytical challenges, the author provides groundbreaking insights into the lower bounds for parallel computation models, particularly in the context of concurrent-write and exclusive-write parallel random access machines. These discoveries advance our understanding of the inherent complexity of parallel algorithms and shed light on the optimal resource allocation for efficient computation. 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.…

Paperback. Condizione: New. Print on Demand. This book presents new deterministic parallel algorithms for list rankingâ"a problem commonly encountered when designing parallel algorithms. The bulk of the work on the subject to date has developed deterministic algorithms based on either linear-time serial algorithms, or O(log n) time parallel algorithms using n processors. This book makes significant headway, presenting new algorithms that achieve optimal speed-up for various processor configurations. The author provides a new deterministic coin tossing technique for breaking symmetric situations in a ârandom-likeâ fashion. This technique is applied to the list-ranking problem to devise an O(log n time algorithm using n/(log n) processors. Additionally, this book presents algorithms that achieve optimal speed-up for all practical purposes, as well as an algorithm that uses n processors to achieve a runtime of O(log n) time, disproving a longstanding conjecture in the field. The author's insights into deterministic parallel algorithms and their applications to the list-ranking problem are significant, and this book will be of great interest to researchers and practitioners working in parallel computing and algorithm design. 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.…