Order Total (1 Item Items):
Shipping Destination:
Crochemore Maxime (197 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (197)
- 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 (153)
- As New, Fine or Near Fine (25)
- Very Good or Good (17)
- Fair or Poor (2)
- As Described (No further results match this refinement)
Collectible Attributes
- First Edition (3)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (92)
- Not Print on Demand (142)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
125 Problems in Text Algorithms: with Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Condition: Very Good. 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. .
-
125 Problems in Text Algorithms: with Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Condition: 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.
-
125 Problems in Text Algorithms
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Seller: Books From California, Simi Valley, CA, U.S.A.
Seller rating 4 out of 5 stars
paperback. Condition: Good.
-
Text Algorithms
Language: English
Published by Oxford University Press, Incorporated, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
Condition: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
-
Perfect Paperback. Condition: Very Good. ***please read*** no marks - my shelf location bn4-b-1*.
-
Combinatorial Pattern Matching: 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings (Lecture Notes in Computer Science, 3537)
Seller: Michael Knight, Bookseller, Forest Grove, OR, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Very Good. Paperback. Bottom right corner of front cover is creased. Otherwise, clean and solid. Ships from a smoke-free home.
-
Jewels Of Stringology: Text Algorithms
Language: English
Published by World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Condition: Very Good. Most items will be dispatched the same or the next working day. A copy that has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.
-
Algorithms on Strings
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Paperback. 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!
-
Jewels of Stringology
Language: English
Published by World Scientific Publishing Company, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Condition: acceptable. Fast & Free Shipping â" A well-loved copy with text fully readable and cover pages intact. May display wear such as writing, highlighting, bends, folds or library marks. Still a complete and usable book.
-
Jewels of Stringology
Language: English
Published by World Scientific Publishing Comp, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
paperback. 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!
-
125 Problems in Text Algorithms: with Solutions [Paperback] [Jul 01, 2021] Crochemore, Maxime
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
paperback. Condition: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
-
125 Problems in Text Algorithms : With Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Condition: New.
-
125 Problems in Text Algorithms
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Condition: New.
-
Text Algorithms
Language: English
Published by Oxford University Press, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
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
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Condition: New.
-
Algorithms on Strings
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Condition: New.
-
Algorithms on Strings
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Condition: New.
-
Algorithms on Strings (Paperback or Softback)
Language: English
Published by Cambridge University Press 11/6/2014, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Paperback or Softback. Condition: New. Algorithms on Strings. Book.
-
Text Algorithms
Language: English
Published by Oxford University Press, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
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!
-
125 Problems in Text Algorithms : With Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Condition: As New. Unread book in perfect condition.
-
-
-
-
-
-
-
-
-
Algorithms on Strings
Language: English
Published by Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Condition: New.
-
125 Problems in Text Algorithms (Paperback)
Language: English
Published by Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
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.
