An Introduction to the Analysis of Algorithms (3rd Edition)
Authors : Michael Soltys (California State University Channel Islands, USA)
Publisher : World Scientific
ISBN : 978-981-3235-90-8
Besides expositions on traditional algorithms such as Greedy, Dynamic Programming and Divide & Conquer, the book explores two classes of algorithms that are often overlooked in introductory textbooks: Randomised and Online algorithms — with emphasis placed on the algorithm itself. The book also covers algorithms in Linear Algebra, and the foundations of Computation.
The coverage of Randomized and Online algorithms is timely: the former have become ubiquitous due to the emergence of cryptography, while the latter are essential in numerous fields as diverse as operating systems and stock market predictions.
While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds, as well as all the necessary mathematical foundations. The programming exercises in Python will be available on the web (see http://www.msoltys.com/book for the companion web site).
Soltys consults with business and industry in the fields of Digital Forensics and Information Security, especially for SoCal HTTF (High Technology Task Force) and for Executek, where he is part of the executive leadership as director of IT. He regularly teaches courses in Cybersecurity and Algorithms.
All featured publishers and authors can avail of a free promotional interview on Enago Academy! Write to us now!