search for books and compare prices
Wojciech Rytter has written 5 work(s)
Search for other authors with the same name
displaying 1 to 5 |
at end
show results in order: alphabetically | oldest to newest | newest to oldest
Product Description: The term âstringologyâ is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as âalgorithmic jewelsâ and deserve reader-friendly presentation...read more
Hardcover:
9789810247829 | World Scientific Pub Co Inc, October 1, 2002, cover price $130.00 | About this edition: The term âstringologyâ is a popular nickname for text algorithms, or algorithms on strings.
Paperback:
9789810248970 | World Scientific Pub Co Inc, January 1, 2003, cover price $65.00 | About this edition: The term âstringologyâ is a popular nickname for text algorithms, or algorithms on strings.
Hardcover:
9780198501626 | Clarendon Pr, May 28, 1998, cover price $150.00
Hardcover:
9780195086096 | Oxford Univ Pr, October 1, 1994, cover price $135.00
Hardcover:
9780201416930 | Addison-Wesley, June 1, 1991, cover price $33.95 | About this edition: Book by Banachowski, Lech, Kreczmar, Antoni, Rytter, Wojciech
Product Description: This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics...read more (view table of contents, read Amazon.com's description)
Hardcover:
9780521345859 | 1 edition (Cambridge Univ Pr, September 30, 1988), cover price $62.50 | About this edition: This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics.
Paperback:
9780521388412 | Reprint edition (Cambridge Univ Pr, February 1, 1990), cover price $59.99 | About this edition: This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics.
displaying 1 to 5 |
at end