scientific article; zbMATH DE number 1178976
From MaRDI portal
Publication:4398780
zbMath0895.68055MaRDI QIDQ4398780
Publication date: 26 July 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10) General topics in the theory of software (68N01) Theory of software (68N99)
Related Items
Chaos Game Representation, Exact solution of weighted partially directed walks crossing a square, The explorer-director game on graphs, Unimodality of a refinement of Lassalle's sequence, Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties, Evaluations of the areal Mahler measure of multivariable polynomials, On the correlations of \(n^\alpha \bmod 1\), Exact-Size Sampling of Enriched Trees in Linear Time, Ramanujan's approximation to the exponential function and generalizations, Accurate computations up to breakdown of quasi-periodic attractors in the dissipative spin-orbit problem, Computer assisted proof of homoclinic chaos in the spatial equilateral restricted four-body problem, The component structure of dense random subgraphs of the hypercube, Sequential model-based diagnosis by systematic search, Computers as a novel mathematical reality. I: A personal account, The splay-list: a distribution-adaptive concurrent skip-list, Pattern avoidance and dominating compositions, Model structures on finite total orders, Stirling complexes, An iterated greedy algorithm for finding the minimum dominating set in graphs, Parabolic Tamari lattices in linear type \(B\), On 0012-avoiding inversion sequences and a conjecture of Lin and Ma, Complexity and approximation for discriminating and identifying code problems in geometric setups, Generating weakly chordal graphs from arbitrary graphs, F things you (probably) didn't know about hexadecimal, Deterministic factoring with oracles, EuMMD: efficiently computing the MMD two-sample test statistic for univariate data, Row–column duality and combinatorial topological strings, Self-avoiding walks of specified lengths on rectangular grid graphs, Balanced allocation on hypergraphs, On an identity of Sylvester, A new simplified analytical solution to solve the neutron point kinetics equations using the Laplace transform method, \textsc{Rings}: an efficient Java/Scala library for polynomial rings, Characterizing planar tanglegram layouts and applications to edge insertion problems, Scalable Gromov-Wasserstein based comparison of biological time series, Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions, Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing, Improving \(3N\) circuit complexity lower bounds, A Fibonacci analogue of the two’s complement numeration system, Enumeration of rational contact curves via torus actions, From Abel’s Binomial Theorem to Cayley’s Tree Formula, Rainbow powers of a Hamilton cycle in Gn,p, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Lagrange inversion, Balanced allocation on dynamic hypergraphs, On the spanning trees of weighted graphs, Properties of phylogenetic trees generated by Yule-type speciation models, On the performance of birthday spacings tests with certain families of random number generators, Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems, Fast differential eleminination in C: The CDiffElim environment, Unbounded growth of sequences in vector lattices, Deterministic Graphical Games Revisited, Heuristic algorithm for obtaining permutations with given cryptographic properties using a generalized construction, Taylor series method for solving a class of nonlinear singular boundary value problems arising in applied science, Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem, DKL: an efficient algorithm for learning deterministic Kripke structures, On the dynamics of a class of multi-group models for vector-borne diseases, Operads from posets and Koszul duality, Pluriassociative algebras. I: The pluriassociative operad., Binary determinantal complexity, Strictly in-place algorithms for permuting and inverting permutations, Maximum likelihood analysis of the Ford-Fulkerson method on special graphs, High-order adaptive finite-volume schemes in the context of multiresolution analysis for dyadic grids, Order-preserving indexing, Proof pearl: Mechanizing the textbook proof of Huffman's algorithm, Multiple serial episodes matching, The method and criterion for quality assessment of random number sequences, New method in information processing for maintaining an efficient dynamic ordered set, Measurement of areas on a sphere using Fibonacci and latitude-longitude lattices, Quantum mechanical algorithm for solving quadratic residue equation, Modeling synergies in multi-criteria supplier selection and order allocation: an application to commodity trading, Semantics of roundoff error propagation in finite precision calculations, Trivariate Bernoulli distribution with application to software fault tolerance, On the use of ANOVA expansions in reduced basis methods for parametric partial differential equations, Random numbers from a delay equation, Towards estimating expected sizes of probabilistic skylines, The origins of combinatorics on words, Limit theorems for triangular urn schemes, An analysis of linear congruential random number generators when multiplier restrictions exist, A new class of Zernike moments for computer vision applications, A performance analysis of channel fragmentation in dynamic spectrum access systems, The two-way rewriting in action: removing the mystery of Euler-Glaisher's map, MPOC: an agglomerative algorithm for multicriteria partially ordered clustering, About statistics of periods of continued fractions of quadratic irrationalities, Asymptotics and random sampling for BCI and BCK lambda terms, Constant-competitive tree node assignment, A new simulation code for particle diffusion in anisotropic, large-scale and turbulent magnetic fields, A survey on tree matching and XML retrieval, Wilf-classification of mesh patterns of short length, The sum of a finite group of weights of a Hopf algebra., Mean deep coalescence cost under exchangeable probability distributions, Essentially non-oscillatory adaptive tree methods, Estimating the smoothness of a Gaussian random field from irregularly spaced data via higher-order quadratic variations, Refined enumeration of permutations sorted with two stacks and a \(D_8\)-symmetry, The three-loop splitting functions in QCD: the helicity-dependent case, Leading digit laws on linear Lie groups, On Euclid's algorithm and elementary number theory, Performance potential for simulating spin models on GPU, Invariant diagrams with data refinement, An adaptive multiresolution method on dyadic grids: Application to transport equations, The cost of cache-oblivious searching, Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers, Sequential solution to Kepler's equation, Cooperative private searching in clouds, The saga of minimum spanning trees, Distribution of the sum-of-digits function of random integers: a survey, Tests of randomness by the gambler's ruin algorithm, DNA-inspired information concealing: a survey, A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions, Two dimensional aggregation procedure: An alternative to the matrix algebraic algorithm, Combining rare events techniques: phase change in \(\mathrm{Si}\) nanoparticles, Left and right length of paths in binary trees or on a question of Knuth, A binary algorithm with low divergence for modular inversion on SIMD architectures, On Alexander-Conway polynomials of two-bridge links, Memoryless near-collisions via coding theory, Analysis of the strategy ``hiring above the \(m\)-th best candidate, Polynomially bounded sequences and polynomial sequences, Parametrizing compactly supported orthonormal wavelets by discrete moments, Sign properties of Metzler matrices with applications, Adaptive decentralized control for a class of interconnected nonlinear systems via backstepping approach and graph theory, Fast and accurate algorithm for the generalized exponential integral \(E_{\nu}(x)\) for positive real order, Ubiquity of Benford's law and emergence of the reciprocal distribution, Divided differences in noncommutative geometry: rearrangement lemma, functional calculus and expansional formula, Benchmark testing of algorithms for very robust regression: FS, LMS and LTS, On a conjecture about the hypoenergetic trees, Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009)), Bounding the spectrum of large Hermitian matrices, Beta-MPT: multinomial processing tree models for addressing individual differences, Limiting distributions for additive functionals on Catalan trees, Authenticated key agreement in dynamic peer groups, Smallest formulas for the parity of \(2^k\) variables are essentially unique, Efficient algorithms for clique problems, Zeros of generalized Rogers-Ramanujan series: asymptotic and combinatorial properties, A complementary view on the growth of directory trees, On the statistical properties of finite continued fractions, Quantum Monte Carlo on graphical processing units, Factors of characteristic words: location and decompositions, The expected value under the Yule model of the squared path-difference distance, Near-optimal radio use for wireless network synchronization, Hashing and canonicalizing Notation 3 graphs, A motivating exploration on lunar craters and low-energy dynamics in the Earth-Moon system, Fast binary multiplication by performing dot counting and complement recoding, Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of \(\pi \) calculation, Preserving the number of cycles of length \(k\) in a growing uniform permutation, Modular Catalan numbers, Unbalanced digit sets and the closest choice strategy for minimal weight integer representations, Words with a generalized restricted growth property, Coalescent simulation in continuous space: algorithms for large neighbourhood size, Reallocation problems in scheduling, Upper and lower bounds for the Kirchhoff index of the \(n\)-dimensional hypercube network, Effective approximation of parametrized closure systems over transactional data streams, The complexity of checking the polynomial completeness of finite quasigroups, A generator of pseudo-random numbers sequences with a very long period, Sum-discrepancy test on pseudorandom number generators, Modified decomposition method for multiple recursive random number generator, Efficient mesh deformation using radial basis functions with a grouping-circular-based greedy algorithm, Exact controllability of the wave equation on graphs, Minimising inequality in multiagent resource allocation: structural analysis of a distributed approach, On Schneider's continued fraction map on a complete non-Archimedean field, A visual analysis method of randomness for classifying and ranking pseudo-random number generators, Fractal form of the partition functions \(p(n)\), A brief and understandable guide to pseudo-random number generators and specific models for security, Wilf equivalence relations for consecutive patterns, On profinite groups with automorphisms whose fixed points have countable Engel sinks, A fast parallel modular exponentiation algorithm, Pseudorandom processes, Complexity and performance of secure floating-point polynomial evaluation protocols, Optimal full ranking from pairwise comparisons, A discrete random walk on the hypercube, A fast algorithm for computing the number of magic series, A computationally efficient scheme for feature extraction with kernel discriminant analysis, On the distribution of betweenness centrality in random trees, On the Farey sequence and its augmentation for applications to image analysis, Lattice-based algorithms for number partitioning in the hard phase, Inductive reasoning on recursive equations, Symmetry properties of multiple recursive random number generators in full period and spectral test, Verification of the Miller-Rabin probabilistic primality test., A cellular automaton -- finite volume method for the simulation of dendritic and eutectic growth in binary alloys using an adaptive mesh refinement, A survey of string orderings and their application to the Burrows-Wheeler transform, \(E=I+T\): the internal extent formula for compacted tries, Finite-size scaling approach to dynamic storage allocation problem, The single row facility layout problem: state of the art, Estimates for exponential sums. Applications, The non-Archimedean theory of discrete systems, The \(m\)-version of binary search trees: an average case analysis, On the fastest Vickrey algorithm, Trimmed Moebius inversion and graphs of bounded degree, Mining frequent closed rooted trees, Dynamic phasors estimation based on Taylor-Fourier expansion and Gram matrix representation, A data-driven smoothed particle hydrodynamics method for fluids, Inglenook shunting puzzles, Restricted stacks as functions, Normally ordered forms of powers of differential operators and their combinatorics, Equidistribution, uniform distribution: a probabilist's perspective, Geometric conditions for \(\square\)-irreducibility of certain representations of the general linear group over a non-Archimedean local field, Asymptotic analysis of a storage allocation model with finite capacity: joint distribution, Single and simultaneous binary mergers in Wright-Fisher genealogies, \(h\)-adic polynomials and partial fraction decomposition of proper rational functions over \(\mathbb{R}\) or \(\mathbb{C}\), Conversion of mersenne twister to double-precision floating-point numbers, How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields, Colored operads, series on colored operads, and combinatorial generating systems, Flexible resource allocation to interval jobs, A type system for counting instances of software components, Robust optimization analysis for multiple attribute decision making problems with imprecise information, Parallel algorithms for separable permutations, Mergible states in large NFA, Periodic template tests: a family of statistical randomness tests for a collection of binary sequences, Recurrence relations based on minimization, Reduced word manipulation: patterns and enumeration, New recursive representations for the Favard constants with application to multiple singular integrals and summation of series, Energy on spheres and discreteness of minimizing measures, Study on upper limit of sample size for a two-level test in NIST SP800-22, An algebraic framework for minimum spanning tree problems, A generalization of Dijkstra's algorithm, The complexity of finding fixed-radius near neighbors, B-series methods cannot be volume-preserving, Duality of graded graphs through operads, Extremal values of the Sackin tree balance index, Global Fibonacci nim, Metric dimension of critical Galton-Watson trees and linear preferential attachment trees, Binomial coefficients with non-integral lower index, Lower bounds for superpatterns and universal sequences, New schemes for sharing points on an elliptic curve, Coherent neural oscillations induced by weak synaptic noise, Simpler proofs with decentralized invariants, An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation, Order statistics and Benford's law, Order-\(n\) cluster Monte Carlo method for spin systems with long-range interactions, Fitting a \(C^m\)-smooth function to data. II, The \(C^m\) norm of a function with prescribed jets. II, On minimum \(k\)-modal partitions of permutations, Refined Wilf-equivalences by Comtet statistics, Positional number systems with digits forming an arithmetic progression, Noncommutative algebra, multiple harmonic sums and applications in discrete probability, Asymptotic analysis of a storage allocation model with finite capacity: marginal and conditional distributions, Sign determination in residue number systems, Structured construction and simulation of nondeterministic stochastic activity networks, An in-place truncated Fourier transform, A. de Moivre theorem revisited, Multiple-edge-fault-tolerant approximate shortest-path trees, Automata on finite trees, Finite skew braces with isomorphic non-abelian characteristically simple additive and circle groups, Maximum likelihood analysis of algorithms and data structures, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, The average diameter and its estimation in nonlinear structures, Hyperbolic polyhedral surfaces with regular faces, Acceleration of RBF-FD meshless phase-field modelling of dendritic solidification by space-time adaptive approach, DLP in semigroups: algorithms and lower bounds, De Moivre and Bell polynomials, A fast Euclidean algorithm for Gaussian integers, Basic analytic combinatorics of directed lattice paths, Chaotical PRNG based on composition of logistic and tent maps using deep-zoom, Relax, but don't be too lazy, Sparsity in higher order methods for unconstrained optimization, Dynamical directions in numeration, Behavioral complexity indicators for process algebra: The NKS approach, Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage, Optimal inter-object correlation when replicating for availability, The pruning-grafting lattice of binary trees, GLOUDS: representing tree-like graphs, Relation-Algebraic Verification of Prim’s Minimum Spanning Tree Algorithm, CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES, Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials, Reverse multiple recursive random number generators, An efficient algorithm for characteristic tracking on two-dimensional triangular meshes, Random Deterministic Automata, An application of singular traces to crystals and percolation, Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments, A context-free language for binary multinomial processing tree models, Squaring within the Colless index yields a better balance index, On the restrictiveness of the usual stochastic order and the likelihood ratio order, New production matrices for geometric graphs, Multiple consecutive runs of multi-state trials: distributions of \(( k_1 , k_2 , \dots , k_\ell )\) patterns, Modified DIRECT Algorithm for Scaled Global Optimization Problems, Optimizing binary heaps, On Weak Keys and Forgery Attacks Against Polynomial-Based MAC Schemes, On a closed form for derangement numbers: an elementary proof, Mixing time for Markov chain on linear extensions, Distance geometry and data science, Tree series and pattern avoidance in syntax trees, Small sample uniformity in random number generation, Minimal coverability tree construction made complete and efficient, Number of complete \(N\)-ary subtrees on Galton-Watson family trees, On generators and relations for higher level Zhu algebras and applications, The determinant of one-dimensional polyharmonic operators of arbitrary order, Cause and origin of Moire interferences in recursive processes and with fixed-point and floating-point data types, Division algebras and maximal orders for given invariants, Gap statistics and higher correlations for geometric progressions modulo one, Triangulations of Cayley and Tutte polytopes, On some connections between statistics and cryptology, Addition chains, vector chains, and efficient computation, On Fast Calculation of Addition Chains for Isogeny-Based Cryptography, Fast computation of binomial coefficients, Analysis of Smith's rule in stochastic machine scheduling, Evaluation of Abramowitz functions in the right half of the complex plane, Data Refinement of Invariant Based Programs, A quantum genetic algorithm with quantum crossover and mutation operations, A general method for to decompose modular multiplicative inverse operators over Group of units, Saber on ESP32, On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators, Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system, Combinatorial proof of Selberg's integral formula, On a generalization of addition chains: addition-multiplication chains, New algorithms for relaxed multiplication, Revisiting Shao and Sokal's \(B_2\) index of phylogenetic balance, A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices, Rational agents are the quickest, A generalization of magic squares with applications to digital halftoning, On the primality of $n! \pm 1$ and $2 \times 3 \times 5 \times \dotsm \times p \pm 1$, Remainder approach for the computation of digital straight line subsegment characteristics, Authenticating ad hoc networks by comparison of short digests, Species assembly in model ecosystems. II: Results of the assembly process, Some observations on the theory of cryptographic hash functions, An exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers, Ninth and tenth order virial coefficients for hard spheres in \(D\) dimensions, A concentration bound for the longest increasing subsequence of a randomly chosen involution, Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks, A generic approach to searching for Jacobians, Computing prime harmonic sums, Ordered trees and the inorder traversal, Random Records and Cuttings in Binary Search Trees, Decoupling combinatorial complexity: a two-step approach to distributions of runs, Fast modular multiplication based on complement representation and canonical recoding, A variable-selection heuristic for K-means clustering, MÖBIUS TRANSFORMATIONS IN QUANTUM AMPLITUDE AMPLIFICATION WITH GENERALIZED PHASES, How downwards causation occurs in digital computers, Search heuristics and the influence of non-perfect randomness: examining genetic algorithms and simulated annealing, Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations, Patterns in random permutations avoiding some sets of multiple patterns, A note on immanant preservers, Full period and spectral test of linear congruential generator and second-order multiple recursive generator, Gaussian binomial coefficients with negative arguments, Branching random walks on binary search trees: convergence of the occupation measure, Balanced Allocation on Graphs: A Random Walk Approach, How should spin-weighted spherical functions be defined?, On indefinite sums weighted by periodic sequences, Algorithm 956, On the heuristic of approximating polynomials over finite fields by random mappings, On Synchronizing Automata and Uniform Distribution, Generating functions for finite sums involving higher powers of binomial coefficients: analysis of hypergeometric functions including new families of polynomials and numbers, Resolving two conjectures on staircase encodings and boundary grids of \(132\) and \(123\)-avoiding permutations, Constrained tree inclusion, Extended Euclidean Algorithm and CRT Algorithm, Reducible means, On Floyd and Rivest's SELECT algorithm, Limit theorems for patterns in phylogenetic trees, Automatic evaluations of cross-derivatives, Fast Order-Preserving Pattern Matching, Excuse me! or the courteous theatregoers' problem, Counting Hamiltonian cycles in bipartite graphs, A note on divisors of multinomial coefficients, Speeding up a memetic algorithm for the max-bisection problem, Random simulations for generative art construction – some examples, Spectral test of DX and DL multiple recursive random number generators, THE UNIT RBFNETWORK: EXPERIMENTS AND PRELIMINARY RESULTS, The Krein-von Neumann extension of a regular even order quasi-differential operator, On differential uniformity of permutations derived using a generalized construction, The p-adic Theory of Automata Functions, Distributions of restricted rotation distances, Elliptic curve with Optimal mixed Montgomery-Edwards model for low-end devices, A statistical analysis of the screening measure of multiple recursive random number generators of orders one and two, Spin correlation functions, Ramus-like identities, and enumeration of constrained lattice walks and plane partitions, Levels of abstraction and the Turing test, An identity involving derangement numbers and Bell numbers, Upper Bounds on Mixing Time of Finite Markov Chains, Exotic quantum statistics and thermodynamics from a number-conserving theory of Majorana fermions, Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers, Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form, An “Esoteric” Proof of Gelin-Cesàro Identity, On a Combinatorial Generation Problem of Knuth, On using expansions to the base of −2, Multivariable orthogonal polynomials associated with tensor products of the oscillator algebra 𝖇(1), Geometric and Statistical Properties of Pseudorandom Number Generators Based on Multiple Recursive Transformations, Generalised Mersenne numbers revisited, A simulation-based comparison of two methods for determining the treatment effect in children diagnosed with hyperkinetic disorder, A note on deficit analysis in dependency models involving Coxian claim amounts, Algorithm 938, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On a storage allocation model with finite capacity, Unnamed Item, Smallest Formulas for Parity of 2 k Variables Are Essentially Unique, Extending Hierarchical Probing for Computing the Trace of Matrix Inverses, A Uniform Approach Towards Succinct Representation of Trees, Pseudo-Random Bit Generation Based on 2D Chaotic Maps of Logistic Type and Its Applications in Chaotic Cryptography, Unnamed Item, Patterns in Random Permutations Avoiding the Pattern 132, HILBERT–SCHMIDT OPERATORS AND FRAMES — CLASSIFICATION, BEST APPROXIMATION BY MULTIPLIERS AND ALGORITHMS, Multipoint formulas for scattered far field in multidimensions, New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, A general framework for high-accuracy parametric interpolation, Hopscotch Hashing, A characterisation of Newton maps, LOCALIZED MONTE CARLO ALGORITHM TO COMPUTE PRICES OF PATH DEPENDENT OPTIONS ON TREES, Assessing the Statistical Quality of RNGs, A No-History, Low Latency Photonic Quantum Random Bit Generator for Use in a Loophole Free Bell Tests and General Applications, The perils of thresholding, New statistical randomness tests: 4-bit template matching tests, On the complexity of calculation of differentials and gradients, Periodic solutions to some difference equations over the integers, ON GENERIC COMPLEXITY OF THE VALIDITY PROBLEM FOR BOOLEAN FORMULAS, Light matrices of prime determinant, A Twin Error Gauge for Kaczmarz's Iterations, A new algorithm for generation of different types of RNA, The Collocation Basis of Compact Finite Differences for Moment-Preserving Interpolations: Review, Extension and Applications, On some packing problem related to dynamic storage allocation, The Monte Carlo Algorithm with a Pseudorandom Generator, A new approach for proving or generating combinatorial identities, Modifiable Array Data Structures for Mesh Topology, Detecting perfect powers in essentially linear time, On the Medians of Gamma Distributions and an Equation of Ramanujan, Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques, The complete generating function for Gessel walks is algebraic, Some Conjectures Concerning Complexity of PL subdivisions, Unnamed Item, An O(M(n) logn) Algorithm for the Jacobi Symbol, Clusters, Coxeter-sortable elements and noncrossing partitions, Sharp estimates for perturbation errors in summations, Performance and accuracy of hardware-oriented native-, emulated- and mixed-precision solvers in FEM simulations, Toward Acceleration of RSA Using 3D Graphics Hardware, Integer complexity: algorithms and computational results, Volumes of Vector Fields on Spheres, Quantum Random Bit Generator Service for Monte Carlo and Other Stochastic Simulations, A Parallel Algorithm for Multiple-Precision Division by a Single-Precision Integer, Effective bounds for the measure of rotations, Multiobjective Metamodel–Assisted Memetic Algorithms, Modular proximal optimization for multidimensional total-variation regularization, EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS, ON THE DISTRIBUTION OF COUNTER-DEPENDENT NONLINEAR CONGRUENTIAL PSEUDORANDOM NUMBER GENERATORS IN RESIDUE RINGS, A Groupoid of Isomorphic Data Transformations, Unnamed Item, Unnamed Item, Nonlinear phenomena in spaces of algorithms, Jordan blocks of unipotent elements in some irreducible representations of classical groups in good characteristic, Unnamed Item, Unnamed Item, A space efficient algorithm for group structure computation, Closed form summation of 𝐶-finite sequences, TOWARDS POSSIBLE NON-EXTENSIVE THERMODYNAMICS OF ALGORITHMIC PROCESSING — STATISTICAL MECHANICS OF INSERTION SORT ALGORITHM, Two chain rules for divided differences and Faà di Bruno’s formula, Increasing integer sequences and Goldbach's conjecture, Unnamed Item, Hilbert matrices and formulae with binomials, Parallel algorithms for matroid intersection and matroid parity, A three-term Karatsuba multiplier for a special class of trinomials, The largest entry in the inverse of a Vandermonde matrix, Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography, Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph, Algorithm 947, Fast approximate computations with Cauchy matrices and polynomials
