Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: AwesomeBooks, Wallingford, Reino Unido
EUR 11,89
Cantidad disponible: 5 disponibles
Añadir al carritohardcover. Condición: Very Good. 125 Problems in Text Algorithms: with Solutions 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. .
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: Bahamut Media, Reading, Reino Unido
EUR 11,89
Cantidad disponible: 5 disponibles
Añadir al carritoCondició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.
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 16,11
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,82
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: Book Grocer, Tullamarine, VIC, Australia
EUR 22,18
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 54,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 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: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 52,50
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: California Books, Miami, FL, Estados Unidos de America
EUR 54,97
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 54,91
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: Revaluation Books, Exeter, Reino Unido
EUR 49,16
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: Revaluation Books, Exeter, Reino Unido
EUR 74,00
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: 1108798853 ISBN 13: 9781108798853
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 90,77
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New. pp. 320.
Idioma: Inglés
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: CitiRetail, Stevenage, Reino Unido
EUR 52,38
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, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: Majestic Books, Hounslow, Reino Unido
EUR 91,19
Cantidad disponible: 1 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: moluna, Greven, Alemania
EUR 57,96
Cantidad disponible: Más de 20 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, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 114,55
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: California Books, Miami, FL, Estados Unidos de America
EUR 117,03
Cantidad disponible: Más de 20 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: AussieBookSeller, Truganina, VIC, Australia
EUR 85,44
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: 110883583X ISBN 13: 9781108835831
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 104,83
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: 110883583X ISBN 13: 9781108835831
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 117,51
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: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 104,82
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: GreatBookPricesUK, Woodford Green, Reino Unido
EUR 117,96
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 Sep 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 76,91
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 155,19
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 187,35
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 128,45
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: Majestic Books, Hounslow, Reino Unido
EUR 195,37
Cantidad disponible: 1 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 203,14
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. 2021. Hardcover. . . . . . Books ship from the US and Ireland.
Idioma: Inglés
Publicado por Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 230,52
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. 2021. Hardcover. . . . . .
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 116,86
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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.