Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Books From California, Simi Valley, CA, U.S.A.
paperback. Condizione: Good.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Zebra Books, Cambridge, Regno Unito
EUR 23,34
Quantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 46,27
Quantità: 1 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: 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.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 49,17
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. In.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
EUR 45,77
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 46,26
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Cambridge University Press 2021-02-28, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Chiron Media, Wallingford, Regno Unito
EUR 45,85
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Editore: Cambridge University Press, GB, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 64,39
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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).
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 56,67
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. 2021. Paperback. . . . . .
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: Books From California, Simi Valley, CA, U.S.A.
hardcover. Condizione: Very Good.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 52,33
Quantità: 2 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GoldBooks, Denver, CO, U.S.A.
Condizione: new.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: New. 2021. Paperback. . . . . . Books ship from the US and Ireland.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
EUR 70,23
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 100,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New.
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: moluna, Greven, Germania
EUR 54,70
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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 .
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: 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.
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 117,11
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Editore: Cambridge University Press Jul 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 55,77
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 105,10
Quantità: Più di 20 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
Editore: Cambridge University Press, GB, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Rarewaves.com UK, London, Regno Unito
EUR 57,94
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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).
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: preigu, Osnabrück, Germania
EUR 61,50
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
EUR 147,62
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.
EUR 110,68
Quantità: 5 disponibili
Aggiungi al carrelloCondizione: 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 .
Editore: Cambridge University Press Jul 2021, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 151,80
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware - Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.