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
- scientific article; zbMATH DE number 3303655
- scientific article; zbMATH DE number 1178976
- scientific article; zbMATH DE number 3303654
- scientific article
- 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)
- 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
- On canonical number systems
- A survey on topological properties of tiles related to number systems
- Accelerating certain outputs of merging and sorting networks
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
- Descent polynomials for \(k\) bubble-sortable permutations of type B
- Random small Hamming weight products with applications to cryptography
- A random number generator based on elliptic curve operations
- Sharp error bounds for complex floating-point inversion
- Merging almost sorted sequences yields a 24-sorter
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints
- Reconstructing binary matrices with timetabling constraints
- Weighted Flow Algorithms (WFA) for stochastic particle coagulation
- High-precision computation: mathematical physics and dynamics
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- About randomised distributed graph colouring and graph partition algorithms
- The generating function for total displacement
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- The cell probe complexity of succinct data structures
- A low-memory algorithm for finding short product representations in finite groups.
- On the Value of Multiple Read/Write Streams for Data Compression
- Controlled random tests
- Straight-line programs: a practical test (extended abstract)
- Complexity of computation in finite fields
- Quasi-Monte Carlo methods with applications in finance
- Cryptographic properties of nonlinear pseudorandom number generators
- Parallel machine scheduling with restricted job rejection
- On Las Vegas approximations for metric 1-median selection
- Running time of the treapsort algorithm
- Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases
- 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
- 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
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)
