Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : AwesomeBooks, Wallingford, Royaume-Uni
EUR 10,37
Autre deviseQuantité disponible : 9 disponible(s)
Ajouter au panierpaperback. Etat : 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. .
Edité par Oxford University Press, 1994
ISBN 10 : 0195086090 ISBN 13 : 9780195086096
Langue: anglais
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
EUR 29,80
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Fair. No Jacket. Missing dust jacket; Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less 1.01.
Edité par Oxford University Press, Incorporated, 1994
ISBN 10 : 0195086090 ISBN 13 : 9780195086096
Langue: anglais
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
EUR 29,79
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : 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.
Edité par Oxford University Press, Incorporated, 1994
ISBN 10 : 0195086090 ISBN 13 : 9780195086096
Langue: anglais
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
EUR 29,79
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierEtat : Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Zebra Books, Cambridge, Royaume-Uni
EUR 24,07
Autre deviseQuantité 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 : PBShop.store UK, Fairford, GLOS, Royaume-Uni
EUR 48,86
Autre deviseQuantité disponible : 2 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 : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 52,41
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New. In.
Edité par Cambridge University Press 2021-02-28, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 47,28
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : New.
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 47,20
Autre deviseQuantité 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 : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
EUR 58,32
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New. 2021. Paperback. . . . . .
Edité par Cambridge University Press, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 45,24
Autre deviseQuantité disponible : 3 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 : GreatBookPrices, Columbia, MD, Etats-Unis
EUR 47,74
Autre deviseQuantité disponible : 3 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
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierKartoniert / Broschiert. Etat : 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, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 48,85
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierEtat : New.
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
Autre deviseQuantité 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 World Scientific Publishing Co Pte Ltd, 2002
ISBN 10 : 9810248970 ISBN 13 : 9789810248970
Langue: anglais
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
EUR 69,13
Autre deviseQuantité disponible : 15 disponible(s)
Ajouter au panierPAP. Etat : New. New Book. Shipped from UK. Established seller since 2000.
Edité par World Scientific Publishing Company, 2002
ISBN 10 : 9810248970 ISBN 13 : 9789810248970
Langue: anglais
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
EUR 64,97
Autre deviseQuantité disponible : 15 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 : GreatBookPricesUK, Woodford Green, Royaume-Uni
EUR 53,92
Autre deviseQuantité 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,86
Autre deviseQuantité disponible : 2 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,66
Autre deviseQuantité disponible : 2 disponible(s)
Ajouter au panierPaperback. Etat : Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Edité par Cambridge University Press, Cambridge, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : CitiRetail, Stevenage, Royaume-Uni
EUR 54,14
Autre deviseQuantité 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
EUR 79,49
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierhardcover. Etat : Very Good.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
EUR 98,24
Autre deviseQuantité disponible : 9 disponible(s)
Ajouter au panierHRD. Etat : New. New Book. Shipped from UK. Established seller since 2000.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
EUR 104,67
Autre deviseQuantité disponible : 9 disponible(s)
Ajouter au panierHRD. 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 : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 46,54
Autre deviseQuantité disponible : 7 disponible(s)
Ajouter au panierEtat : New.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
EUR 107,11
Autre deviseQuantité disponible : Plus de 20 disponibles
Ajouter au panierHardback. Etat : New. New copy - Usually dispatched within 4 working days. 610.
Edité par Cambridge University Press, 2021
ISBN 10 : 110883583X ISBN 13 : 9781108835831
Langue: anglais
Vendeur : Revaluation Books, Exeter, Royaume-Uni
EUR 108,96
Autre deviseQuantité disponible : 1 disponible(s)
Ajouter au panierHardcover. Etat : Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.
Edité par Cambridge University Press, Cambridge, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : AussieBookSeller, Truganina, VIC, Australie
EUR 89,87
Autre deviseQuantité 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Edité par Cambridge University Press, Cambridge, 2021
ISBN 10 : 1108798853 ISBN 13 : 9781108798853
Langue: anglais
Vendeur : Grand Eagle Retail, Fairfield, OH, Etats-Unis
EUR 57,57
Autre deviseQuantité 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.
EUR 114,28
Autre deviseQuantité 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 .