Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: AwesomeBooks, Wallingford, Vereinigtes Königreich
EUR 11,89
Anzahl: 5 verfügbar
In den Warenkorbhardcover. Zustand: 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. .
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: Bahamut Media, Reading, Vereinigtes Königreich
EUR 11,89
Anzahl: 5 verfügbar
In den WarenkorbZustand: 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.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: Books From California, Simi Valley, CA, USA
paperback. Zustand: Good.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: Zebra Books, Cambridge, Vereinigtes Königreich
EUR 23,82
Anzahl: 1 verfügbar
In den Warenkorbpaperback. Zustand: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: Book Grocer, Tullamarine, VIC, Australien
Paperback. 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.
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
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.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: California Books, Miami, FL, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 49,16
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 73,89
Anzahl: 2 verfügbar
In den WarenkorbPaperback. Zustand: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 320.
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
EUR 52,38
Anzahl: 1 verfügbar
In den WarenkorbPaperback. 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 91,19
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 320.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: moluna, Greven, Deutschland
EUR 57,96
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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 .
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 114,55
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: California Books, Miami, FL, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Anbieter: AussieBookSeller, Truganina, VIC, Australien
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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 104,83
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: GreatBookPrices, Columbia, MD, USA
EUR 117,51
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 104,82
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 117,96
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Cambridge University Press Sep 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
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.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 154,95
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: Books Puddle, New York, NY, USA
Zustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: 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.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 195,37
Anzahl: 1 verfügbar
In den WarenkorbZustand: New.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 203,14
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2021. Hardcover. . . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
EUR 230,52
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. 2021. Hardcover. . . . . .
Sprache: Englisch
Verlag: Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.