scientific article; zbMATH DE number 3303654
From MaRDI portal
Publication:5585020
zbMath0191.17903MaRDI QIDQ5585020
Publication date: 1968
Full work available at URL: https://www-cs-faculty.stanford.edu/~knuth/taocp.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of software (68Nxx)
Related Items (only showing first 100 items - show all)
Reactive computing as model generation ⋮ Geometric properties of matrices induced by pattern avoidance ⋮ XML compression via directed acyclic graphs ⋮ Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method ⋮ The minimal \(k\)-core problem for modeling \(k\)-assemblies ⋮ A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs ⋮ Construction of natural cycletrees ⋮ Pascal matrices and Stirling numbers ⋮ An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication ⋮ On the richness of the collection of subtrees in random binary search trees ⋮ Pattern matching for permutations ⋮ A study on interleaving versus segmentation ⋮ On fixed priority scheduling, offsets and co-prime task periods ⋮ Efficient algorithms for the temporal precedence problem ⋮ A note on the Horton-Strahler number for random binary search trees ⋮ Generating all the acyclic orientations of an undirected graph ⋮ Greedy flipping of pancakes and burnt pancakes ⋮ A fast algorithm for permutation pattern matching based on alternating runs ⋮ An efficient method to evaluate intersections on big data sets ⋮ Major index distribution over permutation classes ⋮ The parallel stack loading problem to minimize blockages ⋮ An elementary solution of Gessel's walks in the quadrant ⋮ Permutations sortable by two stacks in series ⋮ Coarse synchronization of UWB signals in the dense multipath channel based on the golden section ⋮ Optimal parallel algorithms for computing convex hulls and for sorting ⋮ Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances ⋮ Chebyshev polynomials over finite fields and reversibility of \(\sigma\)-automata on square grids ⋮ Trie: An alternative data structure for data mining algorithms ⋮ Matrix structure and loss-resilient encoding/decoding ⋮ A class of algorithms which require nonlinear time to maintain disjoint sets ⋮ A new block cipher based on chaotic map and group theory ⋮ Cops and robbers from a distance ⋮ Stability and performance of greedy server systems ⋮ Free rises, restricted partitions, and \(q\)-Fibonacci polynomials ⋮ Enumeration of permutations by number of alternating runs ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Lyndon words and Fibonacci numbers ⋮ The Dyck pattern poset ⋮ Random cyclations ⋮ A bijective enumeration of labeled trees with given indegree sequence ⋮ Flash memory efficient LTL model checking ⋮ Subsequential transducers: a coalgebraic perspective ⋮ Bivariate product cubature using peano kernels for local error estimates ⋮ The shape of random pattern-avoiding permutations ⋮ Computing the extensions of preinjective and preprojective Kronecker modules. ⋮ Backbone transitions and invariant tori in forced micromechanical oscillators with optical detection ⋮ The Magnus expansion, trees and Knuth's rotation correspondence ⋮ Equivalence classes of permutations modulo replacements between 123 and two-integer patterns ⋮ The maximal length of a \(k\)-separator permutation ⋮ Theory and practice of chaotic cryptography ⋮ Supervised ranking in the WEKA environment ⋮ A metric for rooted trees with unlabeled vertices based on nested parentheses ⋮ Record statistics in a random composition ⋮ Inference on power law spatial trends ⋮ A direct calculation of moments of the sample variance ⋮ A sparse octree gravitational \(N\)-body code that runs entirely on the GPU processor ⋮ The generating function of a family of the sequences in terms of the continuant ⋮ A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization ⋮ Maxima-finding algorithms for multidimensional samples: A two-phase approach ⋮ \(\sqrt n\)-consistent robust integration-based estimation ⋮ On the computing time of the continued fractions method ⋮ A method of formalizing computer operations for solving nonlinear differential equations ⋮ Survey article: on weighted densities and their connection with the first digit phenomenon ⋮ An explicit formula for the number of permutations with a given number of alternating runs ⋮ A (probably) exact solution to the birthday problem ⋮ Computing elliptic curve discrete logarithms with the negation map ⋮ Efficient processing of probabilistic set-containment queries on uncertain set-valued data ⋮ Topological ordering algorithm for LDAG ⋮ Catalan numbers and pattern restricted set partitions ⋮ A survey of state vectors ⋮ Permutations sortable by two stacks in parallel and quarter plane walks ⋮ Order statistics and exceedances for some models of INID random variables ⋮ Some results on the avoidance of vincular patterns by multisets ⋮ Formal study of functional orbits in finite domains ⋮ Shortcutting directed and undirected networks with a degree constraint ⋮ Power-law statistics from nonlinear stochastic differential equations driven by Lévy stable noise ⋮ A \(k\)-level data structure for large-scale traveling salesman problems ⋮ Arithmetic for rooted trees ⋮ Calculus in positive characteristic \(p\) ⋮ Counting permutations with no long monotone subsequence via generating trees and the kernel method ⋮ Efficiency of linked cell algorithms ⋮ Restricted partitions and \(q\)-Pell numbers ⋮ The weighted hook length formula ⋮ Some results on the structure of unary unambiguous automata ⋮ Optimising code generation with haggies ⋮ Testing convexity properties of tree colorings ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Bounded hairpin completion ⋮ Thick 2D relations for document understanding ⋮ An efficient data structure for branch-and-bound algorithm ⋮ On the integral \(\int ^{1}_{0}x^{\nu -1}(1-x)^{-\lambda}\ln ^ mx\,dx\) ⋮ A linear algorithm for the cutting center of a tree ⋮ On the recursion depth of special tree traversal algorithms ⋮ The generalized packet routing problem ⋮ The lexicographically first topological order problem is NLOG-complete ⋮ Constructing sorting networks from k-sorters ⋮ Hook and shifted hook numbers ⋮ Counting labels in binary trees ⋮ Comparison of identification criteria for machine inductive inference ⋮ Refining binomial confidence intervals
Uses Software
This page was built for publication:
