Importo totale (1 articolo articoli):
Destinazione ordine:
125 problems text algorithms di crochemore maxime (33 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (33)
- 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 (26)
- Come nuovo, Ottimo o Quasi ottimo (3)
- Molto buono o Buono (3)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (1)
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 (13)
- Non Print on Demand (28)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
125 Problems in Text Algorithms: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Bahamut Media, Reading, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 11,86
Spedizione EUR 8,05
Spedito da Regno Unito a U.S.A.Quantità: 5 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.
-
125 Problems in Text Algorithms
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Books From California, Simi Valley, CA, U.S.A.
Valutazione del venditore 4 su 5 stelle
paperback. Condizione: Good.
-
125 Problems in Text Algorithms: with Solutions [Paperback] [Jul 01, 2021] Crochemore, Maxime
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Zebra Books, Cambridge, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 23,77
Spedizione EUR 23,08
Spedito 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
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Book Grocer, Tullamarine, VIC, Australia
Valutazione del venditore 5 su 5 stelle
EUR 22,22
Spedizione EUR 25,73
Spedito da Australia a U.S.A.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.
-
125 Problems in Text Algorithms : With Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
125 Problems in Text Algorithms (Paperback)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
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
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New.
-
125 Problems in Text Algorithms : With Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
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: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 49,06
Spedizione EUR 17,31
Spedito 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
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 73,77
Spedizione EUR 17,31
Spedito 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: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 320.
-
125 Problems in Text Algorithms (Paperback)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 52,28
Spedizione EUR 42,69
Spedito 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
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 90,85
Spedizione EUR 7,50
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New. pp. 320.
-
125 Problems in Text Algorithms
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
EUR 57,96
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 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 : With Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 114,10
Spedizione EUR 2,26
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
125 Problems in Text Algorithms: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 4 su 5 stelle
EUR 116,59
Spedizione gratuita
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
125 Problems in Text Algorithms (Paperback)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
Da: AussieBookSeller, Truganina, VIC, Australia
Valutazione del venditore 5 su 5 stelle
EUR 85,61
Spedizione EUR 31,73
Spedito 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
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 105,42
Spedizione EUR 13,82
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
125 Problems in Text Algorithms : With Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 118,30
Spedizione EUR 2,26
Spedito 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
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 105,41
Spedizione EUR 17,31
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
125 Problems in Text Algorithms : With Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 117,73
Spedizione EUR 17,31
Spedito da Regno Unito a 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
Lingua: Inglese
Editore: Cambridge University Press Sep 2021, 2021
ISBN 10: 1108798853 ISBN 13: 9781108798853
EUR 76,91
Spedizione EUR 62,61
Spedito da Germania a U.S.A.Quantità: 1 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.
-
125 Problems in Text Algorithms: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 154,65
Spedizione EUR 14,42
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock.
-
125 Problems in Text Algorithms: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New.
-
125 Problems in Text Algorithms: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 194,65
Spedizione EUR 7,50
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: New.
-
125 Problems in Text Algorithms
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
EUR 141,42
Spedizione EUR 63,57
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Worked problems offer an interesting way to learn and practice with key concepts of string algorithms and combinatorics on words.
-
125 Problems in Text Algorithms: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 202,39
Spedizione EUR 9,00
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2021. Hardcover. . . . . . Books ship from the US and Ireland.
-
125 Problems in Text Algorithms: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
EUR 230,52
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. 2021. Hardcover. . . . . .
-
125 Problems in Text Algorithms (Hardcover)
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
125 Problems in Text Algorithms: with Solutions
Lingua: Inglese
Editore: Cambridge University Press, 2021
ISBN 10: 110883583X ISBN 13: 9781108835831
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 112,85
Spedizione EUR 14,42
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 320 pages. 9.17x6.22x0.94 inches. In Stock. This item is printed on demand.
