Importo totale (1 articolo articoli):
Destinazione ordine:
text algorithms di crochemore maxime (42 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (42)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (33)
- Come nuovo, Ottimo o Quasi ottimo (3)
- Molto buono o Buono (5)
- Discreto o Mediocre (1)
- Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)
Legatura
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (23)
- Non Print on Demand (38)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
125 Problems in Text Algorithms
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Books From California, Simi Valley, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
paperback. Condizione: Good.
-
Text Algorithms
Editore: Oxford University Press, Incorporated, 1994
ISBN 10: 0195086090 ISBN 13: 9780195086096
Lingua: Inglese
Da: Better World Books, Mishawaka, IN, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.
-
hardcover. 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!
-
Hardcover. Condizione: 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
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Zebra Books, Cambridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 23,39
EUR 22,71 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: Very Good. Publishers "DAMAGED" stamp to copyright page, otherwise minimal wear. VG+.
-
125 Problems in Text Algorithms : With Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
125 Problems in Text Algorithms
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
125 Problems in Text Algorithms
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 46,37
EUR 4,72 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
-
125 Problems in Text Algorithms : With Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition.
-
125 Problems in Text Algorithms (Paperback)
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
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.
-
125 Problems in Text Algorithms
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 49,27
EUR 13,60 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. In.
-
125 Problems in Text Algorithms : With Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 46,36
EUR 17,03 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloCondizione: New.
-
125 Problems in Text Algorithms
Editore: Cambridge University Press, GB, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 64,68
Gratis per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 45,87
EUR 17,03 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
-
125 Problems in Text Algorithms: with Solutions
Editore: Cambridge University Press 2021-02-28, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Chiron Media, Wallingford, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 45,95
EUR 17,59 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
-
125 Problems in Text Algorithms: with Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: Books From California, Simi Valley, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: Very Good.
-
125 Problems in Text Algorithms: with Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
EUR 56,67
EUR 10,50 per la spedizione da Irlanda a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. 2021. Paperback. . . . . .
-
125 Problems in Text Algorithms : With Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 52,46
EUR 17,03 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
125 Problems in Text Algorithms
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Condizione: new.
-
125 Problems in Text Algorithms: with Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 48,65
EUR 27,67 per la spedizione da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. New copy - Usually dispatched within 4 working days.
-
125 Problems in Text Algorithms: with Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 2021. Paperback. . . . . . Books ship from the US and Ireland.
-
125 Problems in Text Algorithms: with Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 70,91
EUR 17,03 per la spedizione da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 320 pages. 8.75x6.00x1.00 inches. In Stock.
-
125 Problems in Text Algorithms (Paperback)
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 47,93
EUR 42,01 per la spedizione da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. 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 our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
125 Problems in Text Algorithms : With Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 101,10
EUR 2,30 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
125 Problems in Text Algorithms (Hardcover)
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
125 Problems in Text Algorithms
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
EUR 54,70
EUR 48,99 per la spedizione da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: 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 (Paperback)
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
EUR 76,94
EUR 32,18 per la spedizione da Australia a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. 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 our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
-
125 Problems in Text Algorithms : With Solutions
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Lingua: Inglese
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 118,32
EUR 2,30 per la spedizione in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
125 Problems in Text Algorithms : with Solutions
Editore: Cambridge University Press Jul 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Lingua: Inglese
EUR 55,77
EUR 62,61 per la spedizione da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
