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,32
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,80
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 46,86
Cantidad disponible: 3 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 45,69
Cantidad disponible: 6 disponibles
Añadir al carritoCondición: New.
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 51,88
Cantidad disponible: 19 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 52,79
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: Book Grocer, Tullamarine, VIC, Australia
EUR 29,73
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Maxime Crochemore, Cambridge University Press. 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). Paperback.
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 56,51
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: GoldBooks, Denver, CO, Estados Unidos de America
EUR 53,79
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: new.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Revaluation Books, Exeter, Reino Unido
EUR 46,67
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: 110883583X ISBN 13: 9781108835831
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
EUR 62,18
Cantidad disponible: 1 disponibles
Añadir al carritohardcover. Condición: Very Good.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Revaluation Books, Exeter, Reino Unido
EUR 69,67
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, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 99,27
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 98,09
Cantidad disponible: 2 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: moluna, Greven, Alemania
EUR 55,35
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condició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 .
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: California Books, Miami, FL, Estados Unidos de America
EUR 110,78
Cantidad disponible: 6 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
EUR 118,06
Cantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. 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: 110883583X ISBN 13: 9781108835831
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 116,11
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, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
EUR 107,18
Cantidad disponible: Más de 20 disponibles
Añadir al carritoHardback. Condición: New. New copy - Usually dispatched within 4 working days.
Idioma: Inglés
Publicado por Cambridge University Press Jul 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 72,86
Cantidad disponible: 1 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.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: Revaluation Books, Exeter, Reino Unido
EUR 146,46
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.
EUR 110,68
Cantidad disponible: 5 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 .
Idioma: Inglés
Publicado por Cambridge University Press Jul 2021, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 151,80
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. Neuware - Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.