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)

• DKL: an efficient algorithm for learning deterministic Kripke structures
• Fast and accurate algorithm for the generalized exponential integral \(E_{\nu}(x)\) for positive real order
• Strictly in-place algorithms for permuting and inverting permutations
• Recurrence relations based on minimization
• Proof pearl: Mechanizing the textbook proof of Huffman's algorithm
• New method in information processing for maintaining an efficient dynamic ordered set
• Quantum mechanical algorithm for solving quadratic residue equation
• Authenticated key agreement in dynamic peer groups
• Semantics of roundoff error propagation in finite precision calculations
• Title not available (Why is that?)
• Patterns in random permutations avoiding the pattern 132
• Tests of randomness by the gambler's ruin algorithm
• Near-optimal radio use for wireless network synchronization
• The expected value under the Yule model of the squared path-difference distance
• A note on deficit analysis in dependency models involving Coxian claim amounts
• Random records and cuttings in binary search trees
• Rational agents are the quickest
• Relation-algebraic verification of Prim's minimum spanning tree algorithm
• On profinite groups with automorphisms whose fixed points have countable Engel sinks
• Wilf equivalence relations for consecutive patterns
• Characterizing planar tanglegram layouts and applications to edge insertion problems
• Fast computation of binomial coefficients
• Simpler proofs with decentralized invariants
• Distance geometry and data science
• Preserving the number of cycles of length \(k\) in a growing uniform permutation
• Modular Catalan numbers
• Noncommutative algebra, multiple harmonic sums and applications in discrete probability
• How downwards causation occurs in digital computers
• A context-free language for binary multinomial processing tree models
• An analysis of linear congruential random number generators when multiplier restrictions exist
• The two-way rewriting in action: removing the mystery of Euler-Glaisher's map
• Unbalanced digit sets and the closest choice strategy for minimal weight integer representations
• Words with a generalized restricted growth property
• Efficient mesh deformation using radial basis functions with a grouping-circular-based greedy algorithm
• Periodic solutions to some difference equations over the integers
• Symmetry properties of multiple recursive random number generators in full period and spectral test
• Estimating the smoothness of a Gaussian random field from irregularly spaced data via higher-order quadratic variations
• Multiobjective Metamodel–Assisted Memetic Algorithms
• Volumes of Vector Fields on Spheres
• Leading digit laws on linear Lie groups
• The \(p\)-adic theory of automata functions
• Division algebras and maximal orders for given invariants
• Renovating the collected algorithms from ACM
• New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
• Reverse multiple recursive random number generators
• Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network
• Effective approximation of parametrized closure systems over transactional data streams
• The complexity of checking the polynomial completeness of finite quasigroups
• An O(M(n) logn) Algorithm for the Jacobi Symbol
• Number of complete \(N\)-ary subtrees on Galton-Watson family trees
• Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm
• On synchronizing automata and uniform distribution
• Combining rare events techniques: phase change in \(\mathrm{Si}\) nanoparticles
• Left and right length of paths in binary trees or on a question of Knuth
• Memoryless near-collisions via coding theory
• Nonlinear phenomena in spaces of algorithms
• Equidistribution, uniform distribution: a probabilist's perspective
• Reallocation problems in scheduling
• On permutation patterns with constrained gap sizes
• A generator of pseudo-random numbers sequences with a very long period
• Random deterministic automata
• 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
• Structured construction and simulation of nondeterministic stochastic activity networks
• A computationally efficient scheme for feature extraction with kernel discriminant analysis
• Hyperbolic polyhedral surfaces with regular faces
• An iterated greedy algorithm for finding the minimum dominating set in graphs
• On the distribution of betweenness centrality in random trees
• On the Farey sequence and its augmentation for applications to image analysis
• Fast approximate computations with Cauchy matrices and polynomials
• The splay-list: a distribution-adaptive concurrent skip-list
• The splay-list: a distribution-adaptive concurrent skip-list

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)