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)
- Distribution results for low-weight binary representations for pairs of integers
- Fibonacci BSTs: a new balancing method for binary search trees
- On compressing permutations and adaptive sorting
- Notes on protected nodes in digital search trees
- Isomorphism check in fractional factorial designs via letter interaction pattern matrix
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
- A representation on the labeled rooted forests
- Combinatorics of balanced carries
- Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour
- Precise numerical computation
- Asymptotic distribution of two-protected nodes in random binary search trees
- Some new binomial sums related to the Catalan triangle
- Evaluation of permanents in rings and semirings
- Numeration and discrete dynamical systems
- On robustness in control and LTI identification: near-linearity and non-conic uncertainty
- Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups
- Parallel modular exponentiation using load balancing without precomputation
- String matching with alphabet sampling
- Pseudorandom number generators based on random covers for finite groups
- Limit shapes for random square Young tableaux
- Development of a Stokes flow solver robust to large viscosity jumps using a Schur complement approach with mixed precision arithmetic
- Descending chains, the lilypond model, and mutual-nearest-neighbour matching
- Recursive polynomial remainder sequence and its subresultants
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations
- Algorithms for accurate, validated and fast polynomial evaluation
- Title not available (Why is that?)
- Average best \(m\)-term approximation
- Euclidean algorithms are Gaussian
- Chains-into-bins processes
- On the complexity of real root isolation using continued fractions
- Accurate evaluation of a polynomial in Chebyshev form
- Analysis of alternative digit sets for nonadjacent representations
- On the coefficients that arise from Laplace's method
- The strongest model of computation obeying 0-1 Principles
- Width and mode of the profile for some random trees of logarithmic height
- On canonical number systems
- A survey on topological properties of tiles related to number systems
- Accelerating certain outputs of merging and sorting networks
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
- Descent polynomials for \(k\) bubble-sortable permutations of type B
- Random small Hamming weight products with applications to cryptography
- A random number generator based on elliptic curve operations
- Sharp error bounds for complex floating-point inversion
- Merging almost sorted sequences yields a 24-sorter
- The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints
- Reconstructing binary matrices with timetabling constraints
- Weighted Flow Algorithms (WFA) for stochastic particle coagulation
- High-precision computation: mathematical physics and dynamics
- Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
- About randomised distributed graph colouring and graph partition algorithms
- The generating function for total displacement
- Improved algorithm for the isogeny problem for ordinary elliptic curves
- The cell probe complexity of succinct data structures
- A low-memory algorithm for finding short product representations in finite groups.
- Controlled random tests
- Straight-line programs: a practical test (extended abstract)
- Complexity of computation in finite fields
- Quasi-Monte Carlo methods with applications in finance
- Cryptographic properties of nonlinear pseudorandom number generators
- Parallel machine scheduling with restricted job rejection
- On Las Vegas approximations for metric 1-median selection
- Running time of the treapsort algorithm
- Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction
- Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases
- 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
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)
