Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
EUR 24,31
Quantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : Good.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Zebra Books, Cambridge, Royaume-Uni
EUR 23,44
Quantité disponible : 1 disponible(s)
Ajouter au panierpaperback. Etat : Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 47,71
Quantité disponible : 3 disponible(s)
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 46,51
Quantité disponible : 6 disponible(s)
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
EUR 46,48
Quantité disponible : 1 disponible(s)
Ajouter au panierPAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 52,13
Quantité disponible : 3 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Cambridge University Press, Cambridge, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
EUR 57,53
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : GoldBooks, Denver, CO, Etats-Unis
EUR 57,64
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : new.
Edité par Cambridge University Press, GB, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
EUR 62,63
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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).
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 49,39
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. In.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 45,98
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 46,47
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
Edité par Cambridge University Press 2021-02-28, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 46,06
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : New.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
EUR 63,26
Quantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : Very Good.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 56,67
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. 2021. Paperback. . . . . .
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 52,59
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
EUR 70,39
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : New. 2021. Paperback. . . . . . Books ship from the US and Ireland.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 70,79
Quantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 101,06
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 99,86
Quantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : moluna, Greven, Allemagne
EUR 54,70
Quantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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 .
Edité par Cambridge University Press, Cambridge, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : Grand Eagle Retail, Bensenville, IL, Etats-Unis
EUR 120,19
Quantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : 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.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 118,20
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : As New. Unread book in perfect condition.
Edité par Cambridge University Press Jul 2021, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 55,77
Quantité disponible : 2 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 105,58
Quantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. New copy - Usually dispatched within 4 working days.
Edité par Cambridge University Press, GB, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Rarewaves.com UK, London, Royaume-Uni
EUR 58,20
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : 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).
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : preigu, Osnabrück, Allemagne
EUR 61,50
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. 125 Problems in Text Algorithms | With Solutions | 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.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 148,78
Quantité disponible : 2 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.
EUR 110,68
Quantité disponible : 5 disponible(s)
Ajouter au panierEtat : 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 .
Edité par Cambridge University Press Jul 2021, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 151,80
Quantité disponible : 2 disponible(s)
Ajouter au panierBuch. Etat : Neu. Neuware - Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.