scientific article; zbMATH DE number 1052006
From MaRDI portal
Publication:4349924
zbMATH Open0895.65001MaRDI QIDQ4349924FDOQ4349924
Authors: Donald E. Knuth 
Publication date: 26 August 1997
Title of this publication is not available (Why is that?)
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.
surveyEuclidean algorithmformal power seriesstatistical testsfloating-point arithmeticspectral testrandom numbersexercisesrandom number generatorsmultiple-precision arithmeticpolynomial arithmeticcomputer programmingrandom arithmeticseminumerical algorithmslinear congruence relationsradix conversion
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Nonnumerical algorithms (68W05) Probabilistic methods, stochastic differential equations (65Cxx) Error analysis and interval analysis (65Gxx)
Cited In (only showing first 100 items - show all)
- An ultrafast cryptographically secure pseudorandom number generator
- Bitonic sorters of minimal depth
- Efficient data structures for sparse network representation
- Combinatorics of periods in strings.
- Permanental bounds for nonnegative matrices via decomposition
- Space complexity of abelian groups
- Generalized multiset theory
- Randomness of the square root of 2 and the giant leap. II
- Self-synchronizing stream ciphers and dynamical systems: state of the art and open issues
- Consistency of Markov chain quasi-Monte Carlo on continuous state spaces
- Hausdorff dimensions of perturbations of a conformal iterated function system via thermodynamic formalism
- On \(\alpha \)-greedy expansions of numbers
- Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences
- The expected profile of digital search trees
- Relations between adjacency trees
- Exact, efficient, and complete arrangement computation for cubic curves
- Accurate evaluation of a polynomial and its derivative in Bernstein form
- Minimal redundant digit expansions in the Gaussian integers
- Backward error analysis of the extended iterative refinement or improvement algorithm for solving ill conditioned linear system
- Quantum mechanics and the principle of least radix economy
- Range minimum queries in minimal space
- Skew spectra of graphs without even cycles
- Maximum versus minimum: two properties of the Fibonacci sequence
- Construction of weakly CUD sequences for MCMC sampling
- Infimaximal Frames: A Technique for Making Lines Look Like Segments
- Portable random number generators.
- Automorphism groups of finite groupoids.
- The additive congruential random number generator -- a special case of a multiple recursive generator
- Recursive merge sort with erroneous comparisons
- Sum-based weighted belief base merging: from commensurable to incommensurable framework
- Computing the throughput of probabilistic and replicated streaming applications
- Real algebraic numbers and polynomial systems of small degree
- The topological structure of fractal tilings generated by quadratic number systems
- Quantifier elimination for a class of exponential polynomial formulas
- Preserving positivity in solutions of discretised stochastic differential equations
- Decoding permutation arrays with ternary vectors
- Distributed algorithmic mechanism design for scheduling on unrelated machines
- On the expected longest length probe sequence for hashing with separate chaining
- On computational efficiency for multi-precision zero-finding methods
- Permutations with short monotone subsequences
- Fractal tiles associated with shift radix systems
- Practical algorithms for generating a random ordering of the elements of a weighted set
- Noncanonical number systems in the integers
- Numerical experiments in problems of asymptotic representation theory..
- Nearly optimal refinement of real roots of a univariate polynomial
- Algorithms for Propositional Model Counting
- Estimating steady-state distributions via simulation-generated histograms
- Dynamical analysis of a class of Euclidean algorithms.
- Applications of an expressive statistical model checking approach to the analysis of genetic circuits
- Stack-sorting with consecutive-pattern-avoiding stacks
- Limit laws for the Randić index of random binary tree models
- On chaotic and random sequences
- Inversive pseudorandom numbers over Galois rings
- Tighter bounds for the sum of irreducible LCP values
- Shortcutting directed and undirected networks with a degree constraint
- The \(p\lambda n\) fractal decomposition: nontrivial partitions of conserved physical quantities
- 2D Lyndon words and applications
- Engineering parallel string sorting
- The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices
- Computing minimal polynomials of matrices
- Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form
- Accurate, validated and fast evaluation of elementary symmetric functions and its application
- Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
- Permutation and sampling with maximum length CA or pseudorandom number generation
- Fast computation by block permanents of cumulative distribution functions of order statistics from several populations
- Distribution results for low-weight binary representations for pairs of integers
- Fibonacci BSTs: a new balancing method for binary search trees
- On compressing permutations and adaptive sorting
- Notes on protected nodes in digital search trees
- Isomorphism check in fractional factorial designs via letter interaction pattern matrix
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- A representation on the labeled rooted forests
- Combinatorics of balanced carries
- Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour
- Precise numerical computation
- Asymptotic distribution of two-protected nodes in random binary search trees
- Some new binomial sums related to the Catalan triangle
- Evaluation of permanents in rings and semirings
- Numeration and discrete dynamical systems
- On robustness in control and LTI identification: near-linearity and non-conic uncertainty
- 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
- Pseudorandom number generators based on random covers for finite groups
- Limit shapes for random square Young tableaux
- Development of a Stokes flow solver robust to large viscosity jumps using a Schur complement approach with mixed precision arithmetic
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
- Recursive polynomial remainder sequence and its subresultants
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Algorithms for accurate, validated and fast polynomial evaluation
- Title not available (Why is that?)
- Average best \(m\)-term approximation
- Euclidean algorithms are Gaussian
- Chains-into-bins processes
- On the complexity of real root isolation using continued fractions
- 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 strongest model of computation obeying 0-1 Principles
- Width and mode of the profile for some random trees of logarithmic height
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)
