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)

• 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
• Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading
• Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations
• Estimates for exponential sums. Applications
• Limit theorems for triangular urn schemes
• Trivariate Bernoulli distribution with application to software fault tolerance
• On the use of ANOVA expansions in reduced basis methods for parametric partial differential equations
• The three-loop splitting functions in QCD: the helicity-dependent case
• Beta-MPT: multinomial processing tree models for addressing individual differences
• Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry
• Factors of characteristic words: location and decompositions
• B-series methods cannot be volume-preserving
• Parallel algorithms for separable permutations
• Fast order-preserving pattern matching
• On minimum \(k\)-modal partitions of permutations
• Quantum Monte Carlo on graphical processing units
• Random numbers from a delay equation
• Bounding the spectrum of large Hermitian matrices
• Optimal full ranking from pairwise comparisons
• The single row facility layout problem: state of the art
• Dynamical directions in numeration
• A new class of Zernike moments for computer vision applications
• Limit theorems for patterns in phylogenetic trees
• Hashing and canonicalizing Notation 3 graphs
• Title not available (Why is that?)
• Clusters, Coxeter-sortable elements and noncrossing partitions
• An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
• On some packing problem related to dynamic storage allocation
• A performance analysis of channel fragmentation in dynamic spectrum access systems
• On Floyd and Rivest's SELECT algorithm
• Algorithm 938: Compressing circular buffers
• Data refinement of invariant based programs
• A variable-selection heuristic for K-means clustering
• A generalization of Dijkstra's algorithm
• MPOC: an agglomerative algorithm for multicriteria partially ordered clustering
• Algorithm 947: Paraperm -- parallel generation of random permutations with MPI
• 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?

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)