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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
£ 4.38 shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condition: As New. 1st ed. 2020. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 3030597601-10-1
Quantity: 1 available
Seller: Books From California, Simi Valley, CA, U.S.A.
paperback. Condition: Very Good. Seller Inventory # mon0003678628
Quantity: 1 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. Seller Inventory # 389407449
Quantity: 1 available
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-325309
Quantity: 2 available
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-13576
Quantity: 1 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. Seller Inventory # 26390225158
Quantity: 1 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. Seller Inventory # 18390225164
Quantity: 1 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9783030597603
Quantity: 10 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783030597603_new
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9783030597603
Quantity: 2 available