Order Total (1 Item Items):
Shipping Destination:
Text Algorithms by Crochemore Maxime (39 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (39)
- 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 (28)
- As New, Fine or Near Fine (2)
- Very Good or Good (8)
- 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 (17)
- Not Print on Demand (35)
Language (1)
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.
-
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.
-
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
US$ 28.05
US$ 27.24 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketpaperback. 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.
-
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.
-
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.
-
125 Problems in Text Algorithms
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Condition: new.
-
125 Problems in Text Algorithms: with Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
US$ 55.02
US$ 20.43 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
-
125 Problems in Text Algorithms: with Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Seller: Books From California, Simi Valley, CA, U.S.A.
Seller rating 4 out of 5 stars
hardcover. Condition: Very Good.
-
Jewels Of Stringology: Text Algorithms
Language: English
Published by World Scientific Publishing Co Pte Ltd, SG, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. The term "stringology" is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as "algorithmic jewels" and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.
-
Jewels Of Stringology: Text Algorithms
Language: English
Published by World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Jewels Of Stringology: Text Algorithms
Language: English
Published by World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
US$ 94.85
US$ 5.67 shipping
Ships from United Kingdom to U.S.A.Quantity: 15 available
Add to basketPAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
125 Problems in Text Algorithms: with Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
US$ 81.36
US$ 20.43 shipping
Ships from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
-
125 Problems in Text Algorithms : With Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Condition: New.
-
125 Problems in Text Algorithms: with Solutions
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Condition: New.
-
125 Problems in Text Algorithms
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Kartoniert / Broschiert. 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
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Condition: New.
-
125 Problems in Text Algorithms (Hardcover)
Language: English
Published by Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
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
Language: English
Published by Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Condition: As New. Unread book in perfect condition.
-
Jewels Of Stringology: Text Algorithms
Language: English
Published by World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810247826 ISBN 13: 9789810247829
HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
125 Problems in Text Algorithms : With Solutions
Language: English
Published by Cambridge University Press Jul 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Taschenbuch. Condition: 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.
-
Jewels Of Stringology: Text Algorithms
Language: English
Published by World Scientific Publishing Co Pte Ltd, SG, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
US$ 81.24
US$ 88.52 shipping
Ships from United Kingdom to U.S.A.Quantity: 13 available
Add to basketPaperback. Condition: New. The term "stringology" is a popular nickname for text algorithms, or algorithms on strings. This book deals with the most basic algorithms in the area. Most of them can be viewed as "algorithmic jewels" and deserve reader-friendly presentation. One of the main aims of the book is to present several of the most celebrated algorithms in a simple way by omitting obscuring details and separating algorithmic structure from combinatorial theoretical background. The book reflects the relationships between applications of text-algorithmic techniques and the classification of algorithms according to the measures of complexity considered. The text can be viewed as a parade of algorithms in which the main purpose is to discuss the foundations of the algorithms and their interconnections. One can partition the algorithmic problems discussed into practical and theoretical problems. Certainly, string matching and data compression are in the former class, while most problems related to symmetries and repetitions in texts are in the latter. However, all the problems are interesting from an algorithmic point of view and enable the reader to appreciate the importance of combinatorics on words as a tool in the design of efficient text algorithms.In most textbooks on algorithms and data structures, the presentation of efficient algorithms on words is quite short as compared to issues in graph theory, sorting, searching, and some other areas. At the same time, there are many presentations of interesting algorithms on words accessible only in journals and in a form directed mainly at specialists. This book fills the gap in the book literature on algorithms on words, and brings together the many results presently dispersed in the masses of journal articles. The presentation is reader-friendly; many examples and about two hundred figures illustrate nicely the behaviour of otherwise very complex algorithms.
-
Jewels Of Stringology: Text Algorithms
Language: English
Published by World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810247826 ISBN 13: 9789810247829
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
US$ 176.40
US$ 6.84 shipping
Ships from United Kingdom to U.S.A.Quantity: 15 available
Add to basketHRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.
