scientific article; zbMATH DE number 108390
Algorithms (and data structures) belong to the fundamentals of computer science. The author presents a broad variety of important and useful algorithms, trying to concentrate on their essential characteristics. Algorithms and data structures depend on each other. In ``Algorithms in C data structures are seen as byproducts or endproducts of algorithms, and thus are discussed in order to understand the algorithms. Often different algorithms are available to solve the same problem and the choice of the best of them can be a very complicated task. The careful discussion of algorithms analysis in this book is remarkable and helpful to find adequate programs for a lot of practical problems. The 460 pages of the book are divided in 8 parts and 45 chapters. The variety of topics reaches from sorting and searching, via string processing, geometry, graphs and mathematics to more advanced topics like parallelism, dynamic programming and the theory of algorithms. All parts are extensive. String processing for example contains chapters about parsing, file compression and cryptology. At the end of each part there is a reference list for further readings. And for each part exactly ten exercises are given. It's a little pity that there does not exist any solution to these exercises, so there is no control of the success in understanding the text. The algorithms are presented in the C language and the author mentions a Pascal version of the book. All computer languages have advantages and disadvantages. C is used because of its availability on nearly all modern computers. But the book is not intended to be a C tutorial. The language only serves as a tool for formulating the algorithms and only a small subset of the language is used. To read this book with profit, readers should have experience in programming in high and low level languages. Some exposure to elementary algorithms on simple data structures such as arrays, stacks, queues and trees is helpful. An elementary acquaintance with machine organization, programming languages and other basic computer science concepts is also needed. A few of the application areas require knowledge of elementary calculus, including linear algebra, geometry and discrete mathematics. The text is supported by a lot of graphical representations and the book is written in a clear and understandable language. It is well designed, and I could not find any misprints. A broad spectrum of very fundamental themes is presented in great detail, so the book can be recommended especially for students of computer science and related disciplines as a textbook about algorithms, algorithms construction and algorithms analysis.
- A new algorithm for the minimal-area convex enclosure problem
- A redundancy eliminating approach to linearly independent rings selection in the ring perception problem
- Polymorphic constitutive equations in finite element codes
- Quasi-Monte Carlo algorithms for diffusion equations in high dimensions
- A QMC approach for high dimensional Fokker-Planck equations modelling polymeric liquids
- A note concerning the closest point pair algorithm.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- A heap-based algorithm for the study of one-dimensional particle systems.
- Intelligent transportation systems -- Enabling technologies
- Evaluating systems of equations: Toward a formal approach
- Reconstruction of rooted trees from subtrees
- Application of genetic algorithms to the design optimization of an active vehicle suspension system
- A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays
- Fast computation of multiphase flow in porous media by implicit discontinuous Galerkin schemes with optimal ordering of elements
- The complexity of modular decomposition of Boolean functions
- Algorithms unlocked
- Path-based depth-first search for strong and biconnected components
- Algorithmen
- scientific article; zbMATH DE number 54147 (Why is no real title available?)
- scientific article; zbMATH DE number 108391 (Why is no real title available?)
- scientific article; zbMATH DE number 604445 (Why is no real title available?)
- scientific article; zbMATH DE number 1033260 (Why is no real title available?)
- scientific article; zbMATH DE number 1179058 (Why is no real title available?)
- Fast search algorithms for look‐up tables
- The complete-tree-like matching mc-DFA and their implementation
- A note on mc-DFA and its minimization
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
- scientific article; zbMATH DE number 1472630 (Why is no real title available?)
- Reverse polish notation method
- scientific article; zbMATH DE number 779272 (Why is no real title available?)
- scientific article; zbMATH DE number 814096 (Why is no real title available?)
- scientific article; zbMATH DE number 815843 (Why is no real title available?)
- In-place calculation of minimum-redundancy codes
- Dichotomic Selection on Words: A Probabilistic Analysis
- Factor modeling for innovative-active enterprises
- Randomized Shortest-Path Problems: Two Related Models
- The Impact of Compilation Flags and Choosing Single- or Double-Precision Variables in Linear Systems Solvers
- Numerical geometric acoustics: an eikonal-based approach for modeling sound propagation in 3D environments
- Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture
- On well-separated sets and fast multipole methods
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023849)