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)
- An error in the Kinderman-Ramage method and how to fix it
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems
- Invariants for parameterised Boolean equation systems
- Obtainable sizes of topologies on finite sets
- Approximate testing with error relative to input size.
- Sampling streaming data with replacement
- Deletions in random binary search trees: a story of errors
- A verified implementation of the Berlekamp-Zassenhaus factorization algorithm
- Discrete event simulation modelling of computer systems for performance evaluation
- Parameterization method for unstable manifolds of delay differential equations
- Prime and coprime values of polynomials
- Generating random binary trees -- a survey
- Efficient non-malleable commitment schemes
- A local limit theorem for continued fractions
- Continued fractions for linear fractional transformations of power series
- A parallel extended GCD algorithm
- Upper Bounds on Mixing Time of Finite Markov Chains
- Comparing the effectiveness of two kinds of continued fractions
- Additive symmetries: The non-negative case.
- Cryptanalysis of multiplicative coupled cryptosystems based on the Chebyshev polynomials
- A modular reduction for GCD computation.
- 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
- Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm.
- Some combinatorics of factorial base representations
- An intuitive and simple bounding argument for Quicksort
- Probabilizing parking functions
- Algorithmic aspects for power-efficient hardware/software partitioning
- A new constrained edit distance between quotiented ordered trees
- Fast distance multiplication of unit-Monge matrices
- The vortex filament equation as a pseudorandom generator
- Tuples of polynomials over finite fields with pairwise coprimality conditions
- Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
- On the probability of overlap of random subsequences of pseudorandom number generators
- Combined generators with components from different families
- Cryptographic properties of the quantum hashing based on expander graphs
- ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS
- DOUBLE HASHING WITH MULTIPLE PASSBITS
- A generalization of Arrow's lemma on extending a binary relation
- Random walks on finite nilpotent groups driven by long-jump measures
- Subtraction-free almost Montgomery inverse algorithm
- A goodness-of-fit test for copulas based on the collision test
- Algorithms for a risk-averse Stackelberg game with multiple adversaries
- Reconciling the term structure of interest rates with the consumption-based ICAP model
- ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH
- Efficient implementation of algorithms for approximate exponentiation
- Pseudorandom permutation
- Title not available (Why is that?)
- Title not available (Why is that?)
- On similarity
- Directed column-convex polyominoes by recurrence relations
- Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties
- Efficient non-malleable commitment schemes
- HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank
- Title not available (Why is that?)
- 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
- 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)
