scientific article; zbMATH DE number 1052006

zbMath0895.65001MaRDI QIDQ4349924

Donald E. Knuth

Publication date: 26 August 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

surveyrandom number generatorsspectral teststatistical testsEuclidean algorithmfloating-point arithmeticexercisesformal power seriesrandom numbersmultiple-precision arithmeticpolynomial arithmeticcomputer programmingrandom arithmeticseminumerical algorithmslinear congruence relationsradix conversion

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Probabilistic methods, stochastic differential equations (65Cxx) Error analysis and interval analysis (65Gxx)

Related Items

Separating OR, SUM, and XOR circuits, An accurate updating formula to calculate sample variance from weighted successive differences, Faster algorithms for single machine scheduling with release dates and rejection, Improved error bounds for floating-point products and Horner's scheme, On the definition of unit roundoff, Maximum likelihood analysis of the Ford-Fulkerson method on special graphs, Batcher's odd-even exchange revisited: a generating functions approach, A fast algorithm for computing large Fibonacci numbers, Measurement of preferences with self-explicated approaches: a classification and merge of trade-off- and non-trade-off-based evaluation types, Fast projection onto the simplex and the \(l_1\) ball, On the linear complexity profile of some sequences derived from elliptic curves, Even faster integer multiplication, On the tree search problem with non-uniform costs, Perfect necklaces, Finding the best portable congruential random number generators, An obstruction to solvability of the reach control problem using affine feedback, On the hardness of bribery variants in voting with CP-nets, Genetic algorithms for condition-based maintenance optimization under uncertainty, Stowage planning for container ships: a heuristic algorithm to reduce the number of shifts, Minimum edge blocker dominating set problem, Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?, Scheduling with compressible and stochastic release dates, Integer complexity: representing numbers of bounded defect, Signed enumeration of upper-right corners in path shuffles, Sharp error bounds for complex floating-point inversion, Merging almost sorted sequences yields a 24-sorter, Reconstructing binary matrices with timetabling constraints, Improved algorithm for the isogeny problem for ordinary elliptic curves, Distribution results for low-weight binary representations for pairs of integers, Straight-line programs: a practical test (extended abstract), Controlled random tests, Complexity of computation in finite fields, Eulerian quasisymmetric functions, Running time of the treapsort algorithm, Fractal tiles associated with shift radix systems, Accurate evaluation of a polynomial and its derivative in Bernstein form, Fibonacci BSTs: a new balancing method for binary search trees, On compressing permutations and adaptive sorting, Optimality of the width-\(w\) non-adjacent form: general characterisation and the case of imaginary quadratic bases, Automorphism groups of finite groupoids., Computing a longest common subsequence that is almost increasing on sequences having no repeated elements, Scheduling modular projects on a bottleneck resource, Combinatorics of non-ambiguous trees, Combinatorics of balanced carries, Some new binomial sums related to the Catalan triangle, Evaluation of permanents in rings and semirings, Numeration and discrete dynamical systems, Eulerian quasisymmetric functions for the type B Coxeter group and other wreath product groups, Weighted Flow Algorithms (WFA) for stochastic particle coagulation, String matching with alphabet sampling, Parallel modular exponentiation using load balancing without precomputation, Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour, Notes on protected nodes in digital search trees, Pseudorandom number generators based on random covers for finite groups, Efficient computer search of large-order multiple recursive pseudo-random number generators, Development of a Stokes flow solver robust to large viscosity jumps using a Schur complement approach with mixed precision arithmetic, Keyed hash function based on a chaotic map, The strongest model of computation obeying 0-1 Principles, Decoding permutation arrays with ternary vectors, Distributed algorithmic mechanism design for scheduling on unrelated machines, On the expected longest length probe sequence for hashing with separate chaining, A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\), The enumeration of prudent polygons by area and its unusual asymptotics, Average best \(m\)-term approximation, Recursive merge sort with erroneous comparisons, Accurate evaluation algorithm for bivariate polynomial in Bernstein-Bézier form, High-precision computation: mathematical physics and dynamics, Chains-into-bins processes, Sum-based weighted belief base merging: from commensurable to incommensurable framework, Computing the throughput of probabilistic and replicated streaming applications, Quantifier elimination for a class of exponential polynomial formulas, On the parameterized complexity of vertex cover and edge cover with connectivity constraints, A low-memory algorithm for finding short product representations in finite groups., Practical algorithms for generating a random ordering of the elements of a weighted set, Accurate, validated and fast evaluation of elementary symmetric functions and its application, Applications of an expressive statistical model checking approach to the analysis of genetic circuits, Tighter bounds for the sum of irreducible LCP values, Shortcutting directed and undirected networks with a degree constraint, The \(p\lambda n\) fractal decomposition: nontrivial partitions of conserved physical quantities, 2D Lyndon words and applications, Engineering parallel string sorting, Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems, Bitonic sorters of minimal depth, Isomorphism check in fractional factorial designs via letter interaction pattern matrix, Consistency of Markov chain quasi-Monte Carlo on continuous state spaces, The expected profile of digital search trees, Authenticated key agreement in dynamic peer groups, Relations between adjacency trees, A tight analysis and near-optimal instances of the algorithm of Anderson and Woll, Accurate evaluation of a polynomial in Chebyshev form, On chaotic and random sequences, Minimal redundant digit expansions in the Gaussian integers, About randomised distributed graph colouring and graph partition algorithms, Preserving positivity in solutions of discretised stochastic differential equations, Asymptotic distribution of two-protected nodes in random binary search trees, Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic, Accelerated simulation of stochastic particle removal processes in particle-resolved aerosol models, A simple measure of conditional dependence, The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio, Low-cost addition-subtraction sequences for the final exponentiation in pairings, Dynamic Path-decomposed Tries, Automatic sequences in negative bases and proofs of some conjectures of shevelev, Cryptographic properties of the quantum hashing based on expander graphs, Floating-point arithmetic, Node profiles of symmetric digital search trees: Concentration properties, Sorting balls and water: equivalence and computational complexity, Field choice problem in persistent homology, Algebraic number fields and the LLL algorithm, Sparse random feature maps for the item-multiset kernel, On the probability that a random subtree is spanning, A More Malicious Maitre d’, Algorithms for a risk-averse Stackelberg game with multiple adversaries, A simple proof of Gevrey estimates for expansions of quasi-periodic orbits: dissipative models and lower-dimensional tori, Compaction for two models of logarithmic‐depth trees: Analysis and experiments, Haystack hunting hints and locker room communication, Tropical Monte Carlo quadrature for Feynman integrals, An asynchronous variational integrator for the phase field approach to dynamic fracture, Computers as a novel mathematical reality. I: A personal account, Philippe Flajolet's early work in combinatorics, A grammatical calculus for peaks and runs of permutations, \((M,i)\)-multiset Eulerian polynomials, Parking functions, multi-shuffle, and asymptotic phenomena, Parallel-batch scheduling with rejection: structural properties and approximation algorithms, On the expected cost of partial match queries in random quad-\(K\)-d trees, An ultrafast cryptographically secure pseudorandom number generator, Numerical stability and tensor nuclear norm, An Efficient Algorithm for Integer Lattice Reduction, FAST: secure and high performance format-preserving encryption and tokenization, Four Canadian Contributions to Stochastic Modeling, Small Complexity Gaps for Comparison-Based Sorting, A Pandemic Three-Sided Coin, A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness, Classification via two-way comparisons (extended abstract), Sign balances and promotion order of Young-Fibonacci tableaux, A Fibonacci analogue of the two’s complement numeration system, Permutations with few inversions, The symmetric decreasing rearrangement via the bubble sort, Finding Antimagic Labelings of Trees by Evolutionary Search, Supernode Binary Search Trees, DOUBLE HASHING WITH MULTIPLE PASSBITS, Descending chains, the lilypond model, and mutual-nearest-neighbour matching, SOLVING DYNAMIC WILDLIFE RESOURCE OPTIMIZATION PROBLEMS USING REINFORCEMENT LEARNING, INCREMENTAL EVOLUTION OF CELLULAR AUTOMATA FOR RANDOM NUMBER GENERATION, Efficient non-malleable commitment schemes, \((1+i)\)-ary GCD computation in \(\mathbb Z[i\) as an analogue to the binary GCD algorithm.], Topological properties of two-dimensional number systems, Efficient non-malleable commitment schemes, Normal Numbers and Pseudorandom Generators, Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy, On canonical number systems, Verified analysis of random binary tree structures, 64-bit and 128-bit DX random number generators, Exact sublinear binomial sampling, Reasoning Algebraically About P-Solvable Loops, Point lattices and oscillating recurrence sequences^†, Upper tail analysis of bucket sort and random tries, Fast Computation by Block Permanents of Cumulative Distribution Functions of Order Statistics from Several Populations, Asymptotic Analysis of Some Discrete Distributions by the Saddle Point Method, A fast algorithm for reversion of power series, Gevrey estimates for asymptotic expansions of Tori in weakly dissipative systems*, Asymptotics of the overflow in urn models, A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem, Accelerating certain outputs of merging and sorting networks, On the mean-field limit of bosons with Coulomb two-body interaction, The Ford-Johnson algorithm still unbeaten for less than 47 elements, Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques, Reconciling the term structure of interest rates with the consumption-based ICAP model, Bounds for resultants of univariate and bivariate polynomials, Algorithms for accurate, validated and fast polynomial evaluation, Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees, On robustness in control and LTI identification: near-linearity and non-conic uncertainty, LTI approximation of nonlinear systems via signal distribution theory, Simulation of stochastic demand data streams for network revenue management problems, Parameterization method for unstable manifolds of delay differential equations, Tuples of polynomials over finite fields with pairwise coprimality conditions, The combination technique and some generalisations, Permutations with short monotone subsequences, Permutation and sampling with maximum length CA or pseudorandom number generation, An efficient variable neighborhood search heuristic for very large scale vehicle routing problems, Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods, Consolidation for compact constraints and Kendall tau LP decodable permutation codes, Relaxations of associativity and preassociativity for variadic functions, The number of steps in the Robinson-Schensted algorithm, The principles of informational genomics, Computing mixed volume and all mixed cells in quermassintegral time, Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency, On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic, Carry propagation in signed digit representations, An improvement of a cryptanalysis algorithm, On the variety of shapes in digital trees, Approximate testing with error relative to input size., Dynamical analysis of a class of Euclidean algorithms., Nearly optimal refinement of real roots of a univariate polynomial, Probabilistic analyses of the plain multiple gcd algorithm, Statistical properties and implementation of aperiodic pseudorandom number generators, Exponential decay of correlations functions in MIXMAX generator of pseudorandom numbers, Self-affine manifolds, Computation of maximal local (un)stable manifold patches by the parameterization method, Kazhdan-Lusztig cells and Robinson-Schensted correspondence., Random small Hamming weight products with applications to cryptography, Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees, A survey of some applications of finite fields, A rigorous version of R. P. Brent's model for the binary Euclidean algorithm, Internal structure of addition chains: well-ordering, Fast structured matrix computations: tensor rank and Cohn-Umans method, On the complexity and decidability of some problems involving shuffle, Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences, Combinatorics of periods in strings., Parallel Fokker-Planck-DSMC algorithm for rarefied gas flow simulation in complex domains at all Knudsen numbers, Process convergence for the complexity of radix selection on Markov sources, A modular reduction for GCD computation., Trees with exponentially growing costs, The additive congruential random number generator -- a special case of a multiple recursive generator, A random number generator based on elliptic curve operations, Extensions of Black-Scholes processes and Benford's law, Accurate quotient-difference algorithm: error analysis, improvements and applications, Estimating steady-state distributions via simulation-generated histograms, Sampling random directions within an elliptical cone, On Las Vegas approximations for metric 1-median selection, M-CASH: A real-time resource reclaiming algorithm for multiprocessor platforms, On computational efficiency for multi-precision zero-finding methods, Recursive polynomial remainder sequence and its subresultants, A semidefinite programming method for integer convex quadratic minimization, Evaluation of circuits over nilpotent and polycyclic groups, Improved random graph isomorphism, An error in the Kinderman-Ramage method and how to fix it, Invariants for parameterised Boolean equation systems, LRM-trees: compressed indices, adaptive sorting, and compressed permutations, Distributional analysis of swaps in quick select, Quasi-Monte Carlo methods with applications in finance, Obtainable sizes of topologies on finite sets, The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications, A parametric error analysis of Goldschmidt's division algorithm, Singularity analysis, Hadamard products, and tree recurrences, Deletions in random binary search trees: a story of errors, Monte Carlo linear solvers with non-diagonal splitting, Width and mode of the profile for some random trees of logarithmic height, Comparing the effectiveness of two kinds of continued fractions, Inversive pseudorandom numbers over Galois rings, Space complexity of abelian groups, Discrete event simulation modelling of computer systems for performance evaluation, Linear-size log-depth negation-limited inverter for \(k\)-tonic binary sequences, Optimal conclusive sets for comparator networks, Cryptographic properties of nonlinear pseudorandom number generators, Algorithmic aspects for power-efficient hardware/software partitioning, Noncanonical number systems in the integers, The generating function for total displacement, A new constrained edit distance between quotiented ordered trees, Optimal learning with a local parametric belief model, A parallel extended GCD algorithm, Limit laws for the Randić index of random binary tree models, Sampling streaming data with replacement, Imbalance in random digital trees, Renewal theory in the analysis of tries and strings, Intervals of balanced binary trees in the Tamari lattice, Subtraction-free almost Montgomery inverse algorithm, Truncation of unitary operads, Upper bounds for sorting integers on random access machines, Basic analytic combinatorics of directed lattice paths, Approximate \(k\)-closest-pairs in large high-dimensional data sets, Fractal-like matrices, Pseudorandom permutation, Random walks on finite nilpotent groups driven by long-jump measures, \textit{AlCons}: deductive synthesis of sorting algorithms in \textit{Theorema}, Combined generators with components from different families, One-sided variations on binary search trees, On similarity, Gray codes for Fibonacci \(q\)-decreasing words, Space-efficient B trees via load-balancing, SPEck: mining statistically-significant sequential patterns efficiently with exact sampling, Robust optimization for premarshalling with uncertain priority classes, RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems, On the average complexity for the verification of compatible sequences, On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation, The dual optimizer for the growth-optimal portfolio under transaction costs, Randomness of the square root of 2 and the giant leap. II, Block-regularized repeated learning-testing for estimating generalization error, Certain sequence of arithmetic progressions and a new key sharing method, Combinatorial encoding of Bernoulli schemes and the asymptotic behavior of Young tableaux, Construction of weakly CUD sequences for MCMC sampling, Extensions of smoothing via taut strings, Analysis of the expected number of bit comparisons required by quickselect, Revisiting priority queues for image analysis, Multilevel static analysis for improving program quality, Divisibility properties of random samples of integers, Random numbers for parallel computers: requirements and methods, with emphasis on gpus, New width parameters for SAT and \#SAT, A verified implementation of the Berlekamp-Zassenhaus factorization algorithm, Synthesis of sorting algorithms using multisets in \textit{Theorema}, Improving the statistical quality of random number generators by applying a simple ratio transformation, Colored operads, series on colored operads, and combinatorial generating systems, Permanental bounds for nonnegative matrices via decomposition, Encoding cardinality constraints using multiway merge selection networks, A simple counting argument of the irreducible representations of \(\mathsf{SU}(N)\) on mixed product spaces, Euclidean algorithms are Gaussian, Algorithms for propositional model counting, A heuristic approach for the generation of multivariate random samples with specified marginal distributions and correlation matrix, Polynomial pseudo-random number generator via cyclic phase, Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants, Lempel-Ziv compressed structures for document retrieval, Precise numerical computation, Analytic urns, A greedy algorithm for the two-level nested logit model, Performance-based routing, An asymptotic distribution theory for Eulerian recurrences with applications, Mechanisation of the AKS algorithm, Linear extensions and comparable pairs in partial orders, Prime and coprime values of polynomials, Fast switch and spline scheme for accurate inversion of nonlinear functions: the new first choice solution to Kepler's equation, Metric dimension of critical Galton-Watson trees and linear preferential attachment trees, Saturation problems in the Ramsey theory of graphs, posets and point sets, The normalized matching property in random and pseudorandom bipartite graphs, Stack-sorting with consecutive-pattern-avoiding stacks, Generalized multiset theory, Weakly increasing trees on a multiset, Efficient calculation of the joint distribution of order statistics, QuickXsort: a fast sorting scheme in theory and practice, The relative accuracy of \(\mathtt{(x+y)*(x-y)}\), Lightweight merging of compressed indices based on BWT variants, An upper bound for the size of \(s\)-distance sets in real algebraic sets, Computing the depth distribution of a set of boxes, On the cost of unsuccessful searches in search trees with two-way comparisons, Factorization patterns on nonlinear families of univariate polynomials over a finite field, Domain decomposition for entropy regularized optimal transport, A novel image encryption scheme based on improved random number generator and its implementation, On the probability of overlap of random subsequences of pseudorandom number generators, Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey, Generating random binary trees -- a survey, Reduced complexity evaluation of hypergeometric functions, A selectable sloppy heap, Measuring tree balance using symmetry nodes -- a new balance index and its extremal properties, Online multivariate changepoint detection with type I error control and constant time/memory updates per series, A simple proof for the upper bound of the computational complexity of three monomials in three variables, Enumerating regular expressions and their languages, When lagged Fibonacci generators jump, Entropy conservation for comparison-based algorithms, Range minimum queries in minimal space, Statistical approach for highest precision numerical differentiation, Antithetic and Monte Carlo kernel estimators for partial rankings, A generalization of Arrow's lemma on extending a binary relation, Leibniz complexity of Nash functions on differentiations, On geometrically defined extensions of the Temperley-Lieb category in the Brauer category, Uncertainty in epidemic models based on a three-sided coin, On Huang and Wong's algorithm for generalized binary split trees, An accurate algorithm for evaluating rational functions, Accurate evaluation of polynomials in Legendre basis, A goodness-of-fit test for copulas based on the collision test, On fairness in polling systems, Limit theorems for patterns in phylogenetic trees, Portable random number generators., The height of a binary search tree: the limiting distribution perspective., Additive symmetries: The non-negative case., \textsf{ORTHOPOLY}: a library for accurate evaluation of series of classical orthogonal polynomials and their derivatives, Distinct fringe subtrees in random trees, Hopf algebra structure on packed square matrices., Counting inversions adaptively, Uniform point sets and the collision test, Fast distance multiplication of unit-Monge matrices, Multiset neurons, Quantum algorithm for learning secret strings and its experimental demonstration, High-precision arithmetic in mathematical physics, The vortex filament equation as a pseudorandom generator, Probabilizing parking functions, Maximum versus minimum: two properties of the Fibonacci sequence, The cell probe complexity of succinct data structures, On the reducible quintic complete base polynomials, Real algebraic numbers and polynomial systems of small degree, Efficient implementation of algorithms for approximate exponentiation, Analyzing the Shuffling Side-Channel Countermeasure for Lattice-Based Signatures, On \(\alpha \)-greedy expansions of numbers, A Recursive Local Polynomial Approximation Method Using Dirichlet Clouds and Radial Basis Functions, TOPICS IN DIVISIBILITY: PAIRWISE COPRIMALITY, THE GCD OF SHIFTED SETS AND POLYNOMIAL IRREDUCIBILITY, Digital semigroups, Improved algorithm for maximizing service of carousel storage, The topological structure of fractal tilings generated by quadratic number systems, Polynomial evaluation and interpolation on special sets of points, A survey on topological properties of tiles related to number systems, Cryptanalysis of Multiplicative Coupled Cryptosystems Based on the Chebyshev Polynomials, Bases of canonical number systems in quartic algebraic number fields, Single-factor coefficient bounds, On the theoretical properties of swap multimoves, Limit shapes for random square Young tableaux, Approximate hotlink assignment, Digit systems over commutative rings, Parallel stochastic gradient algorithms for large-scale matrix completion, A note on the largest number of red nodes in red-black trees, Cryptographic pseudo-random sequences from the chaotic Hénon map, Parallel machine scheduling with restricted job rejection, Unnamed Item, Descriptive complexity of deterministic polylogarithmic time and space, The Brun gcd algorithm in high dimensions is almost always subtractive, Characterization algorithms for shift radix systems with finiteness property, Computing similarity distances between rankings, Spectrum and entropy of C-systems MIXMAX random number generator, Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process, Hall sets, Lazard sets and comma-free codes, Error estimates for the summation of real numbers with application to floating-point summation, A fast algorithm for quadratic resource allocation problems with nested constraints, On-line CAD Reconstruction with Accumulated Means of Local Geometric Properties, Masking Tables—An Underestimated Security Risk, On a compensated Ehrlich-Aberth method for the accurate computation of all polynomial roots, On the correctness of a lock-free compression-based elastic mechanism for a hash trie design, Continuous-time digital search tree and a border aggregation model, A study on splay trees, Regenerative random permutations of integers, Solving projected model counting by utilizing treewidth and its limits, Mixing time for Markov chain on linear extensions, Counting linear extensions of posets with determinants of hook lengths, Succinct permutation graphs, Maximally even sets and configurations: common threads in mathematics, physics, and music, Novel Lagrange interpolation polynomials for dynamic access control in a healthcare cloud system, The quicksort process, Some issues related to double rounding, The asymptotics of the geometric polynomials, Algorithms and algebraic solutions of decay chain differential equations for stable and unstable nuclide fractionation, An analytic approach to the asymptotic variance of trie statistics and related structures, Numerical integration of high-order variational equations of ODEs, Hausdorff dimensions of perturbations of a conformal iterated function system via thermodynamic formalism, Internal differential collision attacks on the reduced-round Grøstl-0 hash function, Skew spectra of graphs without even cycles, An intuitive and simple bounding argument for Quicksort, Fast monotone summation over disjoint sets, Numerical experiments in problems of asymptotic representation theory.., Lower bounds for expected-case planar point location, LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations, Invitation to Algorithmic Uses of Inclusion–Exclusion, On the complexity of real root isolation using continued fractions, Concrete stream calculus: An extended study, Unnamed Item, A STUDY ON THE RANDOMNESS OF THE DIGITS OF π, Adaptive sorting: an information theoretic perspective, A note on a pseudo-random number generator for personal computers, Analysis of alternative digit sets for nonadjacent representations, The \textsc{Meat}-\textsc{axe} and \(f\)-cyclic matrices, On the coefficients that arise from Laplace's method, Probability of Repeating Patterns in Simultaneous Neural Data, Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach, Exact, efficient, and complete arrangement computation for cubic curves, Descent polynomials for \(k\) bubble-sortable permutations of type B, SELF-SYNCHRONIZING STREAM CIPHERS AND DYNAMICAL SYSTEMS: STATE OF THE ART AND OPEN ISSUES, Monte Carlo and Las Vegas randomized algorithms for systems and control. An introduction, Type Fusion, Backward error analysis of the extended iterative refinement or improvement algorithm for solving ill conditioned linear system, An improved computational algorithm for finding the factorial, Large-Order Multiple Recursive Generators with Modulus 2³¹ − 1, Computing Minimal Polynomials of Matrices, Classification of Finite Group Automorphisms with a Large Cycle, Efficient Calculations of Faithfully Rounded l ₂ -Norms of n -Vectors, Sampling Exactly from the Normal Distribution, The Hubness Phenomenon: Fact or Artifact?, Fast quantum modular exponentiation, The Mixed Binary Euclid Algorithm, CHI-SQUARE SIMULATION OF THE CIR PROCESS AND THE HESTON MODEL, BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION, Continued fractions for linear fractional transformations of power series, The k -ary Montgomery modular inverse over nonbinary computers, Line segment intersection testing, Approximability issues of guarding a set of segments, \(s\)-power series: an alternative to Poisson expansions for representing analytic functions, The general two-level storage management problem: a reconsideration of the KTNS-rule, There is no efficient reverse derivation mode for discrete derivatives, Quantum mechanics and the principle of least radix economy, Rationality Problem for Algebraic Tori, Morphisms and Minimisation of Weighted Automata, On dense intermingling of exact overlaps and the open set condition, Directed column-convex polyominoes by recurrence relations, Second-level randomness test based on the Kolmogorov-Smirnov test, Two compact incremental prime sieves, Select with Groups of 3 or 4, LAYERED CELLULAR AUTOMATA FOR PSEUDORANDOM NUMBER GENERATION, Pop-stack-sorting for Coxeter groups, Upper Bounds on Mixing Time of Finite Markov Chains, Unnamed Item, Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems, Algorithms for SU(n) boson realizations and D-functions, On the period mod $m$ of polynomially-recursive sequences: a case study, Infimaximal Frames: A Technique for Making Lines Look Like Segments, A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES, An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop, Unnamed Item, Finding the roots of a non-linear equation: history and reliability, Left cells in type 𝐵_{𝑛} with unequal parameters, Inversions in split trees and conditional Galton--Watson trees, HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank, A Number System with Base −32, Unnamed Item, Least resolved trees for two-colored best match graphs, The vectorial kernel method for walks with longer steps, Optimal Dislocation with Persistent Errors in Subquadratic Time, Algorithms for Propositional Model Counting, Reverse-Safe Text Indexing, Engineering Practical Lempel-Ziv Tries, Unnamed Item, Generating Functions and the Solutions of Full History Recurrence Equations, Fast Point Decompression for Standard Elliptic Curves, An optimal, purely functional implementation of the Garsia–Wachs algorithm, Unnamed Item, On relative errors of floating-point operations: Optimal bounds and applications, Formulae and Asymptotics for Coefficients of Algebraic Functions, Efficient data structures for sparse network representation, A representation on the labeled rooted forests, The dynamics of Pythagorean Triples, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES, Computing Storyline Visualizations with Few Block Crossings, Parberry’s pairwise sorting network revealed, Universal quantum computation by scattering in the Fermi–Hubbard model, Spectral Analysis of the MIXMAX Random Number Generators, BlockQuicksort, QPlus: computer package for coding theory research and education, Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries, IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION, THE CLASS OF BALANCED ALGEBRAIC THRESHOLD FUNCTIONS, A Duality of Sorts, Citius altius fortius, Proved Random Numbers Obtained from Hardware Devices, Priority Queues and Sorting for Read-Only Data, Unnamed Item, ASMs and Operational Algorithmic Completeness of Lambda Calculus, A LOCAL LIMIT THEOREM FOR CONTINUED FRACTIONS, Unnamed Item, Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation, Unnamed Item, Dependence between path-length and size in random digital trees, Individual Displacements in Hashing with Coalesced Chains, Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic, Speeding up the computations on an elliptic curve using addition-subtraction chains, Unnamed Item, Reynolds stress transport modelling for steady and unsteady channel flows with wall injection, ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH, Unnamed Item, A Parametric Stochastic Model of Bone Geometry, Chronological rank in biological evolution, Quotients of the Magmatic Operad: Lattice Structures and Convergent Rewrite Systems, GEOMETRIC RANDOM INNER PRODUCT TEST AND RANDOMNESS OF π, Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths, Asymmetric Rényi Problem, Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions, The sets of flattened partitions with forbidden patterns, Selected Implementation Issues in Computation of the Grünwald-Letnikov Fractional-Order Difference by Means of Embedded System, ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS, On the Value of Multiple Read/Write Streams for Data Compression, Unnamed Item, Error Analysis of ZFP Compression for Floating-Point Data, Exact Solution of Sparse Linear Systems via Left-Looking Roundoff-Error-Free LU Factorization in Time Proportional to Arithmetic Work, Randomness measures related to subset occurrence, Short addition sequences for theta functions, The threshold for the square of a Hamilton cycle, Differentiability of the Minkowski function . II, Dedekind sums, reciprocity, and non-arithmetic groups, Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs, DYNAMICAL CHARACTERISTICS OF DISCRETIZED CHAOTIC PERMUTATIONS, Unnamed Item, Unnamed Item, ALGORITHMS FOR K-DISJOINT MAXIMUM SUBARRAYS, Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema, Generating stochastic trajectories with global dynamical constraints, Enhanced Digital Signature Using RNS Digit Exponent Representation, MaD0, Static Network Reliability Estimation under the Marshall-Olkin Copula, A Radix-Independent Error Analysis of the Cornea-Harrison-Tang Method, Algorithm 960