Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 23,27
Cantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: Good.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Zebra Books, Cambridge, Reino Unido
EUR 23,74
Cantidad disponible: 1 disponibles
Añadir al carritopaperback. Condición: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 53,03
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 55,41
Cantidad 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 multiple locations in the US or from the UK, depending on stock availability.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 55,71
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 55,66
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 54,80
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Revaluation Books, Exeter, Reino Unido
EUR 48,99
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 54,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 52,20
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 62,63
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. 2021. Paperback. . . . . .
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 59,22
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Cambridge University Press 2/1/2022, 2022
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: BargainBookStores, Grand Rapids, MI, Estados Unidos de America
EUR 78,11
Cantidad disponible: 5 disponibles
Añadir al carritoPaperback or Softback. Condición: New. 125 Problems in Text Algorithms: With Solutions. Book.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 75,34
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. pp. 320.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 77,20
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. 2021. Paperback. . . . . . Books ship from the US and Ireland.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Revaluation Books, Exeter, Reino Unido
EUR 74,78
Cantidad disponible: 2 disponibles
Añadir al carritoPaperback. Condición: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: CitiRetail, Stevenage, Reino Unido
EUR 52,21
Cantidad 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.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 84,83
Cantidad 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 Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 75,58
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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).
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
EUR 54,80
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPAP. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Majestic Books, Hounslow, Reino Unido
EUR 75,13
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand pp. 320.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 75,04
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND pp. 320.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: moluna, Greven, Alemania
EUR 60,98
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 .
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: preigu, Osnabrück, Alemania
EUR 63,30
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. 125 Problems in Text Algorithms | Maxime Crochemore (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2021 | Cambridge University Press | EAN 9781108798853 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.