
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
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 work investigates the efficiency of parallel algorithms for string pattern matching. The author, U. Vishkin, presents research that has been deemed culturally significant and foundational to the field. The text is a faithful reproduction of an original artifact, preserving historical notations and ensuring its accessibility to the public domain. It addresses the core problem of how to optimize string matching processes using parallel computing architectures.
This work is recognized for its cultural importance and contribution to the foundational knowledge of computer science, particularly in the area of string pattern matching. As a direct reproduction of an original artifact, it maintains historical integrity, including library stamps and notations, which scholars consider vital for understanding the evolution of the field. The text is made available to the public domain, ensuring its preservation and accessibility. Its re-publication underscores its enduring significance in the ongoing development of computational theory and algorithms.
Page Count:
54
Publication Date:
2015-09-09
Publisher:
Creative Media Partners, LLC
ISBN-10:
134204892X
ISBN-13:
9781342048929
No comments yet. Be the first to share your thoughts!