This title covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode.

Presents basic programming concepts and techniques. This book focuses on the representation of information inside a computer, the structural relationships between data elements, and how to deal with them efficiently. It gives elementary applications to simulation, numerical methods, symbolic computing, software and system design.

Presents a comprehensive survey of classical computer techniques for sorting and searching. This book considers both large and small databases and internal and external memories. It contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency, and also a section on optimum sorting.

Provides coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by the authors also exploit the natural match between C++ classes and ADT implementations.

Provides information on how to carry out traditional programming tasks in a high-powered, efficient, easy-to-maintain manner with Perl. Topics range in complexity from sorting and searching to statistical algorithms, numerical analysis, and encryption.

Explaining designing algorithms, and analyzing their efficacy and efficiency, this book covers combinatorial algorithms technology, stressing design over analysis. It presents instruction on methods for designing and analyzing computer algorithms. It contains the catalog of algorithmic resources, implementations and a bibliography.

Cryptography is the study of message secrecy and is used in fields such as computer science, computer and network security, and even in instances of everyday life, such as ATM cards, computer passwords, and electronic commerce.

.

'Algorithmics' presents the most important, concepts, methods and results that are fundamental to the science of computing. It starts by introducing the basic ideas of algorithms, including their structures and methods of data manipulation. It demonstrates how to design accurate and efficient algorithms, and discusses their inherent limitations.

For one or two-semester, undergraduate or graduate-level courses in Artificial Intelligence. The long-anticipated revision of this best-selling text offers the most comprehensive, up-to-date introduction to the theory and practice of artificial intelligence.

Providing exercises to help students learn the properties of algorithms, this text places a greater emphasis on abstract data types, modular programming, object-oriented programming and C++ classes.

The most comprehensive, authoritative, and up-to-date book on computer graphics now presents examples in the C programming language. As before, the authors provide a unique combination of current concepts and practical applications. Important algorithms in 2D and 3D graphics are detailed for easy implementation.

Offers an introduction to computational geometry. This textbook focuses on algorithms. It covers the basic techniques and topics from computational geometry, as well as several advanced topics. It features sections discussing Voronoi diagrams of line segments, farthest-point Voronoi diagrams, and realistic input models.

Demonstrates how you can build Web 2.0 applications to mine the enormous amount of data created by people on the Internet. This book explains how to draw conclusions about user experience, marketing, personal tastes, and human behavior in general - from information collected every day.

A student introduction to the design of algorithms for problem solving. Written from a functional programming perspective, the text should appeal to anyone studying algorithms. Included are end-of-chapter exercises and bibliographic references.

Presents basic tools from probability theory used in algorithmic applications, with concrete examples.

Covers theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. This book contains useful algorithms and results about the intrinsic complexity of combinatorial problems. It is of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.

Describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them.