Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Books From California, Simi Valley, CA, USA
paperback. Zustand: Good.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Zebra Books, Cambridge, Vereinigtes Königreich
EUR 23,43
Anzahl: 1 verfügbar
In den Warenkorbpaperback. Zustand: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 46,46
Anzahl: 1 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition.
Verlag: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: 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.
Verlag: Cambridge University Press, GB, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
EUR 62,59
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: 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).
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 49,37
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. In.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 45,96
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 46,45
Anzahl: 2 verfügbar
In den WarenkorbZustand: New.
Verlag: Cambridge University Press 2021-02-28, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
EUR 46,04
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: New.
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Sprache: Englisch
Anbieter: Books From California, Simi Valley, CA, USA
hardcover. Zustand: Very Good.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. 2021. Paperback. . . . . .
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 52,57
Anzahl: 2 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: GoldBooks, Denver, CO, USA
Zustand: new.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. 2021. Paperback. . . . . . Books ship from the US and Ireland.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 70,76
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Sprache: Englisch
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 100,99
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Sprache: Englisch
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New.
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: moluna, Greven, Deutschland
Zustand: 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 .
Verlag: Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Sprache: Englisch
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Hardcover. Zustand: 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.
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Sprache: Englisch
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 118,12
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Verlag: Cambridge University Press Jul 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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.
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Sprache: Englisch
Anbieter: THE SAINT BOOKSTORE, Southport, Vereinigtes Königreich
EUR 105,54
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHardback. Zustand: New. New copy - Usually dispatched within 4 working days.
Verlag: Cambridge University Press, GB, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: Rarewaves.com UK, London, Vereinigtes Königreich
EUR 58,18
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: 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).
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Sprache: Englisch
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: 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.
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Sprache: Englisch
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 148,72
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.
Zustand: 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 .
Verlag: Cambridge University Press Jul 2021, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Neuware - Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.