Boca Raton: CRC Press LLC, 2000. — 1265 p. This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with permission, and sources are indicated. A wide variety of references are listed. Reasonable efforts have been made to publish reliable data and information, but the author and the publisher cannot assume responsibility...
Manning Publications, 2016. — 258 p. Grokking Algorithms is a fully illustrated, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. You'll start with sorting and searching and, as you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression and...
N.-Y.: Prentice Hall, 1997. - 312 p. It's main purpose is to show how to calculate programs. Describing an algebraic approach to programming based on a categorical calculus of relations, Algebra of Programming is suitable for the derivation of individual programs, and for the study of programming principles in general. The programming principles discussed are those paradigms...
Prentice-Hall, 1996. — 546 p. — ISBN: 0-13-335068-1. This is an introductory-level algorithm book. It includes worked-out examples and detailed proofs. Presents Algorithms by type rather than application. KEY TOPICS: Includes structured material by techniques employed, not by the application area, so readers can progress from the underlying abstract concepts to the concrete...
North-Holland, 1988, -500 p. During the 1890's, when Peano's five axioms were set afloat, a great effort was done to establish what functions are or are not what we can today algorithmically computable functions. Dedekind and Peano have been the first to use functions defined by induction, an important preliminary stage of the recursive function theory. The foundational...
Springer, 1999. — 533 p. — ISBN: 3-540-63369-3. A Source Book for the History of Mathematics, but one which offers a different perspective by focusing on algorithms. With the development of computing has come an awakening of interest in algorithms. Often neglegted by historians and modern scientists, more concerned with the nature of concepts, algorithmic procedures turn out to...
John Wiley, 2000, -506 p. Computational complexity theory has been a central area of theoretical computer science since its early development in the mid-1960s. Its subsequent rapid development in the next three decades has not only established itself as a rich, exciting theory but also shown strong influence on many other related areas in computer science, mathematics, and...
The MIT Press, 2017. — 336 p. — ISBN: 978-0262036634. Picture a computer scientist, staring at a screen and clicking away frantically on a keyboard, hacking into a system, or perhaps developing an app. Now delete that picture. In Once Upon an Algorithm, Martin Erwig explains computation as something that takes place beyond electronic computers, and computer science as the study...
W.H. Freeman, 1979. — 347 p. Few technical terms have gained such rapid notoriety as the appelation "NP-complete." In the short time since its introduction in the early 1970's, this term has come to symbolize the abyss of inherent intractability that algorithm designers increasingly face as they seek to solve larger and more complex problems. A wide variety of commonly...
Third Edition. — Boston: Birkhäuser, 1990. — 139 p. — ISBN: 0817635157, 978-0817635152. This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms,...
Birkhauser, 1981. - 107 p. A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in...
Birkhauser, 2008. — 132 p. — ISBN13: 978-0-8176-4728-5 e-ISBN13: 978-0-8176-4729-2. This monograph is derived from an advanced course in computer science at Stanford University on the analysis of algorithms. The course presents examples of the major paradigms used in the precise analysis of algorithms, emphasizing some of the more difficult techniques. Much of the material is...
Pearson Education, Inc., 2005. - 857 p. Introduction: Some representative problems. Basics of Algorithm Analysis. Graphs. Greedy Algorithms. Divide and Conquer. Dynamic Programming. Network Flow. NP and Computational Intractability. PSPACE: A Class of problems beyond NP. Extending the Limits of Tractability. Approximation Algorithms. Local Search. Randomized Algorithms.
D. Reidel, 1987. — 384 p. The purpose of this book is manyfold. It is intended both to present techniques useful in software engineering and to expose results of research on properties of these techniques. The major goal of the book is to help the reader in elaboration of his own views on foundations of computing. The present authors believe that semantics of programs will...
N.-Y.: Addison-Wesley, 1998. - 471 p. Taking a practical approach, this modern introduction to the theory of computation focuses on the study of problem solving through computation in the presence of realistic resource constraints. The Theory of Computation explores questions and methods that characterize theoretical computer science while relating all developments to practical...
Addison-Wesley, 1998. - 453 p. Taking a practical approach, this modern introduction to the theory of computation focuses on the study of problem solving through computation in the presence of realistic resource constraints. The Theory of Computation explores questions and methods that characterize theoretical computer science while relating all developments to practical issues...
Rnssd Warren Schaifer, 1992. — 91 p. Heapsort is a classical sorting algorithm doe to Williams. Given an array to sort, Heapsort first transforms the keys of the array into a heap. The heap is then sorted by repeatedly swapping the root of the heap with the last key in the bottom row, and then sifting this new root down to an appropriate position to restore heap order. This...
Bibliographisches Institut & F.A. Brockhaus AG, 1994. — 311 p. About ten years ago I have started my work on a voluminous book project with tentative title Computational Complexity and Fundamental Problems of Numerical Mathematics. One of the central goals with this project is a thorough development of my Splitting Circle Method for fast approximate factorization of complex...
American Mathematical Society, 2017. — 519 p. Basic notions and notation. Introduction. What is this book about? Plain Kolmogorov complexity. The complexity of pairs and conditional complexity. Martin-Löf randomness. A priori probability and prefix complexity. Monotone complexity. General scheme for complexities. Shannon entropy and Kolmogorov complexity. Some applications....
Second Edition. — Thomson Course Technology, 2006. — xx+432 p. — ISBN: 0-534-95097-3. This highly anticipated revision of Michael Sipser's popular text builds upon the strengths of the previous edition. It tells the fascinating story of the theory of computation-a subject with beautiful results and exciting unsolved questions at the crossroads of mathematics and computer...
Pearson Education Limited, 2003. — 423 p. The computation of patterns in strings is a fundamental requirement in many areas of science and information processing. The operation of a text editor, the lexical analysis of a computer program, the functioning of a finite automaton, the retrieval of information from a database - these are all activities which may require that...
Hoboken: Wiley, 2012. — 409 p. Offering an accessible approach to the topic, Theory of Computation focuses on the metatheory of computing and the theoretical boundaries between what various computational models can do and not do — from the most general model, the URM (Unbounded Register Machines), to the finite automaton. A wealth of programming-like examples and easy-to-follow...
Elsiever / MIT Press, 1990. — 1010 p. A comprehensive guide to the various types of complexity in algorithms and computations. Modern developments in computer and software systems have raised many challenging issues concerning the design and efficiency of complex programming applications. There is an increasing need for "advanced theory", to understand and exploit basic...
Society for Industrial and Applied Mathematics, 1980, -99 p. The two major problem areas which are the concern of Arithmetic Complexity of Computations are: What is the minimum number of arithmetic operations which are needed to perform the computation? How can we obtain a better algorithm when improvement is possible? These two questions are very large in scope, since they...
Comments