Publication:5585020
From MaRDI portal
zbMath0191.17903MaRDI QIDQ5585020
Publication date: 1968
Full work available at URL: https://www-cs-faculty.stanford.edu/~knuth/taocp.html
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68Nxx: Theory of software
Related Items
Testing the optimality of alphabetic trees, Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers, The analysis of hashing with lazy deletions, Complexity of preprocessing of recursive filters for running in parallel, Linear numeration systems and \(\theta\)-representations, Identities of Rothe-Abel-Schläfli-Hurwitz-type, Some more properties of Catalan numbers, Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet, Hierarchy representations based on arithmetic coding for dynamic information protection systems, A practical method for implementing string pattern matching machines, The ring of \(k\)-regular sequences, On characterization of state transition graph of additive cellular automata based on depth, Computable identities in the algebra of formal matrices, Degree, multiplicity, and inversion formulas for rational surfaces using \(u\)-resultants, A remark on the discrepancy of quadratic congruential pseudorandom numbers, Joining smooth patches around a vertex to form a \(C^ k\) surface, The weighted maximum independent set problem in permutation graphs, Expected heights in heaps, Resource allocation strategies for hypercube architectures, Exact numerical studies of Hamiltonian maps: Iterating without roundoff error, A note on the path length of red-black trees, Stirling networks: A versatile combinatorial topology for multiprocessor systems, Analysis of minimal path routing schemes in the presence of faults, Binomial coefficient codes over GF(2), A proof of the two parameter \(q\)-cases of the Macdonald-Morris constant term root system conjecture for \(S(F_ 4)\) and \(S(F_ 4)^ \vee\) via Zeilberger's method, On the complexity of blocks-world planning, Birthday paradox, coupon collectors, caching algorithms and self- organizing search, The number of minimal word chains computing the Thue-Morse word, The worst case analysis of algorithm on multiple stacks manipulation, Intrinsic relations in the structure of linear congruential generators modulo \(2^ \beta\), Backward differentiation formulae with nonnegative coefficients for solving initial value problems, Confluent linear numeration systems, Join-and-Cut algorithm for self-avoiding walks with variable length and free endpoints, The development and testing of a new composite random number generator, On the spanning trees of weighted graphs, Linear hypertree for multi-dimensional image representation, Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers, Reduced complexity dynamic programming based on policy iteration, Universal cycles for combinatorial structures, A note on optimal area algorithms for upward drawings of binary trees, On finding common subtrees, The permuted analogues of three Catalan sets, Some further results on the height of lattice paths, Bounded workspace garbage collection in an address-order preserving list processing environment, Reasoning about programs, Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. II: Zugriffssysteme, On finding shortest paths in nonnegative networks, A fast method for interpolation using preconditioning, A new algorithm for finding weak components, On the vector representation of the reachability in planar directed graphs, The asymptotic number of solutions of a diophantine equation from coding theory, An extension of Schensted's theorem, Median selection of 9 elements in 14 comparisons, Edge-disjoint spanning trees and depth-first search, Attributed translations, SEMANOL (73), a metalanguage for programming the semantics of programming languages, A class of nonlinear de Bruijn cycles, A fast algorithm for copying binary trees, Evading the drift in floating-point addition, Some properties of a centroid of a free tree, Testing flow graph reducibility, Time-delayed OL languages and sequences, Monotonic subsequences in random sequences, Priority queues with update and finding minimum spanning trees, A simple variant of the boundary-tag algorithm for the allocation of coroutine environments, A fast compacting garbage collector, Optimal chain partitions of trees, A principle of independence for binary tree searching, On a correspondence between binary trees and a certain type of permutation, Algorithms related to the decomposition of polynomials, A survey of techniques in applied computational complexity, An on-line character recognition aimed at a substitution for a billing machine keyboard, A fast stable sorting algorithm with absolutely minimum storage, The analysis of Quicksort programs, The identification of parallel micro-operations, A linear algorithm for the Hamiltonian completion number of a tree, A hashing method for fast set operations, How good is the information theory bound in sorting?, Line-digraphs, arborescences and theorems of Tutte and Knuth, Improvements on fast methods for generating normal random variables, Generalized lattices applicable in retrieval models, A new approach to the symbolic factorization of multivariate polynomials, Experimental tests of resolution-based theorem-proving strategies, An implementation of hyper-resolution, B-trees in a system with multiple users, Relative complexity of checking and evaluating, Linear expected time of a simple union-find algorithm, Operations on permutations and representation in graph form, An application of pattern matching to a problem in geometrical complexity, On computing the transitive closure of a relation, Information storage and retrieval - mathematical foundations. II: Combinatorial problems, A Jacobi algorithm and metric theory for greatest common divisors, A dual link data structure for random file organization, Implementing dictionaries using binary trees of very small height, Concerning bounded-right-context grammars, Sorting tree, nestling tree and inverse permutation, An analysis of alpha-beta pruning, A series expansion involving the harmonic numbers, Output driven interpretation of recursive programs, or writing creates and destroys data structures, ``V-tape, a virtual memory oriented data type, and its resource requirements, Improving random number generators on micro-computers, Analysis of the standard deletion algorithms in exact fit domain binary search trees, On the construction of weighted time-optimal B-trees, Multi-attribute hashing with multiple file copies for high performance partial-match retrieval, The complexity of searching in \(X+Y\) and other multisets, A tight upper bound for the path length of AVL trees, On the number of deepest nodes in ordered trees, Thoughts on pseudorandom number generators, An optimal parallel algorithm for linear programming in the plane, Tight lower bounds on the length of word chains, Combinatorial complexity bounds for arrangements of curves and spheres, Weighted median algorithms for \(L_ 1\) approximation, Making bubblesort recursive, On optimal parallelization of sorting networks, On the asymptotic analysis of the Euclidean algorithm, A very short proof of Dixon's theorem, An equivalence relation between Tausworthe and GFSR sequences and applications, Algorithms for sentences over integral domains, The tree representation of the graph used in binary image processing, Avoidance of partitions of a three-element set, On goodness-of-fit tests for multiple recursive random number generators, A heuristic for the container loading problem: A tertiary-tree-based dynamic space decomposition approach, Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\), Generalizations of Abel's and Hurwitz's identities, Using classical graph theory to generate non-isomorphic floorplan distributions in the measurement of egress complexity, Gauss-Lobatto to Bernstein polynomials transformation, The unpredictable deviousness of models, Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials, Efficient enumeration of all ladder lotteries and its application, Bijections for a class of labeled plane trees, Topological self-similarity on the random binary-tree model, Programmable reconfiguration of Physarum machines, Computing with multi-row gomory cuts, Limit sets and strengths of convergence for sequences in the duals of thread-like Lie groups, A note on minimum-area upward drawing of complete and Fibonacci trees, Skew Dyck paths, The area above the Dyck path of a permutation, A mixed integer linear programming formulation of the maximum betweenness problem, On Lyapunov stability of interconnected nonlinear systems: recursive integration methodology, A note on predecessor searching in the pointer machine model, Bounds for cops and robber pursuit, Enhancing the \(B^{+}\)-tree by dynamic node popularity caching, Formalization of the standard uniform random variable, Communication tree problems, Staircase tilings and \(k\)-Catalan structures, The Level-Ancestor problem on pure pointer machines, Allocating the fixed cost as a complement of other cost inputs: A DEA approach, Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations, On the complexity of finding balanced oneway cuts, On structural properties of eta-expansions of identity, A property of the elementary symmetric functions on the frequencies of sinusoidal signals, Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms, Hybrid parallel tempering and simulated annealing method, Asymptotic behavior of an affine random recursion in \(\mathbf Z_p^k\) defined by a matrix with an eigenvalue of size 1, Randomized selection in \(n+C+o(n)\) comparisons, Compact searchable static binary trees, Tumble, a fast simple iteration algorithm for Fibonacci, Exact solutions of lattice polymer models, The Parikh counting functions of sparse context-free languages are quasi-polynomials, Quantum Hilbert matrices and orthogonal polynomials, Emergence as a computability-theoretic phenomenon, The sorting order on a Coxeter group., Packing sets of patterns, Restructuring binary search trees revisited, A note on `Efficient scheduling of periodic information monitoring requests', Hamiltonian paths in Cayley graphs, Global-stability problem for coupled systems of differential equations on networks, Increasing the orders of equidistribution of the leading bits of the Tausworthe sequence, Size-space tradeoffs for oblivious computations, Shape distribution of height-balanced trees, The duodirun merging algorithm: a new fast algorithm for parallel merging, Listing and counting subtrees of equal size of a binary tree, The Rodrigues formula and polynomial differential operators, Binary search trees with limited rotation, Sorting in \(c \log n\) parallel steps, On the X-Y convex hull of a set of X-Y polygons, Thrifty execution of task pipelines, Dynamic storage allocation with limited compaction - complexity and some practical implications, Algebraic properties of cellular automata, On the average internal path length of m-ary search trees, Upper bounds on the maximum modulus of subdominant eigenvalues of nonnegative matrices, Permutation representation of k-ary trees, A heuristic approach to hard constrained shortest path problems, A note on the dynamic storage allocation problem, A method for numbering binary rooted and unrooted phylogenies and their hypothetical taxonomic units, Algebraic algorithms in GF(q), Resurrecting the asymptotics of linear recurrences, q-Catalan numbers, Notes on the complexity of sorting in abstract machines, Some properties of commutation in free partially commutative monoids, Analysis of the performance of the parallel quicksort method, On the number of polynomials over \(\mathrm{GF}(2)\) that factor into \(2, 3\) or \(4\) prime polynomials, A 1-1 poly-t random variable generator with application to Monte Carlo integration, Shuffles of permutations and the Kronecker product, On the integral \(\int ^{\infty}_{0}x^{\nu -1}(1+\beta x)^{- \lambda}\,\ln ^ mx\,dx\), A note on the higher moments of the expected behavior of straight insertion sort, On growing random binary trees, Brownian motion and algorithm complexity, Efficient symbolic analysis of programs, Application of the MuMATH(R) symbol manipulation system to chemically significant permutation groups, Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic, Data encodings and their costs, An O(log n) algorithm for computing general order-k Fibonacci numbers, Formula manipulation in ALGOL 68 and application to Routh's algorithm, Duality theory for discrete-time linear systems, An explicit expression for the cost of a class of Huffman trees, Enumerations of ordered trees, Evaluation and comparison of two efficient probabilistic primality testing algorithms, A new permutation algorithm for bubble memories, Controlled density sorting, A cryptosystem for multiple communication, Combinatorial aspects of continued fractions, Internal merge sorting with delayed selection, On decomposability of some Specht modules for symmetric groups, The design and analysis of a new hybrid sorting algorithm, The Schorr-Waite marking algorithm revisited, Population dynamics in variable environments. I. Long-run growth rates and extinction, Fast sequential evaluation of monotonic Boolean functions, On one dimensional submodules and hyperoctahedral groups, Some principles for dynamizing decomposable searching problems, Parametric shortest path algorithms with an application to cyclic staffing, On a stable minimum storage merging algorithm, A linear-time recognition algorithm for interval dags, An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p), An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem, Producing posets, Randomly balanced binary trees, An algorithm for testing lossless join property in relational databases, Diamond - A sorting method for vector machines, Efficient searching using partial ordering, On the selection of the particle to be perturbed in the Monte Carlo method, An \(O(\log n)\) algorithm for computing the \(n\)th element of the solution of a difference equation, Several results in program size complexity, A combinatorial proof of a Chebyshev polynomial identity, Comment on A note on perfect Lee-codes, A generalization of the Littlewood-Richardson rule and the Robinson- Schensted-Knuth correspondence, Uniform complexity and digital signatures, Optimization of spare parts for hierarchically decomposable systems, On the equality of two plane partition correspondences, On the maximum matchings of regular multigraphs, How many polynomials can be approximated faster than they can be evaluated?, A parallel Wilf algorithm for complex zeros of a polynomial, Expected complexity of fast search with uniformly distributed data, On the average depth of a prefix of the Dycklanguage \(D_ 1\)., Adjacent vertices on the b-matching polyhedron, The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities, A parallel merging algorithm, Order preserving extendible hashing and bucket tries, A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically, On the average height of trees in digital search and dynamic hashing, On the allocation of binary trees to secondary storage, Some connections between the Littlewood-Richardson rule and the construction of Schensted, Radix representations of quadratic fields, Number of admissible linear orderings of a partially ordered set as a function of its incomparability graph, Ein Verfahrensvorschlag für die permanente Stichprobeninventur, The extendible cell method for closest point problems, On the complexity of edge labelings for trees, Enumeration of partitions with hooklengths, Parallel realization of permutations over trees, Bin packing can be solved within 1+epsilon in linear time, Recognizable formal power series on trees, Simulations among multidimensional Turing machines, Are two given elements neighbouring?, An optimal algorithm for sink-finding, Best possible asymptotic bounds on the depth of monotone functions in multivalued logic, Non-repetitive sequences and Gray code, The complexity of drawing trees nicely, An improvement of the binary merge algorithm, Theory of annihilation games. I, Stack sortable permutations, A note on upper bounds for the selection problem, Sorting a linked list with equal keys, Effects of updates on optimality in tries, Selecting the top three elements, The average height of binary trees and other simple trees, Fast algorithm for sparse matrix multiplication, Coinsertion and standard bitableaux, On minimum dominating sets with minimum intersection, Statistiques d'ordre sur les permutations colorées. (Order statistics on coloured permutations), Automatic average-case analysis of algorithms, A unified treatment of a class of combinatorial sums, The method of creative telescoping, A unified approach to parallel depth-first traversals of general trees, The Arnol'd cat: Failure of the correspondence principle, Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems, A hyperbolic tangent quadrature rule for solving singular integral equations with Hadamard finite part integrals, Discrete convolution with modulo operations, On the second eigenvalue and random walks in random \(d\)-regular graphs, A loopless algorithm for generating binary tree sequences, An efficient algorithm for some tree matching problems, Dynamic programming on linear pipelines, Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses, Expected time analysis of interpolation merge -- a simple new merging algorithm, Shortest path algorithms: A computational study with the C programming language, Highly parallel computations modulo a number having only small prime factors, The number of rooted 2-connected triangular maps on the projective plane, Postorder trees and Eulerian numbers, Breadth-first traversal of trees and integer sorting in parallel, Another distributed algorithm for multiple entries to a critical section, Processor-efficient exponentiation in finite fields, Refining binomial confidence intervals, 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, 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 insight into the \(G^{n}\) continuity of polynomial surfaces, A note on binary grammatical codes of trees, Mellin transforms and asymptotics: Harmonic sums, Using multiset discrimination to solve language processing problems without hashing, Region-based memory management, An O(\(n\)) time algorithm for maximum matching on cographs, A note on binomial recurrences arising in the analysis of algorithms, Diamond deque: A simple data structure for priority deques, General combinatorial schemas: Gaussian limit distributions and exponential tails, Polynomials compatible with a symmetric Loewner matrix, A new bijection on rooted forests, How to select a loser, The relative complexity of analytic tableaux and SL-resolution, The asymptotic distributions of the remedians, A bounded-space tree traversal algorithm, Random partition of a finite set by cycles of permutation, Anonymous message communications with user hierarchy in a multicast system, Re-seeding invalidates tests of random number generators, On the nonlocal nature of dislocation nucleation during nanoindentation, From reaction-diffusion to physarum computing, Resource allocation under limited sharing, An O(log n) algorithm for computing periodic continued fractions and its applications, Data flow analysis of distributed communicating processes, The cycle lemma and some applications, On the worst case of three algorithms for computing the Jacobi symbol, Thus spake al-Ḵẖwārizmī: A translation of the text of Cambridge University library ms. ii.vi.5, Confluent Hermitian Cauchy matrices are diagonally signed, Hopf-algebraic structure of families of trees, Some aspects of sorting in two dimensions, Applications of antilexicographic order. I: An enumerative theory of trees, Bounds on distances between eigenvalues, Exponential bounds for the running time of a selection algorithm, On the complexity of partitioning sparse matrix representations, Computing a longest common subsequence for a set of strings, On the average shape of monotonically labelled tree structures, Average time analyses of simplified Davis-Putnam procedures, Blocking, reordering, and the throughput of a series of servers, Programmed deallocation without dangling reference, Generalized binary split trees, Minimizing access pointers into trees and arrays, Parameterisation algorithms for the integer linear programs in binary variables, Average number of rotations access cost in iR-trees, A parallel selection algorithm, Comments on Detection of connectivity for regions represented by linear quadtrees, Sur la génération des arbres binaires par les B-suites, Algebraic approach to p-adic conversion of rational numbers, How evenly should one divide to conquer quickly?, A short Hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof, The existence of refinement mappings, Functional representation of power-law random fields and time series, On partitions and presortedness of sequences, Matrice de ramification des arbres binaires. (Ramification matrices of binary trees), Complex variables and flexure, A generalized Kahan-Babuška-summation-algorithm, Permuting machines and priority queues, Sequential and parallel algorithms for the NCA problem on pure pointer machines, The binomial transform and the analysis of skip lists, Finding a longest nonnegative path in a constant degree tree, On the number of fuzzy subgroups of finite Abelian groups., Computing leximin-optimal solutions in constraint networks, Large deviations analysis for distributed algorithms in an ergodic Markovian environment, A new tree inclusion algorithm, On quickselect, partial sorting and multiple Quickselect, Multidimensional heaps and complementary range searching, Jebelean-Weber's algorithm without spurious factors, Relations between the Clausen and Kazhdan-Lusztig representations of the symmetric group., Efficient software-implementation of finite fields with applications to cryptography, Dyck paths and pattern-avoiding matchings, Refined restricted involutions, How to collect balls moving in the Euclidean plane, Restricted Dumont permutations, Dyck paths, and noncrossing partitions, Average case analysis of DJ graphs, Summation of series defined by counting blocks of digits, An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques, A revised forward and backward heuristic for two-term multiple recursive random number generators, Classification of cyclic braces., Dynamic critical behavior of the Swendsen-Wang algorithm for the three-dimensional Ising model, Explicit solution of the polynomial least-squares approximation problem on Chebyshev extrema nodes, Space-efficient geometric divide-and-conquer algorithms, The weighted dual functionals for the univariate Bernstein basis, Bounds on the size of test sets for sorting and related networks, On arithmetical algorithms over finite fields, Almost optimal dynamic 2-3 trees, The principle of optimality in the design of efficient algorithms, A taxonomy of binary tree traversals, Complexity of certain decision problems about congruential languages, Implementation techniques for the vehicle routing problem, Finding the two-core of a tree, On the number of divisions of the Euclidean algorithm applied to Gaussian integers, Polymorphic arrays: A novel VLSI layout for systolic computers, Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials, Extreme values of exponentially autocorrelated sequences, On non-intersecting Eulerian circuits, On the design of a key-lock-pair mechanism in information protection systems, The generalized Sprague-Grundy function and its invariance under certain mappings, Regressions and monotone chains. II: the poset of integer intervals, Reductions among number theoretic problems, Area-time optimal division for \(T=\Omega ((\log \,n)^{1+\epsilon})\), Ordered priority queues, An algorithm for testing Leopoldt's conjecture, About the choice of uniformly distributed sequences to be used in the random choice method, On a class of nonlinear dynamical systems: the structure of a differential operator in the application of the decomposition method, Divisor generating functions and insertion into a heap, Factoring polynomials and primitive elements for special primes, Level number sequences for trees, Halfplanar range search in linear space and \(O(n^{0.695})\) query time, Jump interpolation search trees and symmetric binary numbers, A note on: `Deque automata and a subfamily of context-sensitive languages which contains all semilinear bounded languages' (by K. Ayers), A catalogue of complete group presentations, Computer algebra: Past and future, Termination of rewriting, On the logistic midrange, Deviations from uniformity in random strings, Efficient generation of binary trees from inorder-postorder sequences, Modeling B-tree insertion activity, Some remarks on Catalan families, A diffusion limit for a class of randomly-growing binary trees, Mechanical translation of set theoretic problem specifications into efficient RAM code - a case study, Bounds for min-max heaps, A logical approach to asymptotic combinatorics I. First order properties, An exponential lower bound for the pure literal rule, Data structures and algorithms for approximate string matching, Generating t-ary trees in A-order, Linear open addressing and Peterson's theorem rehashed, Self-organizing sequential search and Hilbert's inequalities, A VLSI partition algorithm, Modeling splits in file structures, Expected behaviour of \(B^+\)-trees under random insertions, A practically efficient and almost linear unification algorithm, On the length of word chains, Relations between Young's natural and the Kazhdan-Lusztig representations of \(S_ n\), Two algorithms for constructing a binary tree from its traversals, The number of fixed points of the majority rule, Parallel p-adic computation, A note on random sampling, A canonical simplifier for trigonometric expressions in the kinematic equation, Bad cases for shaker-sort, Factorization of large integers, On the distribution of comparisons in sorting algorithms, Counting with rational functions, Inferring decision trees using the minimum description length principle, Dominoes and the complexity of subclasses of logical theories, Fixed-sized blocks optimization, VLSI-sorting evaluated under the linear model, PASCAL programs for identification of Lie algebras. II: SPLIT - a program to decompose parameter-free and parameter-dependent Lie algebras into direct sums, Flexible compensator design for unity-feedback control loops, Standard Young tableaux of height 4 and 5, The use and usefulness of numeration systems, Occupancy with two types of balls, On Nečiporuk's theorem for branching programs, On the joint distribution of the insertion path length and the number of comparisons in search trees, Partially ordered sets associated with permutations, New mathematical identities with applications to flexure and torsion, A note on constructing min-max heaps, A trivial algorithm whose analysis is not: a continuation, The average performance of a parallel stable mariage algorithm, A one-to-one correspondence between two classes of ordered trees, Unsafe operations in B-trees, GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation, Minimizing the number of tardy jobs for \(m\) parallel machines, Univariate polynomial factorization over finite fields, Interactive foundations of computing, Continued fraction algorithms, functional operators, and structure constants, On updating suffix tree labels, Analysis of two-dimensional approximate pattern matching algorithms, Extending STL with efficient data structures, Size-depth tradeoff in non-monotone Boolean formulae, Fast verification, testing, and generation of large primes, Lexicographic generation of ordered trees, Traversing binary trees simply and cheaply, On the relationship between son-trees and symmetric binary B-trees, Lexicographic permutations with restrictions, Uniform data encodings, Parallel calculation of a linear mapping on a computer network, Sorting using networks of deques, A note on universal classes of hash functions, A short proof of the 3d distance theorem, A class of difference equations with polynomial coefficients, A process of runs and its convergence to the Brownian motion, Finding linear and circular sequences of minimal and maximal total adjacency, Purging in an equality data base, The average height of r-tuply rooted planted plane trees, An experimental study of processor thrashing in multiprocessor systems, Reduction of storage employed to represent families of information structures, Reduzierung von Prozeßstauungen vor kritischen Abschnitten mittels Teillistensperrung, On the stability properties of Brown's multistep multiderivative methods, An O(N) algorithm for finding periodicity of a sequence using hash coding, Non-uniform partial-match file designs, A note on a multidimensional searching problem, The interpolation-sequential search algorithm, A recursive radix conversion formula and its application to multiplication and division, Profitability computations on program flow graphs, The analysis of double hashing, Optimal \(\alpha -\beta\)-strees with capacity constraint, The game of \(N\) questions of a tree, Significance arithmetic: The probability of carrying, Hardware simulation of semi-Markov and related processes. I: A versatile generator, On random 2-3 trees, An improved parallel processor bound in fast matrix inversion, Sorting by distributive partitioning, Insertion merge sorting, Genetic order and compactifying garbage collectors, A trivial algorithm whose analysis isn't, Understanding the complexity of interpolation search, The expected linearity of a simple equivalence algorithm, Optimal \(\alpha -\beta\) trees with capacity constraint, Analysis of the Pope-Stein division algorithm, Cyclic ordering is NP-complete, On the many facets of lists, Notes on the derivation of asymptotic expressions from summations, The correctness of the Schorr-Waite list marking algorithm, A linear-time algorithm for finding all feedback vertices, Addition chains with multiplicative cost, Height balanced 2-3 trees, A left part theorem for grammatical trees, On the max-entropy rule for a binary search tree, On a generalization of binary search, A note on Euclidean near neighbor searching in the plane, Dynamic weighted binary search trees, Linear algorithms on recursive representations of trees, Mathematical solution for a data processing system, On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs, Discrete event simulation modelling of computer systems for performance evaluation, A faster, more stable method for comuting the pth roots of positive definite matrices, The number of registers required for evaluating arithmetic expressions, On strictly optimal schedules for the cumulative cost-optimal scheduling problem, Characterization of two-dimensional cellular automata using matrix algebra, The expected additive weight of trees, Complexity analysis of term-rewriting systems, Pseudo-random trees: Multiple independent sequence generators for parallel and branching computations, Hybrid join: An improved sort-based join algorithm, When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?, A computational basis for higher-dimensional computational geometry and applications, Numerical simulation of randomly forced turbulent flows, Stabilizing stationary linear discrete systems: Minimal and balanced expansions in any real base, Inversions in \(k\)-sorted permutations, Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z}\)], Sorting in linear time?, Polygonal radix representations of complex numbers, Fast evaluation of holonomic functions, Labelled trees and pairs of input--output permutations in priority queues, Periodicities on trees, A characteristic property of labelings and linear extensions of posets of dimension 2, On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction, Invariant curves for area-preserving twist maps far from integrable, ATENSOR -- REDUCE program for tensor simplification, Optimal binary trees with order constraints, An efficient multiway merging algorithm, Discontinuous Galerkin finite element method with anisotropic local grid refinement for inviscid compressible flows, Fine and Wilf's theorem for three periods and a generalization of Sturmian words, Formal series and numerical integrators. I: Systems of ODEs and symplectic integrators, Continuous algorithms, Lévy-Sheffer and iid-Sheffer polynomials with applications to stochastic integrals, Computational matrix representation modules for linear operators with explicit constructions for a class of Lie operators, Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees, Enumeration schemes and, more importantly, their automatic generation, A parallel interior point algorithm for linear programming on a network of transputers, The expected number of pairs of connected nodes: Pair-connected reliability, Manipulating multiple stacks with ordered-heap, On generating B-trees with constant average delay and in lexicographic order, Queue-mergesort, Enumerating \(k\)-way trees, On counting planar embeddings, A linear time algorithm for the maximum matching problem on cographs, Computation of the solutions of nonlinear polynomial systems, Fourier transforms with respect to monomial representations, Properties of grammatical codes of trees, A note on bitonic sorting, Image compression using nonlinear pyramid vector quantization, A probabilistic upper bound for the edge identification complexity of graphs, Provably good pattern generators for a random pattern test, A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm, Convolution number, Bounded quantifications for iteration and concurrency in logic programming, Approximating \(x^ n\) efficiently, New algorithms for the LCA problem and the binary tree reconstruction problem, An isomorphism between the \(p\)-adic integers and a ring associated with a tiling of \(N\)-space by permutohedra, Combinatorial properties of rational representations of the group \(\text{GL}(n,\mathbb{C})\), Heuristics for scheduling resource-constrained projects in MPM networks, Enumeration of binary trees, A linear algorithm for centering a spanning tree of a biconnected graph, An optimal bound for path weights in Huffman trees, Algorithms for parallel memory, I: Two-level memories, A calculus for the random generation of labelled combinatorial structures, Precise evaluation of a polynomial at a point given in staggered correction format, Evacuation of labelled graphs, Riordan arrays and combinatorial sums, Forbidden subsequences, Generalized Robinson-Schensted correspondence: A new algorithm, Semi-unification of two terms in Abelian groups, Dynamic dictionary matching, Mellin transforms and asymptotics. The mergesort recurrence, Geometry of \(p\)-adic Siegel discs, A parallel list update problem, A note on randomness, Proof versus formalization, Random walks, heat equation and distributed algorithms, Binomial identities -- combinatorial and algorithmic aspects, Origins of the analysis of the Euclidean algorithm, An alternative presentation of the Schensted correspondence, Determination of locations of point-like masses in an inverse source problem of the Poisson equation, On reaching head-to-tail ratios for balanced and unbalanced coins, Efficient multiway radix search trees, A fast maximum finding algorithm on broadcast communication, Uniform random generation of words of rational languages, On the dependence of numeration systems associated to the powers of a Pisot number, Molecular dynamics for polymeric fluids using discontinuous potentials, Elimination of constants from machines over algebraically closed fields, Character sum identities in analogy with special functions identities, A generalized Mahonian statistic on absorption ring mappings, Expansion properties of Cayley graphs of the alternating groups, Multiplicative circulant networks. Topological properties and communication algorithms, Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection, A portable high-quality random number generator for lattice field theory simulations, RANEXP: Experimental random number generator package, Pseudorandom number generators for Salford FTN77, A review of pseudorandom number generators, Fibonacci numbers and words, Sloping-and-shaking, A model of the loop formation process on knitting machines using finite automata theory, A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network, The Selberg-Jack symmetric functions, Magic sets revisited, The probability of Condorcet cycles and super majority rules, A combinatorial interpretation of the generalized Fibonacci numbers, Measures of distinctness for random partitions and compositions of an integer, The combinatorics of discrete self-similarity, Counting and topological order, Fast Gaussian random number generation using linear transformations, A Fortran 90 interface to random number generation, On the sequentiality of the successor function, On the solution of linear recurrence equations, Size-estimation framework with applications to transitive closure and reachability, On square-free factorization of multivariate polynomials over a finite field., Generating power of lazy semantics, Linear speed-up for cellular automata synchronizers and applications, Efficient enumeration of all minimal separators in a graph, Automaticity. II: Descriptional complexity in the unary case, Correctness of constructing optimal alphabetic trees revisited, Perfect hashing, Bounded capacity priority queues, Limiting semantics of numerical programs, Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks, Optimal layouts on a chain ATM network, A note on implementing parallel assignment instructions, A stable minimum storage sorting algorithm, A structured program to generate all topological sorting arrangements, Remarks on the complexity of roundoff analysis, The validity of return address schemes, Quad trees: A data structure for retrieval by composite keys, An algorithm for computation of translation invariant groups and the subgroup lattice, On the representation of simply generated trees by leftist trees, On primitive recursive algorithms and the greatest common divisor function, Optimal binary search trees with costs depending on the access paths., Emerging behavior as binary search trees are symmetrically updated., A model for roundoff and collapse in computation of chaotic dynamical systems, Using tabu search with longer-term memory and relaxation to create examination timetables., Adaptive wavelet representation and differentiation on block-structured grids., Event-driven molecular dynamics in parallel., Algorithmic approach to counting of certain types \(m\)-ary partitions., Application of basic hypergeometric series., Regular closed sets of permutations., The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves., Solving problems for maximal reducible flowgraphs., Generalized cover-free families., A general limit theorem for recursive algorithms and combinatorial structures, Aggregation of stochastic automata networks with replicas, Computing Prüfer codes efficiently in parallel, An extension of alias sampling method for parametrized probability distributions, Maximal codeword lengths in Huffman codes, A combinatorial proof of the log-concavity of the numbers of permutations with \(k\) runs, Sturmian words and words with a critical exponent, On the limits of nonapproximability of lattice problems, Min-wise independent permutations, Computing the cycles in the perfect shuffle permutation, A combinatorial proof of J. West's conjecture, Averaging sequences, deranged mappings, and a problem of Lampert and Slater, Sharpness of some intersection theorems, Critical exponents, hyperscaling, and universal amplitude ratios for two- and three-dimensional self-avoiding walks., Improved inference of mutation rates. II: Generalization of the Luria-Delbrück distribution for realistic cell-cycle time distributions, Predicting zero coefficients in formal power series computations., Forest volume decompositions and Abel-Cayley-Hurwitz multinomial expansions, Symmetry and unimodality in \(t\)-stack sortable permutations, The continuum as a final coalgebra, Residue polynomial systems, Shape avoiding permutations, An iterative modular multiplication algorithm, Laws of large numbers and tail inequalities for random tries and PATRICIA trees, A generating functionology approach to a problem of Wilf, Runs of geometrically distributed random variables: A probabilistic analysis, Binary search tree recursions with harmonic toll functions, Combined random number generator via the generalized Chinese remainder theorem, A novel key management scheme for dynamic access control in a user hierarchy, Geographic and network surveillance via scan statistics for critical area detection, Note on the minimal permutations, Descent monomials, \(P\)-partitions and dense Garsia-Haiman modules, The analysis of evolutionary algorithms on sorting and shortest paths problems, The strict avalanche criterion randomness test, Recurrences for alternating sums of powers of binomial coefficients, Nonlinear autoregressive model based on fuzzy relation, Directed hypergraphs and applications, A random number generator based on unpredictable chaotic functions, A moving-box algorithm to estimate generalized dimensions and the \(f(\alpha)\) spectrum, An approximate algorithm for the minimal vertex nested polygon problem, Bijection between indexed monomials and standard bitableaux, Classes of GFSR sequences and their fast generation, A ``geometric view of the dynamics of trajectories of computer programs, Sorting, linear time and the satisfiability problem, TVOO: A Temporal Versioned Object-Oriented data model, Fast finite methods for a system of linear inequalities, Hook Young diagrams with applications to combinatorics and to representations of Lie superalgebras, A parallel derangement generation algorithm, Efficient algorithms for tree reconstruction, Instabilities in the solution of a heat conduction problem using Taylor series and alternative approaches, Projectively invariant classes of geometric continuity for CAGD, The properties of random trees, Gray code for derangements, Sieve equivalence in generalized partition theory, Comparing alternative tests of causality in temporal systems. Analytic results and experimental evidence, A storage scheme for extendible arrays, A-transformation dans les arbres n-aires, A linear algorithm for the number of degree constrained subforests of a tree, On the average oscillation of a stack, Smoothsort's behavior on presorted sequences, Is SSS* better than alpha-beta?, Asymptotic theory of characters of the symmetric group, A general class of resource tradeoffs, A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures, Andre's reflection proof generalized to the many-candidate ballot problem, On monotone functions of tree structures, Insertion-safeness in balanced trees, The asymptotic behaviour of a distributive sorting method, Log-logarithmic worst-case range queries are possible in space theta(N), Mean for the sum of elements over a class of finite continued fractions, T. L. Hill's graphical method for solving linear equations, Asymptotic values for degrees associated with strips of Young diagrams, On computability of the mean deviation, Equivariant mappings: A new approach in stochastic simulations, An efficient algorithm to find optimal double loop networks, A data structure formalization through generating function, A note on finding the bridges of a graph, The cost of a class of optimal binary trees, A linear time two tape merge, Congruence arithmetic algorithms for polynomial real zero determination, Conversion of programs between computers: Interpreters, simulators and compilers, Sorting by means of swappings, Application of heuristic methods for conformance test selection, Tree pattern matching with a more general notion of occurrence of the pattern., A note on constructing binary heaps with periodic networks., There is no optimal routing policy for the torus., Binary space partitions for axis-parallel line segments: Size-height tradeoffs., On the query complexity of finding a local maximum point., Sorting with two ordered stacks in series., Public data structures: counters as a special case., Some results on tries with adaptive branching., Distributed cooperative Bayesian learning strategies., Lower bounds for merging networks, Searching a database under decoherence, Extreme value statistics and traveling fronts: Various applications, Computing the rational torsion of an elliptic curve using Tate normal form., On the distribution of the number of Young tableaux for a uniformly random diagram, Taylor expansions for Catalan and Motzkin numbers, A simplicial complex of 2-stack sortable permutations, An asymptotic study for path reversal., Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases, Expected time analysis for Delaunay point location, A super-class walk on upper-triangular matrices, Finding hidden independent sets in interval graphs, A list-based compact representation for large decision tables management, Restricted permutations and queue jumping, AOP arithmetic architectures over GF(2\(^m\)), A multi-material Eulerian formulation for the efficient solution of impact and penetration problems, The Euler-Mahonian distributions over the words, Cost-optimal parallel algorithms for constructing B-trees, On Ramanujan's \(Q\)-function, Minimean optimal key arrangements in hash tables, Multiple filtration and approximate pattern matching, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, A new way of counting \(n^ m\), A general iterative sparse linear solver and its parallelization for interval Newton methods, Self-avoiding walks and trees in spread-out lattices, Linear recurring sequences over modules, A new technique for the solution of the Saha equation, Recurrence relations on heaps, Linear recurring sequences over rings and modules, Perfect matchings in the triangular lattice, Combinatorics of geometrically distributed random variables: Left-to-right maxima, Special nonuniform lattice (snul) orthogonal polynomials on discrete dense sets of points, A Monte Carlo study of some limited and full information simultaneous equation estimators with normal and nonnormal autocorrelated disturbances, The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization, Blocking for external graph searching, Efficiently extendible mappings for balanced data distribution, Singularities of finite scaling functions, On strongly connected digraphs with bounded cycle length, Stack words, standard tableaux and Baxter permutations, Tableau algorithms defined naturally for pictures, Finite rank intermediate Hankel operators, Triangular factors of Cauchy and Vandermonde matrices, The use of error detection and compensation techniques for testing the integer class cBigNumber, Enumeration by kernel positions for strongly Bernoulli type truncation games on words, Scale invariant operators and combinatorial expansions, A pseudo-random number generator for personal computers, The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk., Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints., On extremal permutations avoiding \(\omega_N=NN-1\dots 1\), Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind, Critical comments on the programming language Pascal, On the monotonicity of hierarchical sum-product fuzzy systems, Partitions and normal trees, The basic algorithm for pseudo-Boolean programming revisited, Patterns in trees, An inversion formula and fast algorithms for Cauchy-Vandermonde matrices, Counting and randomly generating binary trees, Theory and algorithms for analysing the consistent region in probabilistic logic, Analysis of the multigroup method for manipulating multiple stacks, On the maximum length of Huffman codes, On binary search trees, Selection problems via \(m\)-ary queries, Finding extrema with unary predicates, Sublinear merging and natural mergesort, Restricted simplicial decomposition for convex constrained problems, Row-wise algorithms of ST decomposition, Cunningham numbers in modular arithmetic, Fast gapped variants for Lempel-Ziv-Welch compression, A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows, Generating all permutations by context-free grammars in Greibach normal form, On Chen and Chen's new tree inclusion algorithm, Replacement sort revisited: The ``gold standard unearthed!, A unified approach to polynomial sequences with only real zeros, Strict ergodicity of affine \(p\)-adic dynamical systems on \(\mathbb Z_p\), Software complexity: a statistical case study through insertion sort, A new genetic approach to construct near-optimal binary search trees, Enumeration problems for classes of self-similar graphs, Enumeration of algebras close to absolutely free algebras and binary trees, Cycle detection using a stack, Probabilistic integer sorting, Local bifurcations of critical periods in a generalized 2D LV system, A survey on the continuous nonlinear resource allocation problem, Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic, Tree polynomials and non-associative Gröbner bases, Technologies of parallel database systems for hierarchical multiprocessor environments, Access control in user hierarchy based on elliptic curve cryptosystem, On the cost of optimal alphabetic code trees with unequal letter costs, Actions on permutations and unimodality of descent polynomials, Interpolation for nonlinear BVP in circular membrane with known upper and lower solutions, The cost of offline binary search tree algorithms and the complexity of the request sequence, Performance analysis of ``groupby-after-join query processing in parallel database systems, An alternative algorithm for computing the pseudo-remainder of multivariate polynomials, Efficient unbalanced merge-sort, Reducing coding redundancy in LZW, On the inversion of the Vandermonde matrix, Vandermonde systems on equidistant nodes in \([0,1\): accurate computation], Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension, Avoiding patterns of length three in compositions and multiset permutations, Toward verification of the Riemann hypothesis: application of the Li criterion, Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time \(D\lfloor \log_mD\rfloor\), How to compute modular exponentiation with large operators based on the right-to-left binary algorithm, A dynamic adaptation scheme for general 3-D hybrid meshes, Numerical accuracy of a certain class of iterative methods for solving linear system, A probabilistic analysis of some tree algorithms, The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices, Definability as hypercomputational effect, Reconstruction of Kauffman networks applying trees, Combinatorial aspects of continued fractions. (Reprint), An algorithm for partitioning a set into simple parts, Polynomial equations with one catalytic variable, algebraic series and map enumeration, Trapping, percolation, and anomalous diffusion of particles in a two-dimensional random field, Theoretical analyses of forward and backward heuristics of multiple recursive random number generators, Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series, Kernel method and system of functional equations, Negation of binomial coefficients, Towards a theory of semantics and compilers for programming languages, The programming language Pascal, Heuristically guided search and chromosome matching, Data graphs and addressing schemes, Pattern reproduction in tessellation automata of arbitrary dimension, Computation of powers of multivariate polynomials over the integers, Optimum binary search trees, A new additive pseudorandom number generator for extremely short word- lengths, Fast and read-only algorithms for traversing trees without an auxiliary stack, Die Bestimmung kürzester Pfade in Graphen und passende Datenstrukturen, Representation of binary trees on associative memories, Relational level data structures for programming languages, Significance arithmetic: The carrying algorithm, Node flows in graphs with conservative flow, On computing the time complexity of transitive closure algorithms, Use of symbolic computation to generate evolution equations and asymptotic solutions to elliptic equations, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results, Quantile and tolerance-interval estimation in simulation, Some aspects of scatter search in the flow-shop problem, Vandermonde systems on Gauss-Lobatto Chebyshev nodes, Efficiency improvements in inference on stationary and nonstationary fractional time series, A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation., An algorithm for modular exponentiation., Isogeometric analysis of the Cahn-Hilliard phase-field model, Simulation of ruin probabilities, On the approximation of Catalan numbers and other quantities, Inferential procedures for correlation coefficients corrected for attenuation, Fringe analysis for extquick: An in situ distributive external sorting algorithm, The largest set partitioned by a subfamily of a cover, The unsatisfiability threshold revisited, A relative van Hoeij algorithm over number fields, A context-free language for binary multinomial processing tree models, An adaptive algorithm for simulation of stochastic reaction-diffusion processes, A computer-assisted optimal depth lower bound for nine-input sorting networks, Unnamed Item, An acceptance-complement analogue of the mixture-plus-acceptance-rejection method for generating random variables, A note on the complexity of program evaluation, Unfoldings of discrete dynamical systems, Speedup of linear stationary iteration processes in multiprocessor computers. I, Approximate counting : an alternative approach, Probabilistic analysis of some distributed algorithms, On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing, A Band and Bound Technique for Simple Random Algorithms, On Optimum Cycle Bases, New public-key cryptosystem, The Ballot Problem Revisited, On the Joint Path Length Distribution in Random Binary Trees, A hierarchy for circular codes, Binary Models for Marginal Independence, Unnamed Item, Unnamed Item, COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS, Unnamed Item, Tree Drawings on the Hexagonal Grid, Branching-Time Temporal Logics with Minimal Model Quantifiers, INFERENCE ON NONPARAMETRICALLY TRENDING TIME SERIES WITH FRACTIONAL ERRORS, A multiple stream generator based on de Bruijn digraph homomorphisms, On Level Numbers of t-Ary Trees, Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations, Design and data structure of fully adaptive, multigrid, finite-element software, Solution of a problem of Knuth on complete uniform distribution of sequences, Unnamed Item, Exact and asymptotic distributions in digital and binary search trees, A complexity calculus for recursive tree algorithms, Functions of binary trees and their applications in algorithm complexity analysis, Unnamed Item, Unnamed Item, Primal transportation and transshipment algorithms, Optimal search trees and length restricted codes, Storage representations for tree-like data structures, Current methods for proving program correctness, Relative complexity of algebras, Solution techniques for some allocation problems, Speed-Up in Dynamic Programming, On the Average Shape of Binary Trees, Exact Solution of Systems of Linear Equations with Iterative Methods, Unnamed Item, Selection and sorting in totally monotone arrays, PASCALIAN RECTANGLES MODULOm, On random and adaptive parallel generation of combinatorial objects, A more efficient algorithm for the min-plus multiplication, The complexity of on-line simulations between multidimensional turing machines and random access machines, Performance analysis of stack space allocation based upon random walk model, An APL approach to the representation and manipulation of data structures, A dynamic storage allocation algorithm and its hardware implementation, On storing arbitrarily many extendible arrays of arbitrary dimensions, On data retrieval from unambiguous bit matrices, Generalized addressing schemes for data graphs, The linearization of flow charts, Multilevel functional simulation, Computation of resource requirements, A fast compactifying garbage collector, A note on weighted buddy systems for dynamic storage allocation, On storing ragged arrays by hashing, Bounds for optimalα-β binary trees, The segmented sieve of eratosthenes and primes in arithmetic progressions to 1012, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, The complexity of monotone boolean functions, Space bounds for a game on graphs, Dynamic hashing, An algorithm for determining all extreme points of a convex polytope, Testing equality in lisp-like environments, The use of finite-segmentp-adic arithmetic for exact computation, Testing of a large-scale network optimization program, Literal solution for Hill's lunar problem, New factorization codes for sparse, symmetric and positive definite matrices, A note on answer extraction in resolution-based systems, Time required for garbage collection in retention block-structured languages, An application of coroutines and backtracking in interactive systems, Bounds on the costs of data encodings, Characterizing sets of data structures by the connectivity relation, On the Average Case Complexity of Some P-complete Problems, Greedy Search on the Binary Tree with Random Edge-Weights, On weakly correlated random numbers generator, On the average number of registers needed to evaluate a special class of backtrack trees, A lower bound for sorting networks based on the shuffle permutation, Generate all maximal independent sets in permutation graphs, On the average minimal prefix-length of the generalized semi-Dycklanguage, Uniformly growing backtrack trees, Generation oft-ary trees with Ballot-sequences*, Succession rules and Deco polyominoes, The general birthday problem, The convex hull of a linear congruence relation in zero-one variables, ECO:a methodology for the enumeration of combinatorial objects, Low order polynomial bounds on the expected performance of local improvement algorithms, The flow circulation sharing problem, Representations of the language recognition problem for a theorem prover, A NEW HASHING ALGORITHM FOR PARALLEL PROCESSORS, A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗, Binary trees, fringe thickness and minimum path length, A model for the formal definition of programming languages, Enumerating Membrane Structures, The Church-Turing Thesis over Arbitrary Domains, Semantics of context-free languages, Data structure and storage allocation, Functional Pearls, Proving programs correct: Some techniques and examples, On file structuring for non-uniform access frequencies, A bi-unique transformation into integers of identifiers and other variable-length items, Theory and Application of Plane Partitions: Part 1, Theory and Application of Plane Partitions. Part 2, Some problems in discrete optimization, Storage administration in a virtual memory Simula system, Optimal binary search methods, Efficiency of the Fibonacci search method, Implementing the ALGOL 68 heap, The number of plane trees, Marking algorithms, Number shortening algorithms, Factoring polynomials over finite fields: A survey, AVL trees with relaxed balance, Simplicial properties of the set of planar binary trees, A fast algorithm for generating a uniform distribution inside a high-dimensional polytope, Counting classes: Thresholds, parity, mods, and fewness, Monte Carlo Metropolis simulation of interacting anisotropic polarizable spins on a lattice, Enumerating alternating trees, Problem solving by heterogeneous agents, Restricted permutations, Detecting algebraic curves in bad position, On a transfer theorem for the \(\text{P}\neq \text{NP}\) conjecture, Two classes of ternary codes and their weight distributions, Optimal binary search trees, Learning logic programs with structured background knowledge, Inversion approximations for functions via \(s\)-power series, Uniform asymptotics of some Abel sums arising in coding theory, An operator on permutations and its application to Eulerian numbers, Restricted permutations, On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol, An effective algorithm for simulating diffusion-driven aggregation, Co-evolutionary search in asymmetric spaces, Generalized pattern avoidance, Predictability: a way to characterize complexity, A Repetition Test for Pseudo-Random Number Generators, An analysis of the quasicontinuum method, Combinatorics for the East model, Parallel random number generator for inexpensive configurable hardware cells, The effect of mobility on minimaxing of game trees with random leaf values, Priority queues with binary priorities, The stack-size of tries: A combinatorial study, Degree elevation for generalized Poisson functions, A mechanism for randomness, Depth-m search in branch-and-bound algorithms, Ergodic maps on [0, 1 and nonlinear pseudo-random number generators], Combinatorial analysis of quicksort algorithm, A Deterministic Algorithm for Factorizing Polynomials over Extensions GF(pm) of GF(p), p a Small Prime, Unnamed Item, Fast algorithms for genegrating integer partitions
Uses Software
