Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: AwesomeBooks, Wallingford, Regno Unito
EUR 11,88
Quantità: 6 disponibili
Aggiungi al carrelloCondizione: 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. .
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Bahamut Media, Reading, Regno Unito
EUR 11,88
Quantità: 6 disponibili
Aggiungi al carrelloCondizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Books From California, Simi Valley, CA, U.S.A.
paperback. Condizione: Good.
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Books From California, Simi Valley, CA, U.S.A.
hardcover. Condizione: Very Good.
Lingua: Inglese
Editore: World Scientific Publishing Company, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Da: Greenworld Books, Arlington, TX, U.S.A.
Condizione: very_good. Fast Free Shipping â" Very Good condition book with a firm cover and clean pages. Shows normal use and some light wear or limited notes markings. A solid, nice copy to enjoy.
paperback. Condizione: Very Good. Paperback. Bottom right corner of front cover is creased. Otherwise, clean and solid. Ships from a smoke-free home.
Lingua: Inglese
Editore: World Scientific Publishing Comp, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Da: HPB-Red, Dallas, TX, U.S.A.
paperback. Condizione: 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!
Lingua: Inglese
Editore: World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Da: WeBuyBooks, Rossendale, LANCS, Regno Unito
EUR 31,32
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Zebra Books, Cambridge, Regno Unito
EUR 23,80
Quantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Book Grocer, Tullamarine, VIC, Australia
EUR 22,15
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. 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.
Lingua: Inglese
Editore: World Scientific Publishing Company, 2002
ISBN 10: 9810247826 ISBN 13: 9789810247829
Da: Recycle Bookstore, San Jose, CA, U.S.A.
Hardcover. Condizione: Very Good. Book has mild rubbing and smudges to covers, inward bends to outer corners, cut out top corner section of front endpage. otherwise in very good condition, strong binding, bright and unmarked pages; some cosmetic wear but an overall sturdy copy with clean interiors. On the lower end of very good due to alteration to front endpage.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 50,63
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: California Books, Miami, FL, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 54,82
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press 11/6/2014, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Da: BargainBookStores, Grand Rapids, MI, U.S.A.
Paperback or Softback. Condizione: New. Algorithms on Strings. Book.
Lingua: Inglese
Editore: Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Da: California Books, Miami, FL, U.S.A.
EUR 58,83
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2014
ISBN 10: 1107670993 ISBN 13: 9781107670990
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 60,48
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 61,49
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New. pp. 464.
EUR 57,47
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 464 Illus.
Lingua: Inglese
Editore: World Scientific Publishing Company, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 63,23
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Lingua: Inglese
Editore: World Scientific Publishing Co Pte Ltd, SG, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Da: Rarewaves.com USA, London, LONDO, Regno Unito
EUR 65,55
Quantità: 12 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Lingua: Inglese
Editore: World Scientific Publishing Co Pte Ltd, 2002
ISBN 10: 9810248970 ISBN 13: 9789810248970
Da: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Revaluation Books, Exeter, Regno Unito
EUR 49,13
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 50,12
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 53,98
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 53,98
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.