This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Prof. Dr. Helmut Knebl is a researcher and lecturer in the Faculty of Informatics of the Technische Hochschule Nürnberg Georg Simon Ohm, where he has taught courses on the topic of this book to students of computer science, media, and business informatics at bachelor's and master's levels. He is the coauthor of the successful textbook Introduction to Cryptography, now in its 3rd edition.
This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 12,41 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiGRATIS per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: Books From California, Simi Valley, CA, U.S.A.
paperback. Condizione: Very Good. Codice articolo mon0003678628
Quantità: 1 disponibili
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-325309
Quantità: 2 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Codice articolo 26390225158
Quantità: 1 disponibili
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-13576
Quantità: 1 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: New. Codice articolo 18390225164
Quantità: 1 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Codice articolo 389407449
Quantità: 1 disponibili
Da: ALLBOOKS1, Direk, SA, Australia
Codice articolo SHUB325309
Quantità: 1 disponibili
Da: moluna, Greven, Germania
Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm.This is a . Codice articolo 517241270
Quantità: Più di 20 disponibili
Da: ALLBOOKS1, Direk, SA, Australia
Codice articolo SHUB13576
Quantità: 1 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the extent needed for the implementation of the algorithms. The specific algorithms examined were chosen because of their wide field of application.This book originates from lectures for undergraduate and graduate students. The text assumes experience in programming algorithms, especially with elementary data structures such as chained lists, queues, and stacks. It also assumes familiarity with mathematical methods, although the author summarizes some basic notations and results from probability theory and related mathematical terminology in the appendices. He includes many examples to explain the individual steps of the algorithms, and he concludes each chapter with numerous exercises. 364 pp. Englisch. Codice articolo 9783030597603
Quantità: 2 disponibili