Algorithms and Theory of Computation Handbook - 2 Volume Set
- ISBN-10
- 1439832331
- ISBN-13
- 9781439832332
- Category
- Computers
- Pages
- 1944
- Language
- English
- Published
- 2022-05-30
- Publisher
- CRC Press
- Authors
- Mikhail J. Atallah, Marina Blanton
Description
Algorithms and Theory of Computation Handbook, Second Edition in a two volume set, 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. New to the Second Edition: Along with updating and revising many of the existing chapters, this second edition contains more than 20 new chapters. This edition now covers external memory, parameterized, self-stabilizing, and pricing algorithms as well as the theories of algorithmic coding, privacy and anonymity, databases, computational games, and communication networks. It also discusses computational topology, computational number theory, 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
Get the book
Similar books
-
Algorithms and Theory of Computation Handbook, Second Edition - 2 Volume Set
By Mikhail J. Atallah, Marina BlantonThis edition now covers external memory, parameterized, self-stabilizing, and pricing algorithms as well as the theories of algorithmic coding, privacy and anonymity, databases, computational games, and communication networks.
-
Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques
By Mikhail J. Atallah, Marina BlantonThis handbook provides an up-to-date compendium of fundamental computer science topics, techniques, and applications. Along with updating and revising many of the existing chapters, this second edition contains more than 15 new chapters.
-
Algorithms and Theory of Computation Handbook, Second Edition, Volume 2: Special Topics and Techniques
By Mikhail J. Atallah, Marina BlantonAlgorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques.
-
Algorithms and Theory of Computation Handbook, Second Edition: Special Topics and Techniques
By Mikhail J. Atallah, Marina BlantonThis edition now covers self-stabilizing and pricing algorithms as well as the theories of privacy and anonymity, databases, computational games, and communication networks.
-
Algorithms and Theory of Computation Handbook, Second Edition, Volume 1: General Concepts and Techniques
By Mikhail J. Atallah, Marina BlantonThis best-selling handbook continues to help computer professionals and engineers find significant information on various algorithmic topics.
-
Algorithms and Theory of Computation Handbook
By Mikhail J. Atallah[ 50 ] Steele , J.M. , Probability Theory and Combinatorial Optimization , SIAM , Philadelphia , PA , 1997 . [ 51 ] Szpankowski , W. , Solution of a Linear Recurrence Equation Arising in the Analysis of Some ...
-
Algorithms and Theory of Computation Handbook, Second Edition, Volume 1: General Concepts and Techniques
By Mikhail J. Atallah, Marina BlantonFor example, Rosser and Schoenfeld [RS62] proved that n lnn ( 1 + 1 2 lnn ) < π(n) < n lnn ( 1 + 3 2 lnn ) for all n ≥ 59. Rosser [Ros39] proved in 1939 that the nth prime is ... Let li(x) = x0 dylny denote the logarithmic integral.
-
Algorithms and Theory of Computation Handbook, Second Edition, Volume 1: General Concepts and Techniques
By Mikhail J. Atallah, Marina BlantonThis handbook provides an up-to-date compendium of fundamental computer science topics and techniques.
-
Limits of Computation: An Introduction to the Undecidable and the Intractable
By Edna E. Reiter, Clayton Matthew Johnsonbecomes “Given this chess board and a suggested move, can White force a win by making this move?” In all cases that we will use, there are an infinite number of possible inputs, which are divided into the yes instances and the no ...
-
Computational Complexity: A Modern Approach
By Sanjeev Arora, Boaz BarakNew and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.