Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 5,16
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: Good.
Publicado por Cambridge University Press -, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Bahamut Media, Reading, Reino Unido
EUR 10,27
Convertir monedaCantidad disponible: 8 disponibles
Añadir al carritopaperback. Condición: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: AwesomeBooks, Wallingford, Reino Unido
EUR 11,89
Convertir monedaCantidad disponible: 8 disponibles
Añadir al carritoCondición: Very Good. This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. .
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Zebra Books, Cambridge, Reino Unido
EUR 23,82
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
Publicado por Oxford University Press, Incorporated, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
Idioma: Inglés
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
EUR 29,10
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Very Good. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects.
Publicado por Oxford University Press, Incorporated, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
Idioma: Inglés
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
EUR 29,10
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 48,36
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: GoldBooks, Denver, CO, Estados Unidos de America
EUR 25,46
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. New Copy. Customer Service Guaranteed.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 51,88
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. In.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Revaluation Books, Exeter, Reino Unido
EUR 46,72
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 56,84
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. 2021. Paperback. . . . . .
Publicado por Cambridge University Press, GB, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Rarewaves.com UK, London, Reino Unido
EUR 60,67
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. The problems are drawn from a large range of scientific publications, both classic and new. Building up from the basics, the book goes on to showcase problems in combinatorics on words (including Fibonacci or Thue-Morse words), pattern matching (including Knuth-Morris-Pratt and Boyer-Moore like algorithms), efficient text data structures (including suffix trees and suffix arrays), regularities in words (including periods and runs) and text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler based methods).
Publicado por Cambridge University Press 2021-02-28, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Chiron Media, Wallingford, Reino Unido
EUR 46,80
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: New.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 47,01
Convertir monedaCantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 48,35
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, GB, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 65,28
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: New. String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. The problems are drawn from a large range of scientific publications, both classic and new. Building up from the basics, the book goes on to showcase problems in combinatorics on words (including Fibonacci or Thue-Morse words), pattern matching (including Knuth-Morris-Pratt and Boyer-Moore like algorithms), efficient text data structures (including suffix trees and suffix arrays), regularities in words (including periods and runs) and text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler based methods).
Publicado por World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Idioma: Inglés
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 67,08
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Publicado por World Scientific Publishing Company, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Idioma: Inglés
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 64,31
Convertir monedaCantidad disponible: 15 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Publicado por Cambridge University Press Jul 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 55,77
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Neuware - This collection of puzzles and exercises with solutions in key areas of string algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. Copious figures illuminate classic and new problems to tease out deeper understanding of algorithms on strings.
Publicado por World Scientific Publishing Co Pte Ltd, SG, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Idioma: Inglés
Librería: Rarewaves.com UK, London, Reino Unido
EUR 68,04
Convertir monedaCantidad disponible: 8 disponibles
Añadir al carritoPaperback. Condición: New. 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. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 68,53
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. 2021. Paperback. . . . . . Books ship from the US and Ireland.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 52,96
Convertir monedaCantidad disponible: 3 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 53,38
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Publicado por World Scientific Publishing Co Pte Ltd, SG, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Idioma: Inglés
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 73,30
Convertir monedaCantidad disponible: 8 disponibles
Añadir al carritoPaperback. Condición: New. 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. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 54,70
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoCondición: New. This collection of puzzles and exercises with solutions in key areas of string algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. Copious figures illuminate .
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Idioma: Inglés
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 67,10
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: Very Good.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: Revaluation Books, Exeter, Reino Unido
EUR 69,82
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Idioma: Inglés
Librería: CitiRetail, Stevenage, Reino Unido
EUR 53,59
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. The problems are drawn from a large range of scientific publications, both classic and new. Building up from the basics, the book goes on to showcase problems in combinatorics on words (including Fibonacci or Thue-Morse words), pattern matching (including Knuth-Morris-Pratt and Boyer-Moore like algorithms), efficient text data structures (including suffix trees and suffix arrays), regularities in words (including periods and runs) and text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler based methods). This collection of puzzles and exercises with solutions in key areas of string algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. Copious figures illuminate classic and new problems to tease out deeper understanding of algorithms on strings. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Idioma: Inglés
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
EUR 96,74
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Idioma: Inglés
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 103,60
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.