scientific article; zbMATH DE number 3303655
From MaRDI portal
zbMath0191.18001MaRDI QIDQ5585021
Publication date: 1969
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
A reliable algorithm to check the accuracy of iterative schemes for solving nonlinear equations: an application of the CESTAC method, A homophonic DES, Even faster integer multiplication, Inversion of extremely ill-conditioned matrices in floating-point, On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime, Efficient hardware implementation of finite fields with applications to cryptography, A method of obtaining verified solutions for linear systems suited for Java, Obtaining identical results with double precision global accuracy on different numbers of processors in parallel particle Monte Carlo simulations, BRS-compactness in networks: Theoretical considerations related to cohesion in citation graphs, collaboration networks and the internet, The origins of combinatorics on words, A note on the complexity of approximative evaluation of polynomials, Lower bounds for a polynomial in terms of its coefficients, On regular realizability problems, The Schur aggregation and solving ill conditioned linear systems: the convergence theorem, Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source, Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths, On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations, Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux, A combinatorial approach to binary positional number systems, Self-pairings on supersingular elliptic curves with embedding degree \textit{three}, Two stacks in series: a decreasing stack followed by an increasing stack, Revstack sort, zigzag patterns, descent polynomials of \(t\)-revstack sortable permutations, and Steingrímsson's sorting conjecture, Inversion formulae on permutations avoiding 321, Functional graphs of polynomials over finite fields, Differential evolution for noisy multiobjective optimization, Dynamics of finite linear cellular automata over \(\mathbb Z_N\), Accelerating Pollard's rho algorithm on finite fields, Block companion singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields, On computing the intersection of a pair of algebraic surfaces, Status of the differential transformation method, Combinatorial complexity bounds for arrangements of curves and spheres, The mean number of steps in the Euclidean algorithm with odd partial quotients, Operators of equivalent sorting power and related Wilf-equivalences, Existence of a limiting distribution for the binary GCD algorithm, An infinite family of inv-Wilf-equivalent permutation pairs, Permutations sortable by \(n - 4\) passes through a stack, Random and exhaustive generation of permutations and cycles, Tail asymptotics for a generalized two-demand queueing model -- a kernel method, Quantitative uniform distribution results for geometric progressions, Comments to my works, written by myself, Formal study of functional orbits in finite domains, A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations, A family of entire functions which determines the splitting behavior of polynomials at primes, A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix, Collisionful keyed hash functions with selectable collisions, Sums of squares based approximation algorithms for MAX-SAT, Limit theorems for the number of successes in random binary sequences with random embeddings, Arithmetical sequences and systems of functional equations, Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques, On the additive complexity of GCD and LCM matrices, Pattern avoidance and Young tableaux, On a mnemonic construction of permutations, Cycle detection algorithms and their applications, Mathematical vanity plates, Sequences generating permutations, Choose the damping, choose the ranking?, A stochastic partial differential equation for computational algorithms, The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2, A survey on tree edit distance and related problems, Descent polynomials for permutations with bounded drop size, The effects of time delay on the decline and propagation processes of population in the Malthus-Verhulst model with cross-correlated noises, A clustering method based on the \(L_ 1\)-norm, On finite-precision representations of geometric objects, Effective bounds for P-recursive sequences, Online data storage using implicit security, Powers of rationals modulo 1 and rational base number systems, Optimal computer memory allocation for the Poisson flows, Vertex percolation on expander graphs, Testing random number generators by numerical modeling of an exactly solvable problem, Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm, Coalescent simulation in continuous space: algorithms for large neighbourhood size, Time-delay induced reentrance phenomenon in a triple-well potential system driven by cross-correlated noises, Numerical simulations of stochastic differential equations, Power series remainder sequences and Padé fractions over an integral domain, Search of primitive polynomials over finite fields, A caution on universal classes of hash functions, Implementation of universal computer arithmetic with optimal accuracy, Zur Axiomatisierung logarithmischer und halblogarithmischer Zahlensysteme. (On the axiomatization of logarithmic and semi-logarithmic number systems), A new application of Lagrange-Bürmann expansions. I. General principle, A test for multidimensional clustering tendency, Algorithm for calculating the roots of polynomials with coefficients in the ring of polynomials over an arbitrary integral domain, Reading Gauss in the computer age: On the U.S. Reception of Gauss's number theoretical work (1938-1989), New structural properties of strings generated by leading digits of \(2^ n\), The simulation of random processes on digital computers: Unavoidable order, String patterns of leading digits, A fast processor for Monte-Carlo simulation, Some average performance measures for the B-tree, Is \(\pi\) normal ?, Solvable groups with operators and commutative rings having transitive polynomials, Fast algorithms for the characteristic polynomial, Improved lower bounds for the cycle detection problem, The construction of SL(2,3)-polynomials, A language-driven generalized numerical database translator, Analysis of algorithms on problems in general abelian groups, A mathematical model and numerical method for studying platelet adhesion and aggregation during blood clotting, On levels in arrangements and Voronoi diagrams, Degenerate parametric curves, Multiplication is the easiest nontrivial arithmetic function, Parallel multiplication and powering of polynomials, Computing a basis for a finite Abelian p-group, Assessing pandemic uncertainty on conditions of vaccination and self-isolation, The kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systems, Effects of a periodic drive and correlated noise on birhythmic van der Pol systems, The equality relations in scientific computing, The reaching task: Evidence for vector arithmetic in the motor system?, Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints, Transport and diffusion of Brownian particles in a tilted deformable potential, Error rates in quadratic discrimination with constraints on the covariance matrices, On Ramanujan's \(Q\)-function, Random-number generation for parallel processors, Probabilistic analysis of some (un)directed animals, Comparison of transfer entropy methods for financial time series, An informal introduction to a high level language with applications to interval mathematics, Functional equations for peculiar functions, Speeding up the computations of elliptic curves cryptoschemes, Gaussian happy numbers, Multi-fuzzy soft groups, Second-order algorithm for simulating stochastic differential equations with white noises, Patterns in Shi tableaux and Dyck paths, Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields, Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents, On the structure of digraphs of polynomial transformations over finite commutative rings with unity, A search for good pseudo-random number generators: survey and empirical studies, A fast random number generator for the Intel Paragon supercomputer, Division in residue number systems involving length indicators, Modular algorithm for reducing matrices to the Smith normal form, On the number of permutations on \(n\) objects with greatest cycle length \(k\), Orbital varieties in \({\mathfrak sl}_n\) and the Smith conjecture, Probabilistic modeling of moisture flow in layered vadose zone: Applications to waste site performance assessment, Mean field mutation dynamics and the continuous Luria-Delbrück distribution, The efficient calculation of powers of polynomials, Subresultants revisited., Keeping logic in the trivium of computer science: a teaching perspective, New second preimage attacks on dithered hash functions with low memory complexity, Permanent formulae from the Veronesean, Upper and lower bounds for the Voronoi-Minkowski constant, On orbital variety closures in \(\mathfrak{sl}_n\). I: Induced Duflo order., Benford's law for exponential random variables., On homomorphisms from the Hamming cube to \(\mathbb{Z}\), Numerical integration of stochastic differential equations., Proximity measures for terms based on fuzzy neighborhoods in document sets., On the exact distribution of the iostropic planar point processes of phase type, A method for computing Lucas sequences, Central limit theorems in the configuration model, Choosing and generating parameters for pairing implementation on BN curves, On random partitions induced by random maps, On degrees of modular common divisors and the big prime gcd algorithm, Different generalizations of bags, Compensated de Casteljau algorithm in \(K\) times the working precision, A linear algorithm for integer programming in the plane, Efficient exact computation of iterated maps, Stein's method via induction, Time delay induces oscillatory coherence in intracellular calcium oscillation system, Change of scaling and appearance of scale-free size distribution in aggregation kinetics by additive rules, Benford analysis of quantum critical phenomena: first digit provides high finite-size scaling exponent while first two and further are not much better, On Bellman's and Knuth's problems and their generalizations, Unimodular polynomial matrices over finite fields, Generic sequences, transducers and multiplication of normal numbers, Distribution of integers into k-tuples with prescribed conditions, Stable characters from permutation patterns, The complexity of some reachability problems for a system on a finite group, Tight time-space lower bounds for finding multiple collision pairs and their applications, Uniformly distributed sequences in computer algebra or how to construct program generators of random numbers, Forum on Benford's law and statistical methods for the detection of frauds, Arithmetic and dynamical properties of the Rauzy fractal, Efficient and accurate KAM tori construction for the dissipative spin-orbit problem using a map reduction, Upper bounds on Poisson tail probabilities, Explicit evaluation of certain definite integrals involving powers of logarithms, Top tree compression of tries, Floating point Gröbner bases., The truth and nothing but the truth, Stochastic calculus in physics, An alias method for sampling from the normal distribution, Digital straightness -- a review, Linear response and stochastic resonance of superparamagnets, Degenerate Bogdanov-Takens bifurcation of codimension 4 in Holling-Tanner model with harvesting, A fast parallel high-precision summation algorithm based on AccSumK, On the transformation semigroups of finite automata, Optimal multipliers for pseudo-random number generation by the linear congruential method, Interpolation of the Zech's logarithm: explicit forms, Fine and Wilf's theorem for three periods and a generalization of Sturmian words, Lower bounds for the cycle detection problem, An addressable machine as the interpretation of a free group, Comparing the computational complexity of monomials and elements of finite abelian groups, Computer methods for sampling from gamma, beta, Poisson and binomial distributions, A random-walk pseudorandom byte generator, Numerical results for the three-state critical Potts model on finite rectangular lattices., New numerical-analytical methods in diffraction theory, Bifurcations in Holling-Tanner model with generalist predator and prey refuge, Some good multipliers for random number generators for 16-bit microcomputers, Birhythmic oscillations and global stability analysis of a conductance-based neuronal model under ion channel fluctuations, The music of streams, Low-CP-rank tensor completion via practical regularization, Critical market crashes, The asymptotic distribution of the diameter of a random mapping, Probabilistic methods in coloring and decomposition problems, Search for combinatorial objects using lattice algorithms -- revisited, Server-aided honest computation for cryptographic applications, Computer algebra and large scale perturbation theory, On the streaming indistinguishability of a random permutation and a random function, Numerical Treatment of Homogeneous and Non-homogeneous Semi-Markov Reliability Models, ``Geometry of numbers in a context of algebraic theory of numbers, Summing up function values in parallel: A complexity analysis, Base extension using a convolution sum in residue number systems, Automating Induction with an SMT Solver, Improving hit-and-run for global optimization, Growth of the Brownian forest, Unnamed Item, Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements, Few Product Gates But Many Zeros, EFFECTS OF NOISE CORRELATION AND TIME DELAY ON TRANSIENT PROPERTIES OF A CANCER GROWTH SYSTEM WITH IMMUNIZATION, On ASGS framework: general requirements and an example of implementation, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, Comparing finite abelian groups from the standpoint of their cryptographic applications, On finding the largest root of a polynomial, Secret sharing with secure secret reconstruction, Substitutive structure of Jeandel-Rao aperiodic tilings, Efficient sampling methods for discrete distributions, Shuffling matrices, Kronecker product and discrete Fourier transform, Improved filter permutators for efficient FHE: better instances and implementations, Effective Fokker-Planck equation for birhythmic modified van der Pol oscillator, Space reduction constraints for the median of permutations problem, The number of 4-colorings of the Hamming cube, Predicting truncated multiple recursive generators with unknown parameters, Maximum number of steps taken by modular exponentiation and Euclidean algorithm, The number of maximal independent sets in the Hamming cube, Benford or not Benford: a systematic but not always well-founded use of an elegant law in experimental fields, Bidirectional comparison of multi-attribute qualitative objects, A linear algorithm for the random sampling from regular languages, Approximation algorithms for the traveling repairman and speeding deliveryman problems, Stochastic bifurcations induced by correlated noise in a birhythmic van der Pol system, Identifying weak focus of order 3 in a Leslie-Gower prey-predator model with prey harvesting, The law of large numbers for the sum of the partial quotients of a rational number with fixed denominator, The Sidel'nikov method for estimating the number of signs on segments of linear recurrence sequences over Galois rings, Effects of noise correlation on the coherence of a forced van der Pol type birhythmic system, Positivity of permutation pattern character polynomials, On a machine-checked proof for fraction arithmetic over a GCD domain, Computation of domains of analyticity for the dissipative standard map in the limit of small dissipation, Scientific achievements of Anatolii Alekseevich Karatsuba, Representations for complex numbers with integer digits, Uniform distribution, Benford's law and scale-invariance, New dissimilarity measure for recognizing noisy subsequence trees, Generating all polynomial invariants in simple loops, Analyzing Standards for RSA Integers, On taking square roots without quadratic nonresidues over finite fields, A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\), A review on Monte Carlo simulation methods as they apply to mutation and selection as formulated in Wright-Fisher models of evolutionary genetics, Properties of higher criticism under strong dependence, On the mantissa distribution of powers of natural and prime numbers, Random matrix theory over finite fields, Kernel method and linear recurrence system, Distribution of \(r\)-tuples in one class of uniformly distributed sequences over residue rings, Computationally efficient algorithms for a one-time pad scheme, Division in logspace-uniformNC1, On computing reciprocals of power series, On intersections of orbital varieties and components of Springer fiber, The collapse point of interacting trails in two dimensions from kinetic growth simulations, Properties of four partial orders on standard Young tableaux, Bimonotone enumeration, A new construction of threshold cryptosystems based on RSA, Medians of Permutations: Building Constraints, Relation between two measures of the computation complexity for systems of monomials, Reproducibility strategies for parallel preconditioned conjugate gradient, Verified bounds for the determinant of real or complex point or interval matrices, Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs, Optimal Covering Codes for Finding Near-Collisions, The uniform distribution of sequences generated by iterated polynomials, Global dynamics of an enzyme-catalyzed reaction system, Singularities of algebraic surfaces with \(\mathbb C^ *\) action, The Discrete Logarithm Problem, Pseudo-random numbers - a new proposal for the choice of multiplicators, A self-similar aperiodic set of 19 Wang tiles, Memory-Efficient Algorithms for Finding Needles in Haystacks, Algebraic theory of finite Fourier transforms, On the statistical properties on the least square interpolating polynomials, Fast multiplication of large numbers, A floating-point technique for extending the available precision, Evaluating polynomials at many points, Binary Addition Chain on EREW PRAM, Ergodic computations with continued fractions and Jacobi's algorithm, An exact determination of serial correlations of pseudo-random numbers, Computation of powers of multivariate polynomials over the integers, Symmetric binary B-trees: Data structure and maintenance algorithms, Bounds on algorithms for string generation, Cryptanalysis of the FLIP Family of Stream Ciphers, Berechnung und Programm. I, Solving discrete logarithm problems faster with the aid of pre-computation, Passing through a stack \(k\) times with reversals, Optimal algorithms for parallel polynomial evaluation, A combinatorial method for the generation of normally distributed random numbers, Berechnungen in partiellen Algebren endlichen Typs, Exact tail asymptotics for fluid models driven by an \textit{M/M/c} queue, On the number of inversions in bimodal permutations, Parallel computation of the multi-exponentiation for cryptosystems, On quasi-Monte Carlo simulation of stochastic differential equations, Exact real arithmetic using centred intervals and bounded error terms, \(p(x)\)-circulants over finite fields and probability methods of their construction, Predicting power changes under transformations in anova tests, Arithmetic complexity of certain linear transformations, Computational barriers in minimax submatrix detection, Permutree sorting, Improving ECDLP Computation in Characteristic 2, Introduction to Yuragi Learning, PERIODICITY AS CONDITION TO NOISE ROBUSTNESS FOR CHAOTIC MAPS WITH PIECEWISE CONSTANT INVARIANT DENSITY, Expected behaviour analysis of AVL trees, Random number generators produce collisions: Why, how many and more, A New Test of Randomness for Lehmer Generators Based on the Manhattan Distance Between Pairs of Consecutive Random Numbers, Computing special powers in finite fields, On quadratic fields with large 3-rank, Polynomial Multiplication over Finite Fields in Time \( O(n \log n \), Computer cryptographic techniques for processing and storage of confidential information†, It is easy to determine whether a given integer is prime, A statistical model of roundoff error for varying length floating-point arithmetic, Unnamed Item, A server-aided computation protocol for rsa enciphering algorithm, On the complexity of computing the greatest common divisor of several univariate polynomials, Cycle Length in a Random Function, Computation of the unit in the first place (ufp) and the unit in the last place (ulp) in precision-\(p\) base \(\beta\), A method for analyzing repetitive pseudorandom sequences by the criterion of Markov chain entropy, Fertilitopes, Mixing times of Markov chains for self‐organizing lists and biased permutations, Fast and accurate computation of the Euclidean norm of a vector, The infinite limit of separable permutations, Efficient Generic Quotients Using Exact Arithmetic, Computing waiting time probabilities related to \((k_1, k_2, \dots, k_l)\) pattern, An extended Jebelean^ WeberNSedjelmaci GCD algorithm, Fiat-Shamir transformation of multi-round interactive proofs (Extended version), General framework for deriving reproducible Krylov subspace algorithms: BiCGStab case, Infinite-precision inner product and sparse matrix-vector multiplication using Ozaki scheme with Dot2 on manycore processors, On the distribution of partial quotients of reduced fractions with fixed denominator, Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set}, Wireless 3-hop Networks with Stealing Revisited: A Kernel Approach, On some topological properties of numerical algorithms, Robust supervised learning with coordinate gradient descent, Rapid Mixing of \({\boldsymbol{k}}\)-Class Biased Permutations, Nonnegative Radix Representations for the Orthant 𝑅ⁿ₊, Unnamed Item, On the beta expansion for Salem numbers of degree 6, Edmonds polytopes and weakly hamiltonian graphs, A search for Wieferich and Wilson primes, Cryptography and cryptographic protocols, How can we solve a linear Diophantine equation by the basis reduction algorithm, Algorithms, STABILITY AND CHAOS IN REACTION SYSTEMS, An analysis of query-agnostic sampling for interactive data exploration, Elimination Techniques for Program Analysis, Digital Straightness, Factoring Polynomials Over Large Finite Fields, Extending DNA-Sticker Arithmetic to Arbitrary Size Using Staples, Inhomogeneous sorting, DE BRUIJN SEQUENCES REVISITED, Pattern‐avoiding permutations and Brownian excursion part I: Shapes and fluctuations, An application of the method of additive chains to inversion in finite fields, A chessboard model of the U‐boat war in the Atlantic with applications to signals intelligence, ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS, The number of steps in the Euclidean algorithm, Enumeration of compact self-avoiding walks, Immersed surfaces in the modular orbifold, A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function, Irreducibility testing over local fields, The impact of the bootstrap on statistical algorithms and theory, Lower triangular Toeplitz-Ramanujan systems whose solution yields the Bernoulli numbers, Transposition as a Permutation: A Tale of Group Actions and Modular Arithmetic, Multiparty generation of an RSA modulus, On Erdős–Ko–Rado for Random Hypergraphs II, The Generalized Nagell–Ljunggren Problem: Powers with Repetitive Representations, Representation of primes as the sums of two squares in the golden section quadratic field, Permutree sorting, Unnamed Item, Detecting square numbers, On the complexity of computation of a pair of monomials in two variables, A generalization of a microlocal version of Bochner’s theorem, Matching for random systems with an application to minimal weight expansions, Agreement probabilities for some CPIT—neyman smooth tests, Error distribution in randomly perturbed orbits, Comments on: Light tail asymptotics in multidimensional reflecting processes for queueing networks, LOCAL BIFURCATION OF CRITICAL PERIODS IN QUADRATIC-LIKE CUBIC SYSTEMS, A connection between time domain model order reduction and moment matching for LTI systems, Multiparty generation of an RSA modulus, SIMD Parallel Sparse Matrix-Vector and Transposed-Matrix-Vector Multiplication in DD Precision, Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems, Statistics of subgroups of the modular group, Analysis of some known methods of improving the accuracy of floating-point sums, A decomposition algorithm for shortest paths in a network with many strongly connected components, Kernel Method for Stationary Tails: From Discrete to Continuous, Multi-round Secure Light-Weight Broadcast Exclusion Protocol with Pre-processing, Balancing hydraulic turbine runners - A discrete combinatorial optimization problem, Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time, Factorization of polynomials over a finite field and the solution of systems of algebraic equations, Brownian motion and algorithm complexity, Solving systems of linear equations over polynomials, On the adequacy of pseudy-random number generators (or: How big a period do we need?), Distributions of floating point numbers, Network generation using the Prufer code, Edge-connectivity augmentation problems, On the choice of the pivot columns of the simplex-method: Gradient criteria, On the numerical condition of polynomials in Bernstein form, A simple proof of the validity of the reduced prs algorithm, Deviations from uniformity in random strings, The geometry of ill-conditioning, PASCAL functions for the generation of random numbers, The period of the Fibonacci random number generator, A batch acceptance complement method for generating random variables, On the computational complexity of the Abelian permutation group structure, membership and intersection problems, Ergodic properties of computer orbits for simple piecewise monotonic transformations, Vandermonde and Wronskian matrices over division rings, Rapid parallel computation of degrees in a quotient ring of polynomials over a finite field, A select and insert sorting algorithm, Why computers like Lebesgue measure, Implementation of a random number generator in OCCAM, Inferring sequences produced by a linear congruential generator missing low-order bits, Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions), Weighted flow time bounds for scheduling identical processors, Algorithm 40. An algorithm for the integral homology of certain topological groups, Sampling from binomial and Poisson distributions: a method with bounded computation times, Probabilistic algorithm for testing primality, The fastest exact algorithms for the isolation of the real roots of a polynomial equation, Bounds on the ranks of some 3-tensors, Generating the maximum of independent identically distributed random variables, An implementation of Vincent's theorem, The simulation of random processes on digital computers with Chebyshev mixing transformations, A cryptographic system based on finite field transforms, The computer generation of Poisson random variables, The Monte Carlo method, Numerical simulations of a Van der Pol oscillator, Three digit accurate multiple normal probabilities, Iterative refinement for linear systems in variable-precision arithmetic, Some models of error in floating point multiplication, A very fast shift-register sequence random number generator, Harmonic analysis of a nilpotent group and function theory on Siegel domains of type II, The uniqueness of protein sequences: A Monte Carlo analysis, Speeding sort algorithms by special instructions, The bias of three pseudo-random shuffles, An effective structured approach to finding optimal partitions of networks, Exact solution of linear equations using p-adic expansions, Two reductions of graph isomorphism to problems on polynomials, The complexity of partial derivatives, Practic zero-knowledge proofs: Giving hints and using deficiencies, An isomorphism theorem between the 7-adic integers and a ring associated with a hexagonal lattice, On the Monte Carlo simulation of physical systems, Random access to a random number sequence, A theoretical basis for conditional probability analyses of neural discharge activity, Improved bounds for the expected behaviour of AVL trees, On the product of the largest roots of a polynomial, A review of Mathematica, An RSA based public-key cryptosystem for secure communication, Birthday paradox, coupon collectors, caching algorithms and self- organizing search, Theoretical computer science. Cumulative index, volumes 1-100 (1992), Adaptive remeshing for three-dimensional compressible flow computations, Direct methods for primary decomposition, Reasoning about programs, Formalization and implementation of floating-point arithmetics, Fast modular transforms, Round-off error in products, F-expansions of rationals, Effect of data representation on cost of sparse matrix operations, Computational aspects of deciding if all roots of a polynomial lie within the unit circle, A method for calculating the reciprocal coefficients of function matrices, The analysis of Quicksort programs, Three steps towards robust regression, An introduction to the set theoretical language SETL, An algorithm for finding all shortest paths using \(N^{2\cdot 81}\) infinite-precision multiplications, Continuous replicative functions, Strong duality for a special class of integer programs, Resolution of ambiguity in parsing, Addition chains and solutions of \(\ell(2n)=\ell(n)\) and \(\ell(2^n-1)= n+\ell(n)-1\), Riemann's hypothesis and tests for primality, Parameter estimation in a biological two compartment model - a computer experimental study of the influence of the initial estimate in the parameter space of the model representation, On the analysis of algorithms for trees, Effect of guard digits and normalization options on floating point multiplication, Complexity measures and hierarchies for the evaluation of integers and polynomials, Pseudo-random numbers and optimal coefficients, Evaluation of Porter's constant, A generalization of Berwick's unit algorithm, Uniformity of congruential pseudorandom number generators. Dependence on length of number sequence and resolution, The squeeze method for generating gamma variates, Optimal simulation lengths for various algorithms computing the mean, A local approach to matrix equivalence, On the algebraic structure of rooted trees, Self-stabilization (in spite of distributed control) in tree-structured systems, Rational search, Associative retrieval trie hash-coding, The clean termination of Pascal programs, Generation de nombres aléatoires correles, Ricerca random pesata in tavole hash, Three efficient algorithms for counting problems, Singular Separatrix Splitting and the Melnikov Method: An Experimental Study, An efficient algorithm for computing real powers of a matrix and a related matrix function, Unnamed Item, An Improved Multivariate Polynomial Factoring Algorithm, Shake-and-bake algorithms for the identification of nonredundant linear inequalities, Computing the reciprocal of units in Galois rings, A geometrical characterization of regions of uniqueness and applications to discrete tomography, Approximation of excessive backlog probabilities of two tandem queues, A Method for Solving Initial Value Problems for Linear Differential Equations in Hilbert Space Based on The Cayley Transform, Unnamed Item, Unnamed Item, On the Asymptotic Logarithmic Distribution of the Floating-Point Mantissas of Sums, Une méthodologie du calcul hardware des fonctions élémentaires, Factorisation sur $\mathbb {Z}[X$ des polynômes de degré élevé à l’aide d’un monomorphisme], On the algebraic Properties of Stochastic Arithmetic. Comparison to Interval Arithmetic, Exact tail asymptotics for a two-stage queue: Complete solution via kernel method, On Multiplicative Independent Bases for Canonical Number Systems in Cyclotomic Number Fields, A fast algorithm to generate Beckett-Gray codes, A sequential estimation procedure for m-dimensional gaussian processes with independent inerements, The unified data structure capability in Madcap VI, Census algorithms for chinese remainder pseudorank, An algebraic approach to data organization, A graph-theoretic approach to the method of global Lyapunov functions, Reversion of power series and the extended Raney coefficients, A composite approach to generating autocorrelated sequences, Roundoff errors in floating-point summation, Exact and asymptotic distributions in digital and binary search trees, Fast matrix multiplication and its algebraic neighbourhood, Towards accurate statistical estimation of rounding errors in floating-point computations, Zusammengesetzte Verfahren zur Erzeugung von Poisson- und binomialverteilten Zufallszahlen, A monte carlo method for factorization, Finding successive minima of an integral lattice and a vector lattice, close to a given one, A note on generating binary trees inA-order andB-order, SEMIDIRECT PRODUCTS IN ALGEBRAIC LOGIC AND SOLUTIONS OF THE QUANTUM YANG–BAXTER EQUATION, Multidimensional linear congruential graphs, Factoring Multivariate Polynomials over Algebraic Number Fields, Implementation of fortran random number generators on computers with one's complement arithmetic †, Simulating stable stochastic systems, V: Comparison of ratio estimators, The algorithms of Euclid and Jacobi†, Asymptotic prime-power divisibility of binomial, generalized binomial, and multinomial coefficients, Euclid-type algorithm and its applications, COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS, A Hierarchical Representation of the Inverse for Sparse Matrices, Weak radix representation and cyclic codes over euclidean domains, Speedup of linear stationary iteration processes in multiprocessor computers. I, Multiprecision integer division examples using arbitrary radix, Implementation independent arithmetic: Speculation for discussion, On not storing the path of a random walk, Some remarks concerning the M.I.T. public-key cryptosystem, The complexity of monotone boolean functions, Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem, Binary Pseudo-Random Sequences Theory, Speeding Up the Pollard Rho Method on Prime Fields, An algebra for determining all path-values in a network with application to K-shortest-paths problems, Multidimensional greatest common divisor and Lehmer algorithms, A note on the concept of multiset, Monte carlo estimates of the distributions of the random polygons of the voronoi tessellation with respect to a poisson process, Fast procedures for generating stationary normal vectors, Robust estimation of standard deviation, The robustness of the two—samplet—test over the Pearson system, Analysis of non-deterministic drum scheduling, A power study ofk-linear-r-ahead recursive residuals test for change-point in finite sequences, An improved Monte Carlo factorization algorithm, An efficient approximate algorithm for the Kolmogorov—Smirnov and Lilliefors tests†, Implementation of the direct representation for the maximum likelihood estimator of a gaussian moving average process, Testing the NIST Statistical Test Suite on artificial pseudorandom sequences, A note on solving linear Diophantine systems by usingL3-reduction algorithm, An algorithm for the inference of tree grammars, Analysis of some abstract measures of protection in computer systems, On cullen numbers, On Negative Bases, Low-Order Approximations for the Normal Probability Integral and the Error Function, On the Expectations of Multiple Stratonovich Integrals, An analysis of the effect of rounding errors on the flow of control in numerical processes, Factoring Multivariate Polynomials Over the Integers, Goodness-of-fit tests for the two parameter Weibull distribution, Algebraic specification of data types: A synthetic approach, Fast exponentiation by folding the signed-digit exponent in half, A New Approach to χ 2 Cryptanalysis of Block Ciphers, Unitary representations of wavelet groups and encoding of iterated function systems in solenoids, A cubic analogue of the RSA cryptosystem, Exact Enumerations, Unnamed Item, Multiply Schemes and Shuffling, Large primes and Fermat factors, A Random-Bit Generator for use in Simulating the Reliability of a Coherent System, Modular exponentiation via the explicit Chinese remainder theorem, A method of Mahler in transcendence theory and some of its applications, The number of primes is finite, Factorization of the tenth Fermat number, A class of hypothesis tests for one and two sample censored survival data, On finite approximations of topological algebraic systems, EVOLVING INDUCTIVE GENERALIZATION VIA GENETIC SELF-ASSEMBLY, Query costs in HB(1) trees versus 2?3 trees, Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction, A comparative study of algorithms for computing the Smith normal form of an integer matrix†, Generating a random permutation with random transpositions, On the Distribution of Pseudo-Random Numbers Generated by the Linear Congruential Method. III, The Minimum Root Separation of a Polynomial, Random polytopes: Their definition, generation and aggregate properties
Uses Software
