scientific article

Publication date: 1973

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.

Searching and sorting (68P10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (only showing first 100 items - show all)

Dynamics of noncommutative solitons. I: Spectral theory and dispersive estimates ⋮ Impossibility results for weak threshold networks ⋮ An approximation algorithm for least median of squares regression ⋮ Batcher's odd-even exchange revisited: a generating functions approach ⋮ Towards a realistic analysis of the QuickSelect algorithm ⋮ Waiting time distribution for the emergence of superpatterns ⋮ A study on interleaving versus segmentation ⋮ Optimal alphabetic trees for binary search ⋮ Parallel dictionaries with local rules on AVL and brother trees ⋮ Enumerating longest increasing subsequences and patience sorting ⋮ Nearest neighbor Markov dynamics on Macdonald processes ⋮ Pattern avoidance in poset permutations ⋮ Approximate counting with \(m\) counters: a probabilistic analysis ⋮ A unified approach to linear probing hashing with buckets ⋮ An iterative aggregation and disaggregation method for the steady state solution of large scale continuous systems ⋮ Random access to Fibonacci encoded files ⋮ Annihilators of highest weight \(\mathfrak{sl}(\infty)\)-modules ⋮ A structure-based chaotic hashing scheme ⋮ Optimal-depth sorting networks ⋮ The algorithm for identical object searching with bounded worst-case complexity and linear memory ⋮ A generalized constructive algorithm using insertion-based heuristics ⋮ Permutations sortable by two stacks in series ⋮ Merging almost sorted sequences yields a 24-sorter ⋮ Depth in classical Coxeter groups ⋮ Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm ⋮ Efficient and robust associative memory from a generalized Bloom filter ⋮ Tableaux and matrix correspondences ⋮ Bijections for refined restricted permutations ⋮ On the number of range queries in k-space ⋮ Sorting with networks of data structures ⋮ External-memory multimaps ⋮ Free quasi-symmetric functions and descent algebras for wreath products, and noncommutative multi-symmetric functions ⋮ A probabilistic approach to consecutive pattern avoiding in permutations ⋮ On the connected components of a random permutation graph with a given number of edges ⋮ Non-uniqueness of minimal superpermutations ⋮ Closest pair and the post office problem for stochastic points ⋮ Further analysis of the remedian algorithm ⋮ Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths ⋮ A linear time algorithm for consecutive permutation pattern matching ⋮ On the minimal Fourier degree of symmetric Boolean functions ⋮ Higher-order time integration of Coulomb collisions in a plasma using Langevin equations ⋮ Using functional equations to enumerate 1324-avoiding permutations ⋮ Row-strict quasisymmetric Schur functions ⋮ Pattern avoidance in ordered set partitions ⋮ A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries ⋮ Bruhat order on fixed-point-free involutions in the symmetric group ⋮ A multiset hook length formula and some applications ⋮ On demand string sorting over unbounded alphabets ⋮ A family of proportionate normalized subband adaptive filter algorithms ⋮ Accelerating Pollard's rho algorithm on finite fields ⋮ Monomial graphs and generalized quadrangles ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ Noncommutative Lévy processes for generalized (particularly anyon) statistics ⋮ Discrete logarithm problem using index calculus method ⋮ Fibonacci numbers and orthogonal polynomials ⋮ Integer merging on EREW PRAM ⋮ On the Lipschitz constant of the RSK correspondence ⋮ On the complexity of min-max sorting networks ⋮ Unfair permutations ⋮ Simulation and estimation of extreme quantiles and extreme probabilities ⋮ Descent sets on 321-avoiding involutions and hook decompositions of partitions ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ On the tractability of the Brownian bridge algorithm ⋮ On the sub-permutations of pattern avoiding permutations ⋮ On a subposet of the Tamari lattice ⋮ The two variable per inequality abstract domain ⋮ An infinite family of inv-Wilf-equivalent permutation pairs ⋮ Cache-oblivious hashing ⋮ Permutations generated by stacks and deques ⋮ Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Bivariate Gončarov polynomials and integer sequences ⋮ Improved space-time tradeoffs for approximate full-text indexing with one edit error ⋮ Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks ⋮ Large deviations for permutations avoiding monotone patterns ⋮ Efficient processing of substring match queries with inverted variable-length gram indexes ⋮ Pattern avoidance and Young tableaux ⋮ Enumerating matroids of fixed rank ⋮ Stockmeyer's tower ⋮ On the Liouville integrability of the periodic Kostant-Toda flow on matrix loops of level \(k\) ⋮ Metamodeling semantics of multiple inheritance ⋮ An asymptotic version of a theorem of Knuth ⋮ Gcd of multivariate polynomials via Newton polytopes ⋮ Crossing numbers of graphs with rotation systems ⋮ Faster query algorithms for the text fingerprinting problem ⋮ The algebra of binary search trees ⋮ A generative model for rank data based on insertion sort algorithm ⋮ Refined complexity analysis for heap operations ⋮ A note on detecting simple redundancies in linear systems ⋮ Asymptotic equivalence between frequentist and Bayesian prediction limits for the Poisson distribution ⋮ On adaptive sampling ⋮ Unification in commutative theories ⋮ Improved sorting networks with O(log N) depth ⋮ Optimal merging and sorting on the EREW PRAM ⋮ Adaptive remeshing for transient problems ⋮ A dynamic location problem for graphs ⋮ The real zeros of the Bernoulli polynomials ⋮ Generating alternating permutations lexicographically ⋮ Analysis of recursive batched interpolation search ⋮ Model-based clustering of multivariate ordinal data relying on a stochastic binary search algorithm

This page was built for publication: