scientific article; zbMATH DE number 1178976

zbMATH Open0895.68055MaRDI QIDQ4398780FDOQ4398780

Authors: Donald E. Knuth 

Publication date: 26 July 1998

Title of this publication is not available (Why is that?)

Recommendations

• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• scientific article; zbMATH DE number 1052006
• scientific article; zbMATH DE number 194559
• Selected papers on design of algorithms.

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) Theory of software (68N99)

Cited In (only showing first 100 items - show all)

• Efficient generation of shortest addition-multiplication chains
• The sum of a finite group of weights of a Hopf algebra.
• Mean deep coalescence cost under exchangeable probability distributions
• Distribution of the sum-of-digits function of random integers: a survey
• Jordan blocks of unipotent elements in some irreducible representations of classical groups in good characteristic
• Performance potential for simulating spin models on GPU
• Title not available (Why is that?)
• Deterministic Graphical Games Revisited
• The component structure of dense random subgraphs of the hypercube
• Zeros of generalized Rogers-Ramanujan series: asymptotic and combinatorial properties
• New recursive representations for the Favard constants with application to multiple singular integrals and summation of series
• On the statistical properties of finite continued fractions
• Invariant diagrams with data refinement
• Verification of the Miller-Rabin probabilistic primality test.
• Speeding up a memetic algorithm for the max-bisection problem
• Two chain rules for divided differences and Faà di Bruno’s formula
• A new simulation code for particle diffusion in anisotropic, large-scale and turbulent magnetic fields
• A motivating exploration on lunar craters and low-energy dynamics in the Earth-Moon system
• A fast parallel modular exponentiation algorithm
• Inductive reasoning on recursive equations
• Essentially non-oscillatory adaptive tree methods
• Cooperative private searching in clouds
• The saga of minimum spanning trees
• A discrete random walk on the hypercube
• Optimal inter-object correlation when replicating for availability
• About statistics of periods of continued fractions of quadratic irrationalities
• Automatic evaluations of cross-derivatives
• A generalization of magic squares with applications to digital halftoning
• DNA-inspired information concealing: a survey
• A general framework for high-accuracy parametric interpolation
• Detecting perfect powers in essentially linear time
• On the Medians of Gamma Distributions and an Equation of Ramanujan
• Ramanujan's approximation to the exponential function and generalizations
• The \(C^m\) norm of a function with prescribed jets. II
• The cost of cache-oblivious searching
• Sparsity in higher order methods for unconstrained optimization
• A binary algorithm with low divergence for modular inversion on SIMD architectures
• On Alexander-Conway polynomials of two-bridge links
• On Euclid's algorithm and elementary number theory
• Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems
• A note on immanant preservers
• An algebraic framework for minimum spanning tree problems
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• Trimmed Moebius inversion and graphs of bounded degree
• A generic approach to searching for Jacobians
• Generalised Mersenne numbers revisited
• Some conjectures concerning complexity of PL subdivisions
• Sequential solution to Kepler's equation
• On the complexity of calculation of differentials and gradients
• Parametrizing compactly supported orthonormal wavelets by discrete moments
• Mergible states in large NFA
• Sign properties of Metzler matrices with applications
• Adaptive decentralized control for a class of interconnected nonlinear systems via backstepping approach and graph theory
• Patterns in random permutations avoiding some other patterns
• On weak keys and forgery attacks against polynomial-based MAC schemes
• A Uniform Approach Towards Succinct Representation of Trees
• HILBERT–SCHMIDT OPERATORS AND FRAMES — CLASSIFICATION, BEST APPROXIMATION BY MULTIPLIERS AND ALGORITHMS
• The complexity of finding fixed-radius near neighbors
• Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))
• Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions
• New algorithms for relaxed multiplication
• A space efficient algorithm for group structure computation
• Patterns in random permutations avoiding some sets of multiple patterns
• Constrained tree inclusion
• The Monte Carlo Algorithm with a Pseudorandom Generator
• A twin error gauge for Kaczmarz's iterations
• The Secret Art of Computer Programming
• Multiple serial episodes matching
• Measurement of areas on a sphere using Fibonacci and latitude-longitude lattices
• Ubiquity of Benford's law and emergence of the reciprocal distribution
• On a conjecture about the hypoenergetic trees
• A fast Euclidean algorithm for Gaussian integers
• Fast differential eleminination in C: The CDiffElim environment
• Binomial coefficients with non-integral lower index
• Balanced allocation on hypergraphs
• New schemes for sharing points on an elliptic curve
• Modified decomposition method for multiple recursive random number generator
• Inglenook shunting puzzles
• Finite-size scaling approach to dynamic storage allocation problem
• Smallest formulas for the parity of \(2^k\) variables are essentially unique
• Efficient algorithms for clique problems
• A complementary view on the growth of directory trees
• A quantum genetic algorithm with quantum crossover and mutation operations
• Automata on finite trees
• On generic complexity of the validity problem for Boolean formulas
• Triangulations of Cayley and Tutte polytopes
• Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
• How should spin-weighted spherical functions be defined?
• Fast binary multiplication by performing dot counting and complement recoding
• Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation
• Single and simultaneous binary mergers in Wright-Fisher genealogies
• Upper Bounds on Mixing Time of Finite Markov Chains
• Geometric conditions for \(\square\)-irreducibility of certain representations of the general linear group over a non-Archimedean local field
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Order-\(n\) cluster Monte Carlo method for spin systems with long-range interactions
• Branching random walks on binary search trees: convergence of the occupation measure
• An efficient algorithm for characteristic tracking on two-dimensional triangular meshes
• Authenticating ad hoc networks by comparison of short digests
• Ordered trees and the inorder traversal
• Positional number systems with digits forming an arithmetic progression

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)