scientific article; zbMATH DE number 1052006

MaRDI QIDQ4349924zbMATH OpenFDO

Authors Donald E. Knuth

Publication date 26 August 1997

Recommendations

scientific article; zbMATH DE number 3649960
scientific article; zbMATH DE number 3303655
scientific article; zbMATH DE number 1178976
scientific article; zbMATH DE number 3303654
scientific article; zbMATH DE number 48134
scientific article; zbMATH DE number 42035
scientific article; zbMATH DE number 1458587
The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

Cited in

(only showing first 100 items - show all)

Comparing the effectiveness of two kinds of continued fractions
Inversive pseudorandom numbers over Galois rings
Space complexity of abelian groups
Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences
Optimal conclusive sets for comparator networks
Cryptographic properties of nonlinear pseudorandom number generators
Algorithmic aspects for power-efficient hardware/software partitioning
Noncanonical number systems in the integers
A new constrained edit distance between quotiented ordered trees
A parallel extended GCD algorithm
Limit laws for the Randić index of random binary tree models
Sampling streaming data with replacement
Imbalance in random digital trees
Subtraction-free almost Montgomery inverse algorithm
Discrete event simulation modelling of computer systems for performance evaluation
A simple measure of conditional dependence
Reconciling the term structure of interest rates with the consumption-based ICAP model
Carry propagation in signed digit representations
Approximate testing with error relative to input size.
Dynamical analysis of a class of Euclidean algorithms.
Statistical properties and implementation of aperiodic pseudorandom number generators
Kazhdan-Lusztig cells and Robinson-Schensted correspondence.
Random small Hamming weight products with applications to cryptography
Combinatorics of periods in strings.
A modular reduction for GCD computation.
A random number generator based on elliptic curve operations
Basic analytic combinatorics of directed lattice paths
Pseudorandom permutation
Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques
Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees
Parameterization method for unstable manifolds of delay differential equations
Tuples of polynomials over finite fields with pairwise coprimality conditions
Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
Consolidation for compact constraints and Kendall tau LP decodable permutation codes
Relaxations of associativity and preassociativity for variadic functions
The principles of informational genomics
Computing mixed volume and all mixed cells in quermassintegral time
Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
On the variety of shapes in digital trees
Exponential decay of correlations functions in MIXMAX generator of pseudorandom numbers
Internal structure of addition chains: well-ordering
Fast structured matrix computations: tensor rank and Cohn-Umans method
Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences
Parallel Fokker-Planck-DSMC algorithm for rarefied gas flow simulation in complex domains at all Knudsen numbers
Process convergence for the complexity of radix selection on Markov sources
Accurate quotient-difference algorithm: error analysis, improvements and applications
Sampling random directions within an elliptical cone
On Las Vegas approximations for metric 1-median selection
A semidefinite programming method for integer convex quadratic minimization
Evaluation of circuits over nilpotent and polycyclic groups
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
A parametric error analysis of Goldschmidt's division algorithm
Singularity analysis, Hadamard products, and tree recurrences
Permanental bounds for nonnegative matrices via decomposition
Euclidean algorithms are Gaussian
A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix
Precise numerical computation
Analytic urns
A greedy algorithm for the two-level nested logit model
Performance-based routing
Linear extensions and comparable pairs in partial orders
Generating random binary trees -- a survey
Reduced complexity evaluation of hypergeometric functions
Portable random number generators.
The height of a binary search tree: the limiting distribution perspective.
Additive symmetries: The non-negative case.
Combined generators with components from different families
One-sided variations on binary search trees
RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
On the average complexity for the verification of compatible sequences
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
The dual optimizer for the growth-optimal portfolio under transaction costs
Randomness of the square root of 2 and the giant leap. II
Construction of weakly CUD sequences for MCMC sampling
Extensions of smoothing via taut strings
Revisiting priority queues for image analysis
A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
Synthesis of sorting algorithms using multisets in \textit{Theorema}
Improving the statistical quality of random number generators by applying a simple ratio transformation
Colored operads, series on colored operads, and combinatorial generating systems
Encoding cardinality constraints using multiway merge selection networks
A simple counting argument of the irreducible representations of \(\mathsf{SU}(N)\) on mixed product spaces
Mechanisation of the AKS algorithm
Prime and coprime values of polynomials
Metric dimension of critical Galton-Watson trees and linear preferential attachment trees
Saturation problems in the Ramsey theory of graphs, posets and point sets
The normalized matching property in random and pseudorandom bipartite graphs
Stack-sorting with consecutive-pattern-avoiding stacks
Generalized multiset theory
Weakly increasing trees on a multiset
An upper bound for the size of \(s\)-distance sets in real algebraic sets
Computing the depth distribution of a set of boxes
On the cost of unsuccessful searches in search trees with two-way comparisons
Domain decomposition for entropy regularized optimal transport
Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties
Online multivariate changepoint detection with type I error control and constant time/memory updates per series
Enumerating regular expressions and their languages
Entropy conservation for comparison-based algorithms
Range minimum queries in minimal space

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 Q4349924)