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?)
- On the complexity and decidability of some problems involving shuffle
- Supernode Binary Search Trees
- 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
- 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
- Stable-matching Voronoi diagrams: combinatorial complexity and algorithms
- On fairness in polling systems
- Range minimum queries in minimal space
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Maximum versus minimum: two properties of the Fibonacci sequence
- 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
- 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
- A recursive local polynomial approximation method using Dirichlet clouds and radial basis functions
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)
