Posts Tagged ‘ textbook ’

Handbook of Applied Algorithms: Solving Scientific, Engineering, and Practical Problems by Amira Nayak

Discover the benefits of applying algorithms to solve scientific, engineering, and practical problems

Providing a combination of theory, algorithms, and simulations, Handbook of Applied Algorithms presents an all-encompassing treatment of applying algorithms and discrete mathematics to practical problems in “hot” application areas, such as computational biology, computational chemistry, wireless networks, and computer vision.

In eighteen self-contained chapters, this timely book explores:

  • Localized algorithms that can be used in topology control for wireless ad-hoc or sensor networks
  • Bioinformatics algorithms for analyzing data
  • Clustering algorithms and identification of association rules in data mining
  • Applications of combinatorial algorithms and graph theory in chemistry and molecular biology
  • Optimizing the frequency planning of a GSM network using evolutionary algorithms
  • Algorithmic solutions and advances achieved through game theory

Complete with exercises for readers to measure their comprehension of the material presented, Handbook of Applied Algorithms is a much-needed resource for researchers, practitioners, and students within computer science, life science, and engineering.

Amiya Nayak, PhD, has over seventeen years of industrial experience and is Full Professor at the School of Information Technology and Engineering at the University of Ottawa, Canada. He is on the editorial board of several journals. Dr. Nayak’s research interests are in the areas of fault tolerance, distributed systems/algorithms, and mobile ad-hoc networks. Ivan StojmenoviC?, PhD, is Professor at the University of Ottawa, Canada (, and Chair Professor of Applied Computing at the University of Birmingham, United Kingdom. Dr. Stojmenovic? received the Royal Society Wolfson Research Merit Award. His current research interests are mostly in the design and analysis of algorithms for wireless ad-hoc and sensor networks.


Quantum Computing: From Linear Algebra to Physical Realizations by Mikio Nakahara

Covering both theory and progressive experiments, Quantum Computing: From Linear Algebra to Physical Realizations explains how and why superposition and entanglement provide the enormous computational power in quantum computing. This self-contained, classroom-tested book is divided into two sections, with the first devoted to the theoretical aspects of quantum computing and the second focused on several candidates of a working quantum computer, evaluating them according to the DiVincenzo criteria.

Topics in Part I

  • Linear algebra
  • Principles of quantum mechanics
  • Qubit and the first application of quantum information processing—quantum key distribution
  • Quantum gates
  • Simple yet elucidating examples of quantum algorithms
  • Quantum circuits that implement integral transforms
  • Practical quantum algorithms, including Grover’s database search algorithm and Shor’s factorization algorithm
  • The disturbing issue of decoherence
  • Important examples of quantum error-correcting codes (QECC)

Topics in Part II

  • DiVincenzo criteria, which are the standards a physical system must satisfy to be a candidate as a working quantum computer
  • Liquid state NMR, one of the well-understood physical systems
  • Ionic and atomic qubits
  • Several types of Josephson junction qubits
  • The quantum dots realization of qubits

Looking at the ways in which quantum computing can become reality, this book delves into enough theoretical background and experimental research to support a thorough understanding of this promising field.


Distributed Computing: Principles, Algorithms, and Systems by Ajay D. Kshemkalyani

Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With state-of-the-art algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at

Comprehensive textbook covering the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. For advanced undergraduate and graduate students of electrical and computer engineering and computer science. Also of interest to practitioners in data networking, wireless networking, and sensor networks. Additional resources online:


Algorithmics: The Spirit of Computing, Third Edition by David Harel

This book presents the concepts, methods, and results that are fundamental to the science of computing. The book begins with the basic ideas of algorithms such as the structure and the methods of data manipulation, and then moves on to demonstrate how to design an accurate and efficient algorithm. Inherent limitations to algorithmic design are also discussed throughout the second part of the text. The third edition features an introduction to the object-oriented paradigm along with new approaches to computation. Anyone interested in being introduced to the theory of computer science.