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)
- 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
- 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
- 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
- The general two-level storage management problem: a reconsideration of the KTNS-rule
- Truncation of unitary operads
- On relative errors of floating-point operations: optimal bounds and applications
- 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
- Formulae and asymptotics for coefficients of algebraic functions
- Reasoning Algebraically About P-Solvable Loops
- Fast Point Decompression for Standard Elliptic Curves
- Small Complexity Gaps for Comparison-Based Sorting
- Space-efficient B trees via load-balancing
- Synthesis of sorting algorithms using multisets in \textit{Theorema}
- Static network reliability estimation under the Marshall-Olkin copula
- Hopf algebra structure on packed square matrices.
- The quicksort process
- Improving the statistical quality of random number generators by applying a simple ratio transformation
- Colored operads, series on colored operads, and combinatorial generating systems
- Sampling random directions within an elliptical cone
- Factorization patterns on nonlinear families of univariate polynomials over a finite field
- ASMs and operational algorithmic completeness of lambda calculus
- External memory BWT and LCP computation for sequence collections with applications
- Error estimates for the summation of real numbers with application to floating-point summation
- A simple counting argument of the irreducible representations of \(\mathsf{SU}(N)\) on mixed product spaces
- An asymptotic distribution theory for Eulerian recurrences with applications
- \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives
- Improved algorithm for maximizing service of carousel storage
- A semidefinite programming method for integer convex quadratic minimization
- Evaluation of circuits over nilpotent and polycyclic groups
- Masking tables -- an underestimated security risk
- Leibniz complexity of Nash functions on differentiations
- Accurate evaluation of polynomials in Legendre basis
- An optimal, purely functional implementation of the Garsia-Wachs algorithm
- A parametric error analysis of Goldschmidt's division algorithm
- Approximability issues of guarding a set of segments
- Performance-based routing
- Concrete stream calculus: an extended study
- A fast algorithm for quadratic resource allocation problems with nested constraints
- Analyzing the shuffling side-channel countermeasure for lattice-based signatures
- Inversions in split trees and conditional Galton-Watson trees
- Verified analysis of random binary tree structures
- Consolidation for compact constraints and Kendall tau LP decodable permutation codes
- Relaxations of associativity and preassociativity for variadic functions
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
- On the average complexity for the verification of compatible sequences
- Algorithms for \(\mathrm{SU}(n)\) boson realizations and \(\mathcal{D}\)-functions
- The principles of informational genomics
- A note on a pseudo-random number generator for personal computers
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
- Distinct fringe subtrees in random trees
- Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
- Reduced complexity evaluation of hypergeometric functions
- Exponential decay of correlations functions in MIXMAX generator of pseudorandom numbers
- Title not available (Why is that?)
- Encoding cardinality constraints using multiway merge selection networks
- Revisiting priority queues for image analysis
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)
