Mathematics for the аnalysis of аlgorithms Daniel H. Greene, Donald E. Knuth
Daniel H. Greene, Donald E. Knuth
ISBN: 3-7643-3515-7
Год: 1990
Издательство: Birkhauser
Город: Boston | Basel | Berlin
Количество страниц: 132
Язык: Английский
Формат: DJVU / RAR
Формат файла: RAR
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 drawn from the starred sections of The Art of Computer Programming, Volume 3 [Knuth III].
Analysis of algorithms, as a discipline, relies heavily on both computer science and mathematics. This report is a mathematical look at the synthesis—emphasizing the mathematical perspective, but using motivation and examples from computer science. It covers binomial identities, recurrence relations, operator methods and asymptotic analysis, hopefully in a format that is terse enough for easy reference and yet detailed enough to be of use to those who have not attended the lectures. However, it is assumed that the reader is familiar with the fundamentals of complex variable theory and combinatorial analysis.
Winter 1980 was the fourth offering of Analysis of Algorithms, and credit is due to the previous teachers and staff—Leo Guibas, Scott Drysdale, Sam Bent, Andy Yao, and Phyllis Winkler—for their detailed contributions to the documentation of the course. Portions of earlier handouts are incorporated in this monograph. Harry Mairson, Andrei Broder, Ken Clark-son, and Jeff Vitter contributed helpful comments and corrections, and the preparation of these notes was also aided by the facilities of Xerox corporation and the support of NSF and Hertz graduate fellowships.
In this third edition we have made a few improvements to the exposition and fixed a variety of minor errors. We have also added several new appendices containing exam problems from 1982 and 1988.
- Computational geometry. Algorithms and applications De Berg M.
Computational geometry emerged from the field of algorithms design and analysis in the late 1970s It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers The success of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains—computer graphics, geographic information systems (GIS), robotics, and others—in which geometric algorithms play a fundamental role - Mathematics formulary Wevers J.C.A.
- Handbook of analog computation Carlson A.
These notes on Analog Simulation have been developed from the experience gained by the Education and Training Department of EAI in presenting intensive short courses in analog computer operation, programming, and applications for nearly a decade The objective of these courses has been to provide scientists and engineers with a working knowledge of the analog computer and its uses - Библиотека алгоритмов Агеев М.П., Алик В.П., Марков Ю.И.
В книге приводятся описания алгоритмов по широкому кругу вопросов прикладной математики и программирования па алгоритмическом языке АЛГОЛ-60, публиковавшихся первоначально в журнале Communications of the АСМ» (США) под номерами 51—100, переведенных на русский язык, исправленных, улучшенных и отлаженных на ЭВМ авторами данного выпуска