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)

The generating function for total displacement
Distribution results for low-weight binary representations for pairs of integers
Recursive polynomial remainder sequence and its subresultants
The cell probe complexity of succinct data structures
On Las Vegas approximations for metric 1-median selection
Fibonacci BSTs: a new balancing method for binary search trees
On compressing permutations and adaptive sorting
The strongest model of computation obeying 0-1 Principles
Sharp error bounds for complex floating-point inversion
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
Merging almost sorted sequences yields a 24-sorter
Algorithms for accurate, validated and fast polynomial evaluation
High-precision computation: mathematical physics and dynamics
Development of a Stokes flow solver robust to large viscosity jumps using a Schur complement approach with mixed precision arithmetic
Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
Random small Hamming weight products with applications to cryptography
Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups
Parallel modular exponentiation using load balancing without precomputation
String matching with alphabet sampling
Isomorphism check in fractional factorial designs via letter interaction pattern matrix
Euclidean algorithms are Gaussian
Pseudorandom number generators based on random covers for finite groups
Notes on protected nodes in digital search trees
Some new binomial sums related to the Catalan triangle
Evaluation of permanents in rings and semirings
On canonical number systems
Limit shapes for random square Young tableaux
Numeration and discrete dynamical systems
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
Asymptotic distribution of two-protected nodes in random binary search trees
Descent polynomials for \(k\) bubble-sortable permutations of type B
A representation on the labeled rooted forests
Combinatorics of balanced carries
Average best \(m\)-term approximation
Reconstructing binary matrices with timetabling constraints
A survey on topological properties of tiles related to number systems
Improved algorithm for the isogeny problem for ordinary elliptic curves
A random number generator based on elliptic curve operations
Controlled random tests
Straight-line programs: a practical test (extended abstract)
Complexity of computation in finite fields
Descending chains, the lilypond model, and mutual-nearest-neighbour matching
On the complexity of real root isolation using continued fractions
Accelerating certain outputs of merging and sorting networks
Running time of the treapsort algorithm
On robustness in control and LTI identification: near-linearity and non-conic uncertainty
Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases
A low-memory algorithm for finding short product representations in finite groups.
Parallel machine scheduling with restricted job rejection
Accurate evaluation of a polynomial in Chebyshev form
Analysis of alternative digit sets for nonadjacent representations
On the coefficients that arise from Laplace's method
The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
Quasi-Monte Carlo methods with applications in finance
An analytic approach to the asymptotic variance of trie statistics and related structures
About randomised distributed graph colouring and graph partition algorithms
Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour
Precise numerical computation
Width and mode of the profile for some random trees of logarithmic height
Chains-into-bins processes
Cryptographic properties of nonlinear pseudorandom number generators
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
scientific article; zbMATH DE number 5190527 (Why is no real title available?)
Weighted Flow Algorithms (WFA) for stochastic particle coagulation
Estimating steady-state distributions via simulation-generated histograms
Minimal redundant digit expansions in the Gaussian integers
Permanental bounds for nonnegative matrices via decomposition
Sum-based weighted belief base merging: from commensurable to incommensurable framework
Self-synchronizing stream ciphers and dynamical systems: state of the art and open issues
Computing the throughput of probabilistic and replicated streaming applications
Limit laws for the Randić index of random binary tree models
Range minimum queries in minimal space
Generalized multiset theory
Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices
The expected profile of digital search trees
Backward error analysis of the extended iterative refinement or improvement algorithm for solving ill conditioned linear system
Relations between adjacency trees
On chaotic and random sequences
Recursive merge sort with erroneous comparisons
Real algebraic numbers and polynomial systems of small degree
Randomness of the square root of 2 and the giant leap. II
Dynamical analysis of a class of Euclidean algorithms.
The topological structure of fractal tilings generated by quadratic number systems
Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences
Consistency of Markov chain quasi-Monte Carlo on continuous state spaces
On computational efficiency for multi-precision zero-finding methods
Skew spectra of graphs without even cycles
Automorphism groups of finite groupoids.
Exact, efficient, and complete arrangement computation for cubic curves
Maximum versus minimum: two properties of the Fibonacci sequence
Computing minimal polynomials of matrices
Inversive pseudorandom numbers over Galois rings
Accurate, validated and fast evaluation of elementary symmetric functions and its application
Practical algorithms for generating a random ordering of the elements of a weighted set
Accurate evaluation of a polynomial and its derivative in Bernstein form
Numerical experiments in problems of asymptotic representation theory..
Noncanonical number systems in the integers

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)