Home » Algorithms and Theory of Computation Handbook, Volume 2
Product Image

Algorithms and Theory of Computation Handbook, Volume 2

€78.99
Quantity:
Ships in 10-20 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
advanced algorithmic applications
Category=PBCD
Category=UMB
communication networks theory
Computation Handbook
Computational Geometry
computational topology
Congestion Games
Convex Hull
database query languages
DES
Discrete Log Problem
Discrete Logarithm
DNA computing methods
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Finals Page
Hash Function
Hash Table
Homomorphic Encryption
Intersection Grammar
Linear Feedback Shift Registers
Minimum Steiner Tree
Parallel Algorithms
Pram
privacy theory
Public Key
Rectilinear Polygon
Secret Sharing Schemes
self-stabilising algorithms
Shortest Path
Simple Polygon
Steiner Tree
Stream Cipher
Substitution Ciphers
Voronoi Diagram

Product details

  • ISBN 9780367384845
  • Weight: 453g
  • Dimensions: 174 x 246mm
  • Publication Date: 18 Oct 2019
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
Secure checkout Fast Shipping Easy returns
Description

Algorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques. It also illustrates how the topics and techniques come together to deliver efficient solutions to important practical problems.

Along with updating and revising many of the existing chapters, this second edition contains more than 15 new chapters. This edition now covers self-stabilizing and pricing algorithms as well as the theories of privacy and anonymity, databases, computational games, and communication networks. It also discusses computational topology, natural language processing, and grid computing and explores applications in intensity-modulated radiation therapy, voting, DNA research, systems biology, and financial derivatives.

This best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics. The expert contributors clearly define the terminology, present basic results and techniques, and offer a number of current references to the in-depth literature. They also provide a glimpse of the major research issues concerning the relevant topics.
About

Mikhail J. Atallah is a distinguished professor of computer science at Purdue University. Marina Blanton is an assistant professor in the computer science and engineering department at the University of Notre Dame.