Order Total (1 Item Items):
Shipping Destination:
Text Algorithms by Crochemore Maxime (43 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (43)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (34)
- As New, Fine or Near Fine (3)
- Very Good or Good (5)
- Fair or Poor (1)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (23)
- Not Print on Demand (39)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
125 Problems in Text Algorithms
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Seller: Books From California, Simi Valley, CA, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Good.
-
Text Algorithms
Published by Oxford University Press, Incorporated, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
Language: English
Condition: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
-
Text Algorithms
Published by Oxford University Press, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
Language: English
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!
-
Text Algorithms
Published by Oxford University Press, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
Language: English
Hardcover. Condition: Fair. No Jacket. Missing dust jacket; Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.
-
125 Problems in Text Algorithms: with Solutions [Paperback] Crochemore, Maxime
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
paperback. Condition: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
-
125 Problems in Text Algorithms : With Solutions
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Condition: New.
-
125 Problems in Text Algorithms
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Condition: New.
-
125 Problems in Text Algorithms
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
125 Problems in Text Algorithms : With Solutions
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Condition: As New. Unread book in perfect condition.
-
125 Problems in Text Algorithms (Paperback)
Published by Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Paperback. Condition: 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.
-
125 Problems in Text Algorithms
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In.
-
125 Problems in Text Algorithms: with Solutions
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Paperback. Condition: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
-
125 Problems in Text Algorithms
Published by Cambridge University Press, GB, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: 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).
-
125 Problems in Text Algorithms: with Solutions
Published by Cambridge University Press 2021-02-28, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Paperback. Condition: New.
-
125 Problems in Text Algorithms : With Solutions
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Jewels Of Stringology: Text Algorithms
Published by World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Language: English
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
125 Problems in Text Algorithms: with Solutions
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Language: English
Seller: Books From California, Simi Valley, CA, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Very Good.
-
125 Problems in Text Algorithms: with Solutions
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. 2021. Paperback. . . . . .
-
125 Problems in Text Algorithms : With Solutions
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
125 Problems in Text Algorithms
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Condition: new.
-
125 Problems in Text Algorithms: with Solutions
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Condition: New. 2021. Paperback. . . . . . Books ship from the US and Ireland.
-
125 Problems in Text Algorithms: with Solutions
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Paperback. Condition: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
-
125 Problems in Text Algorithms (Paperback)
Published by Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Paperback. Condition: 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.
-
125 Problems in Text Algorithms : With Solutions
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Language: English
Condition: New.
-
125 Problems in Text Algorithms (Hardcover)
Published by Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Language: English
Hardcover. Condition: 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.
-
125 Problems in Text Algorithms: with Solutions
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Language: English
Condition: New.
-
125 Problems in Text Algorithms
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Condition: 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 .
-
125 Problems in Text Algorithms: with Solutions
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Language: English
Condition: New.
-
125 Problems in Text Algorithms (Paperback)
Published by Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Language: English
Paperback. Condition: 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.
-
125 Problems in Text Algorithms : With Solutions
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Language: English
Condition: As New. Unread book in perfect condition.
