scientific article; zbMATH DE number 1178976
[The 1st ed. 1968 has been reviewed (see Zbl 0191.17903).] Publisher's description: A word from Don Knuth: For the past 20 years I've been making copious notes in my personal copies of The Art of Computer Programming, whenever I've noticed how those books could be made better. Finally the time is ripe to typeset those books from scratch, using the tools of digital typography that I worked on during the 1980s. The new editions incorporate literally thousands of improvements, including hundreds of instructive new exercises and answers to exercises. I think most readers will enjoy these new things as much as I did when I first learned them. I've been especially careful to include any new historical details that have come to my attention, and to provide up-to-date information about all the research problems stated in previous editions. Computer Science has been changing and growing at a fantastic rate, yet I believe nearly everything in The Art of Computer Programming is crucial information that will never become obsolete. This first volume in the series begins with basic programming concepts and techniques, then focuses more particularly on information structures-the representation of information inside a computer, the structural relationships between data elements and how to deal with them efficiently. Elementary applications are given to simulation, numerical methods, symbolic computing, software and system design. Dozens of simple and important algorithms and techniques have been added to those of the previous edition. The section on mathematical preliminaries has been extensively revised to match present trends in research.
- New schemes for sharing points on an elliptic curve
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Order statistics and Benford's law
- Order-\(n\) cluster Monte Carlo method for spin systems with long-range interactions
- Fitting a C^m-smooth function to data. II
- The C^m norm of a function with prescribed jets. II
- On minimum \(k\)-modal partitions of permutations
- Positional number systems with digits forming an arithmetic progression
- Noncommutative algebra, multiple harmonic sums and applications in discrete probability
- Structured construction and simulation of nondeterministic stochastic activity networks
- Maximum likelihood analysis of algorithms and data structures
- Inductive reasoning on recursive equations
- Recurrence relations based on minimization
- A generalization of Dijkstra's algorithm
- The complexity of finding fixed-radius near neighbors
- Binomial coefficients with non-integral lower index
- Sign determination in residue number systems
- Symmetry properties of multiple recursive random number generators in full period and spectral test
- Verification of the Miller-Rabin probabilistic primality test.
- Finite-size scaling approach to dynamic storage allocation problem
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- The average diameter and its estimation in nonlinear structures
- A fast Euclidean algorithm for Gaussian integers
- Basic analytic combinatorics of directed lattice paths
- Modified decomposition method for multiple recursive random number generator
- Wilf equivalence relations for consecutive patterns
- A fast parallel modular exponentiation algorithm
- A computationally efficient scheme for feature extraction with kernel discriminant analysis
- On the distribution of betweenness centrality in random trees
- On the Farey sequence and its augmentation for applications to image analysis
- A cellular automaton -- finite volume method for the simulation of dendritic and eutectic growth in binary alloys using an adaptive mesh refinement
- A survey of string orderings and their application to the Burrows-Wheeler transform
- Dynamic phasors estimation based on Taylor-Fourier expansion and Gram matrix representation
- Inglenook shunting puzzles
- Equidistribution, uniform distribution: a probabilist's perspective
- Asymptotic analysis of a storage allocation model with finite capacity: joint distribution
- Single and simultaneous binary mergers in Wright-Fisher genealogies
- \(h\)-adic polynomials and partial fraction decomposition of proper rational functions over \(\mathbb{R}\) or \(\mathbb{C}\)
- A type system for counting instances of software components
- Robust optimization analysis for multiple attribute decision making problems with imprecise information
- Parallel algorithms for separable permutations
- Mergible states in large NFA
- An algebraic framework for minimum spanning tree problems
- Global Fibonacci nim
- Coherent neural oscillations induced by weak synaptic noise
- Relax, but don't be too lazy
- Sum-discrepancy test on pseudorandom number generators
- Lattice-based algorithms for number partitioning in the hard phase
- The single row facility layout problem: state of the art
- Estimates for exponential sums. Applications
- The non-Archimedean theory of discrete systems
- The m-version of binary search trees: an average case analysis
- On the fastest Vickrey algorithm
- Trimmed Moebius inversion and graphs of bounded degree
- Mining frequent closed rooted trees
- A data-driven smoothed particle hydrodynamics method for fluids
- Restricted stacks as functions
- Normally ordered forms of powers of differential operators and their combinatorics
- Geometric conditions for \(\square\)-irreducibility of certain representations of the general linear group over a non-Archimedean local field
- Conversion of mersenne twister to double-precision floating-point numbers
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- Colored operads, series on colored operads, and combinatorial generating systems
- Flexible resource allocation to interval jobs
- Periodic template tests: a family of statistical randomness tests for a collection of binary sequences
- Reduced word manipulation: patterns and enumeration
- New recursive representations for the Favard constants with application to multiple singular integrals and summation of series
- Energy on spheres and discreteness of minimizing measures
- Study on upper limit of sample size for a two-level test in NIST SP800-22
- Duality of graded graphs through operads
- Extremal values of the Sackin tree balance index
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
- Lower bounds for superpatterns and universal sequences
- Simpler proofs with decentralized invariants
- Refined Wilf-equivalences by Comtet statistics
- Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions
- An in-place truncated Fourier transform
- A. de Moivre theorem revisited
- Multiple-edge-fault-tolerant approximate shortest-path trees
- Automata on finite trees
- Finite skew braces with isomorphic non-abelian characteristically simple additive and circle groups
- Hyperbolic polyhedral surfaces with regular faces
- Acceleration of RBF-FD meshless phase-field modelling of dendritic solidification by space-time adaptive approach
- DLP in semigroups: algorithms and lower bounds
- De Moivre and Bell polynomials
- Chaotical PRNG based on composition of logistic and tent maps using deep-zoom
- Efficient mesh deformation using radial basis functions with a grouping-circular-based greedy algorithm
- Exact controllability of the wave equation on graphs
- Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach
- On Schneider's continued fraction map on a complete non-Archimedean field
- A visual analysis method of randomness for classifying and ranking pseudo-random number generators
- Fractal form of the partition functions \(p(n)\)
- A brief and understandable guide to pseudo-random number generators and specific models for security
- On profinite groups with automorphisms whose fixed points have countable Engel sinks
- Pseudorandom processes
- Complexity and performance of secure floating-point polynomial evaluation protocols
- Optimal full ranking from pairwise comparisons
- A discrete random walk on the hypercube
- A fast algorithm for computing the number of magic series
- An application of singular traces to crystals and percolation
- On a closed form for derangement numbers: an elementary proof
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 Q4398780)
