Introduction to Algorithms

Author: Udi Manber
Publisher: Addison Wesley
ISBN: 0201120372
Release Date: 1989-01-01
Genre: Computers

This book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithm development. The heart of the creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples. It is designed to enhance the reader's problem-solving abilities and understanding of the principles behind algorithm design. 0201120372B04062001

Algorithmen Eine Einf hrung

Author: Thomas H. Cormen
Publisher: Walter de Gruyter GmbH & Co KG
ISBN: 9783110522013
Release Date: 2013-01-01
Genre: Computers

Der "Cormen" bietet eine umfassende und vielseitige Einführung in das moderne Studium von Algorithmen. Es stellt viele Algorithmen Schritt für Schritt vor, behandelt sie detailliert und macht deren Entwurf und deren Analyse allen Leserschichten zugänglich. Sorgfältige Erklärungen zur notwendigen Mathematik helfen, die Analyse der Algorithmen zu verstehen. Den Autoren ist es dabei geglückt, Erklärungen elementar zu halten, ohne auf Tiefe oder mathematische Exaktheit zu verzichten. Jedes der weitgehend eigenständig gestalteten Kapitel stellt einen Algorithmus, eine Entwurfstechnik, ein Anwendungsgebiet oder ein verwandtes Thema vor. Algorithmen werden beschrieben und in Pseudocode entworfen, der für jeden lesbar sein sollte, der schon selbst ein wenig programmiert hat. Zahlreiche Abbildungen verdeutlichen, wie die Algorithmen arbeiten. Ebenfalls angesprochen werden Belange der Implementierung und andere technische Fragen, wobei, da Effizienz als Entwurfskriterium betont wird, die Ausführungen eine sorgfältige Analyse der Laufzeiten der Programme mit ein schließen. Über 1000 Übungen und Problemstellungen und ein umfangreiches Quellen- und Literaturverzeichnis komplettieren das Lehrbuch, dass durch das ganze Studium, aber auch noch danach als mathematisches Nachschlagewerk oder als technisches Handbuch nützlich ist. Für die dritte Auflage wurde das gesamte Buch aktualisiert. Die Änderungen sind vielfältig und umfassen insbesondere neue Kapitel, überarbeiteten Pseudocode, didaktische Verbesserungen und einen lebhafteren Schreibstil. So wurden etwa - neue Kapitel zu van-Emde-Boas-Bäume und mehrfädigen (engl.: multithreaded) Algorithmen aufgenommen, - das Kapitel zu Rekursionsgleichungen überarbeitet, sodass es nunmehr die Teile-und-Beherrsche-Methode besser abdeckt, - die Betrachtungen zu dynamischer Programmierung und Greedy-Algorithmen überarbeitet; Memoisation und der Begriff des Teilproblem-Graphen als eine Möglichkeit, die Laufzeit eines auf dynamischer Programmierung beruhender Algorithmus zu verstehen, werden eingeführt. - 100 neue Übungsaufgaben und 28 neue Problemstellungen ergänzt. Umfangreiches Dozentenmaterial (auf englisch) ist über die Website des US-Verlags verfügbar.

Design And Analysis Of Algorithms

Author: V.V. Muniswamy
Publisher: I. K. International Pvt Ltd
ISBN: 9789380026732
Release Date: 2009-01-01
Genre:

This book is designed for the way we learn and intended for one-semester course in Design and Analysis of Algorithms . This is a very useful guide for graduate and undergraduate students and teachers of computer science. This book provides a coherent and pedagogically sound framework for learning and teaching. Its breadth of coverage insures that algorithms are carefully and comprehensively discussed with figures and tracing of algorithms. Carefully developing topics with sufficient detail, this text enables students to learn about concepts on their own, offering instructors flexibility and allowing them to use the text as lecture reinforcement.Key Features:" Focuses on simple explanations of techniques that can be applied to real-world problems." Presents algorithms with self-explanatory pseudocode." Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers." Includes chapter summary, self-test quiz and exercises at the end of each chapter. Key to quizzes and solutions to exercises are given in appendices.

Data Structures Algorithm Analysis in C

Author: Clifford A. Shaffer
Publisher: Courier Corporation
ISBN: 9780486485829
Release Date: 2011
Genre: Computers

A comprehensive treatment focusing on the creation of efficient data structures and algorithms, this text explains how to select or design the data structure best suited to specific problems. It uses C++ as the programming language and is suitable for second-year data structure courses and computer science courses in algorithmic analysis.

Der Turing Omnibus

Author: A.K. Dewdney
Publisher: Springer-Verlag
ISBN: 9783642788727
Release Date: 2013-03-12
Genre: Computers

Der Turing Omnibus macht in 66 exzellent geschriebenen Beiträgen Station bei den interessantesten Themen aus der Informatik, der Computertechnologie und ihren Anwendungen.

Mastering Algorithms with Perl

Author: Jarkko Hietaniemi
Publisher: "O'Reilly Media, Inc."
ISBN: 1449307191
Release Date: 1999-08-18
Genre: Computers

Many programmers would love to use Perl for projects that involve heavy lifting, but miss the many traditional algorithms that textbooks teach for other languages. Computer scientists have identified many techniques that a wide range of programs need, such as: Fuzzy pattern matching for text (identify misspellings!) Finding correlations in data Game-playing algorithms Predicting phenomena such as Web traffic Polynomial and spline fitting Using algorithms explained in this book, you too can carry out traditional programming tasks in a high-powered, efficient, easy-to-maintain manner with Perl.This book assumes a basic understanding of Perl syntax and functions, but not necessarily any background in computer science. The authors explain in a readable fashion the reasons for using various classic programming techniques, the kind of applications that use them, and -- most important -- how to code these algorithms in Perl.If you are an amateur programmer, this book will fill you in on the essential algorithms you need to solve problems like an expert. If you have already learned algorithms in other languages, you will be surprised at how much different (and often easier) it is to implement them in Perl. And yes, the book even has the obligatory fractal display program.There have been dozens of books on programming algorithms, some of them excellent, but never before has there been one that uses Perl.The authors include the editor of The Perl Journal and master librarian of CPAN; all are contributors to CPAN and have archived much of the code in this book there."This book was so exciting I lost sleep reading it." Tom Christiansen

Teubner Taschenbuch der Mathematik 2 2003

Author: Günter Grosche
Publisher: Springer-Verlag
ISBN: 3519210088
Release Date: 2003-11-26
Genre: Mathematics

Das Teubner-Taschenbuch der Mathematik erfüllt aktuell, umfassend und kompakt alle Erwartungen, die an ein mathematisches Nachschlagewerk gestellt werden. Es vermittelt ein lebendiges und modernes Bild der heutigen Mathematik. Als Handbuch begleitet es die Studierenden vom ersten Semester an und der Praktiker nutzt es als unentbehrliches Nachschlagewerk. Der Teil II dieses erfolgreichen Werkes behandelt die vielfältigen Anwendungen der Mathematik in Informatik, Operations Research und mathematischer Physik. Das thematische Spektrum reicht von Tensoranalysis, Maßtheorie und Funktionalanalysis über Dynamische Systeme und Variationsrechnung bis zu Mannigfaltigkeiten, Riemannscher Geometrie, Liegruppen und Topologie.

Data Structures

Author: Elliot B. Koffman
Publisher: John Wiley & Sons
ISBN: 9780470128701
Release Date: 2010-01-26
Genre: Computers

This book lays the foundation for programmers to build their skills. The focus is placed on how to implement effective programs using the JCL instead of producing mathematical proofs. The coverage is updated and streamlined to provide a more accessible approach to programming. They’ll be able to develop a thorough understanding of basic data structures and algorithms through an objects-first approach. Data structures are discussed in the context of software engineering principles. Updated case studies also show programmers how to apply essential design skills and concepts.

A Practical Introduction to Data Structures and Algorithm Analysis

Author: Clifford A. Shaffer
Publisher:
ISBN: UOM:39015040375167
Release Date: 1998
Genre: Computers

The author, Cliff Shaffer provides a superior learning tool for those who desire more rigorous data structures and an algorithm analysis book utilizing Java.While the author covers most of the standard data structures, he concentrates on teaching the principles required to select or design a data structure that will best solve a problem. The emphasis is on data structures, and algorithm analysis, not teaching Java. Java is utilized strictly as a tool to illustrate data structures concepts and only the minimal, useful subset of Java is included.

Algorithmic Puzzles

Author: Anany Levitin
Publisher: Oxford University Press
ISBN: 9780199911776
Release Date: 2011-10-12
Genre: Mathematics

While many think of algorithms as specific to computer science, at its core algorithmic thinking is defined by the use of analytical logic to solve problems. This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures. The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary on the puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking through more difficult puzzles.