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 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?)
- Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach
- Improved random graph isomorphism
- Spectrum and entropy of C-systems MIXMAX random number generator
- The sets of flattened partitions with forbidden patterns
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Separating OR, SUM, and XOR circuits
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
- The enumeration of prudent polygons by area and its unusual asymptotics
- On the mean-field limit of bosons with Coulomb two-body interaction
- An accurate updating formula to calculate sample variance from weighted successive differences
- Faster algorithms for single machine scheduling with release dates and rejection
- The combination technique and some generalisations
- Improved error bounds for floating-point products and Horner's scheme
- On the definition of unit roundoff
- The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Digit systems over commutative rings
- Eulerian quasisymmetric functions
- Distributional analysis of swaps in quick select
- Extensions of smoothing via taut strings
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
- Batcher's odd-even exchange revisited: a generating functions approach
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- Parallel stochastic gradient algorithms for large-scale matrix completion
- A fast algorithm for computing large Fibonacci numbers
- Measurement of preferences with self-explicated approaches: a classification and merge of trade-off- and non-trade-off-based evaluation types
- On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic
- Fast projection onto the simplex and the \(l_1\) ball
- On the linear complexity profile of some sequences derived from elliptic curves
- Even faster integer multiplication
- On the tree search problem with non-uniform costs
- Perfect necklaces
- Efficient computer search of large-order multiple recursive pseudo-random number generators
- Analysis of the expected number of bit comparisons required by quickselect
- Finding the best portable congruential random number generators
- An obstruction to solvability of the reach control problem using affine feedback
- On the hardness of bribery variants in voting with CP-nets
- Genetic algorithms for condition-based maintenance optimization under uncertainty
- Minimum edge blocker dominating set problem
- Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts
- Bounds for resultants of univariate and bivariate polynomials
- Simulation of stochastic demand data streams for network revenue management problems
- DYNAMICAL CHARACTERISTICS OF DISCRETIZED CHAOTIC PERMUTATIONS
- Extensions of Black-Scholes processes and Benford's law
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)
