scientific article; zbMATH DE number 1178976

zbMATH Open0895.68055MaRDI QIDQ4398780FDOQ4398780

Authors: Donald E. Knuth 

Publication date: 26 July 1998

Title of this publication is not available (Why is that?)

Recommendations

• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• scientific article; zbMATH DE number 1052006
• scientific article; zbMATH DE number 194559
• Selected papers on design of algorithms.

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) Theory of software (68N99)

Cited In (only showing first 100 items - show all)

• On a conjecture about the hypoenergetic trees
• A fast Euclidean algorithm for Gaussian integers
• Fast differential eleminination in C: The CDiffElim environment
• Binomial coefficients with non-integral lower index
• Balanced allocation on hypergraphs
• New schemes for sharing points on an elliptic curve
• Modified decomposition method for multiple recursive random number generator
• Inglenook shunting puzzles
• Finite-size scaling approach to dynamic storage allocation problem
• Smallest formulas for the parity of \(2^k\) variables are essentially unique
• Efficient algorithms for clique problems
• A complementary view on the growth of directory trees
• A quantum genetic algorithm with quantum crossover and mutation operations
• Automata on finite trees
• On generic complexity of the validity problem for Boolean formulas
• Triangulations of Cayley and Tutte polytopes
• Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
• How should spin-weighted spherical functions be defined?
• Fast binary multiplication by performing dot counting and complement recoding
• Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation
• Single and simultaneous binary mergers in Wright-Fisher genealogies
• Upper Bounds on Mixing Time of Finite Markov Chains
• Geometric conditions for \(\square\)-irreducibility of certain representations of the general linear group over a non-Archimedean local field
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Order-\(n\) cluster Monte Carlo method for spin systems with long-range interactions
• Branching random walks on binary search trees: convergence of the occupation measure
• An efficient algorithm for characteristic tracking on two-dimensional triangular meshes
• Authenticating ad hoc networks by comparison of short digests
• Ordered trees and the inorder traversal
• Positional number systems with digits forming an arithmetic progression
• Structured construction and simulation of nondeterministic stochastic activity networks
• A computationally efficient scheme for feature extraction with kernel discriminant analysis
• Hyperbolic polyhedral surfaces with regular faces
• An iterated greedy algorithm for finding the minimum dominating set in graphs
• On the distribution of betweenness centrality in random trees
• On the Farey sequence and its augmentation for applications to image analysis
• Fast approximate computations with Cauchy matrices and polynomials
• The splay-list: a distribution-adaptive concurrent skip-list
• The splay-list: a distribution-adaptive concurrent skip-list
• Smallest Formulas for Parity of 2 k Variables Are Essentially Unique
• Increasing integer sequences and Goldbach's conjecture
• Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions
• Sharp estimates for perturbation errors in summations
• A cellular automaton -- finite volume method for the simulation of dendritic and eutectic growth in binary alloys using an adaptive mesh refinement
• A survey of string orderings and their application to the Burrows-Wheeler transform
• Multipoint formulas for scattered far field in multidimensions
• A Parallel Algorithm for Multiple-Precision Division by a Single-Precision Integer
• The average diameter and its estimation in nonlinear structures
• Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
• Addition chains, vector chains, and efficient computation
• Deterministic factoring with oracles
• Lagrange inversion
• Dynamic phasors estimation based on Taylor-Fourier expansion and Gram matrix representation
• Asymptotics and random sampling for BCI and BCK lambda terms
• Constant-competitive tree node assignment
• A survey on tree matching and XML retrieval
• A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions
• Title not available (Why is that?)
• Extremal values of the Sackin tree balance index
• Duality of graded graphs through operads
• Wilf-classification of mesh patterns of short length
• Some observations on the theory of cryptographic hash functions
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Title not available (Why is that?)
• Benchmark testing of algorithms for very robust regression: FS, LMS and LTS
• Revisiting Shao and Sokal's \(B_2\) index of phylogenetic balance
• Taylor series method for solving a class of nonlinear singular boundary value problems arising in applied science
• On the dynamics of a class of multi-group models for vector-borne diseases
• The complete generating function for Gessel walks is algebraic
• Algorithm 956: PAMPAC, a parallel adaptive method for pseudo-arclength continuation
• Polynomially bounded sequences and polynomial sequences
• Operads from posets and Koszul duality
• Binary determinantal complexity
• Pluriassociative algebras. I: The pluriassociative operad.
• Pseudo-Random Bit Generation Based on 2D Chaotic Maps of Logistic Type and Its Applications in Chaotic Cryptography
• Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
• Fitting a \(C^m\)-smooth function to data. II
• High-order adaptive finite-volume schemes in the context of multiresolution analysis for dyadic grids
• Order-preserving indexing
• An adaptive multiresolution method on dyadic grids: Application to transport equations
• Towards estimating expected sizes of probabilistic skylines
• Robust optimization analysis for multiple attribute decision making problems with imprecise information
• Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem
• Coherent neural oscillations induced by weak synaptic noise
• Relax, but don't be too lazy
• Sign determination in residue number systems
• The non-Archimedean theory of discrete systems
• The method and criterion for quality assessment of random number sequences
• Counting Hamiltonian cycles in bipartite graphs
• Maximum likelihood analysis of algorithms and data structures
• Limiting distributions for additive functionals on Catalan trees
• Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
• Order statistics and Benford's law
• Basic analytic combinatorics of directed lattice paths
• Coalescent simulation in continuous space: algorithms for large neighbourhood size
• Computing prime harmonic sums
• Properties of phylogenetic trees generated by Yule-type speciation models
• Fast zeta transforms for lattices with few irreducibles
• Divided differences in noncommutative geometry: rearrangement lemma, functional calculus and expansional formula
• The origins of combinatorics on words

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 Q4398780)