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; 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)
- Title not available (Why is that?)
- On the complexity and decidability of some problems involving shuffle
- Supernode Binary Search Trees
- A Recursive Local Polynomial Approximation Method Using Dirichlet Clouds and Radial Basis Functions
- Linear extensions and comparable pairs in partial orders
- Regenerative random permutations of integers
- The Ford-Johnson algorithm still unbeaten for less than 47 elements
- Authenticated key agreement in dynamic peer groups
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll
- 64-bit and 128-bit DX random number generators
- LTI approximation of nonlinear systems via signal distribution theory
- A fast algorithm for reversion of power series
- On relative errors of floating-point operations: Optimal bounds and applications
- Monte Carlo linear solvers with non-diagonal splitting
- The number of steps in the Robinson-Schensted algorithm
- Saturation problems in the Ramsey theory of graphs, posets and point sets
- Point lattices and oscillating recurrence sequences†
- Fast quantum modular exponentiation
- Digital semigroups
- Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models
- Hall sets, Lazard sets and comma-free codes
- On fairness in polling systems
- Range minimum queries in minimal space
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
- Optimal learning with a local parametric belief model
- The asymptotics of the geometric polynomials
- Parallel Fokker-Planck-DSMC algorithm for rarefied gas flow simulation in complex domains at all Knudsen numbers
- The height of a binary search tree: the limiting distribution perspective.
- A greedy algorithm for the two-level nested logit model
- An improvement of a cryptanalysis algorithm
- Probabilistic analyses of the plain multiple gcd algorithm
- Self-affine manifolds
- A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix
- Renewal theory in the analysis of tries and strings
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
- Formulae and Asymptotics for Coefficients of Algebraic Functions
- Imbalance in random digital trees
- Bases of canonical number systems in quartic algebraic number fields
- A survey of some applications of finite fields
- A rigorous version of R. P. Brent's model for the binary Euclidean algorithm
- The dynamics of Pythagorean Triples
- Priority queues and sorting for read-only data
- Internal differential collision attacks on the reduced-round Grøstl-0 hash function
- The general two-level storage management problem: a reconsideration of the KTNS-rule
- Truncation of unitary operads
- Trees with exponentially growing costs
- Upper bounds for sorting integers on random access machines
- Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy
- Reynolds stress transport modelling for steady and unsteady channel flows with wall injection
- Approximate \(k\)-closest-pairs in large high-dimensional data sets
- Fractal-like matrices
- Sampling exactly from the normal distribution
- Reasoning Algebraically About P-Solvable Loops
- 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
- 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
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)
