The following pages link to (Q3935355):
Displaying 50 items.
- Using information theory approach to randomness testing (Q110728) (← links)
- Rigorous numerics for nonlinear operators with tridiagonal dominant linear part (Q255432) (← links)
- Scalable generation of scale-free graphs (Q269740) (← links)
- Black-box polynomial resultants (Q286994) (← links)
- A simple approach for generating RSA keys (Q287121) (← links)
- Improvements on the accelerated integer GCD algorithm (Q290191) (← links)
- How to build a device that cannot be built (Q291545) (← links)
- An optimal message routing algorithm for double-loop networks (Q293257) (← links)
- Random permutations on distributed, external and hierarchical memory (Q293386) (← links)
- Linear systolic multiplier/squarer for fast exponentiation (Q294863) (← links)
- Parameterization of slow-stable manifolds and their invariant vector bundles: theory and numerical implementation (Q321574) (← links)
- Temporal correlations and device-independent randomness (Q331566) (← links)
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- On Prouhet's solution to the equal powers problem (Q387801) (← links)
- The independence of two randomness properties of sequences over finite fields (Q413465) (← links)
- A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
- Reconstruction of conditional expectations from product moments with applications (Q458179) (← links)
- Practical algorithms for generating a random ordering of the elements of a weighted set (Q489756) (← links)
- Primality test for numbers of the form \(A p^n + w_n\) (Q491620) (← links)
- Almost universal forgery attacks on AES-based MAC's (Q494579) (← links)
- Qualitative probabilistic inference under varied entropy levels (Q507547) (← links)
- Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms (Q515680) (← links)
- On multiplicatively independent bases in cyclotomic number fields (Q519981) (← links)
- A multiprecise integer arithmetic package (Q547494) (← links)
- Factoring: algorithms, computations, and computers (Q547500) (← links)
- On \(d\)-orthogonality of the Sheffer systems associated to a convolution semigroup (Q557717) (← links)
- Topics in computational algebraic number theory (Q558179) (← links)
- Point sets and sequences with small discrepancy (Q580423) (← links)
- An improved parallel algorithm for integer GCD (Q582082) (← links)
- Optimal word chains for the Thue-Morse word (Q582129) (← links)
- Gaussian limiting distributions for the number of components in combinatorial structures (Q582688) (← links)
- Fast random generation of binary, t-ary and other types of trees (Q582880) (← links)
- Automatic derivation and implementation of fast convolution algorithms (Q597062) (← links)
- One class of planar rational involutions (Q640134) (← links)
- Distributional analysis of a generalization of the Pólya process (Q661268) (← links)
- Linear relations between pattern sequences in a \(\langle q, r\rangle\)-numeration system (Q663284) (← links)
- A stochastic Galerkin approach to uncertainty quantification in poroelastic media (Q669364) (← links)
- A space-efficient fast prime number sieve (Q671385) (← links)
- Variance reduction for Bernoulli response variables in simulation (Q672957) (← links)
- On the stability of polynomial transformations between Taylor, Bernstein and Hermite forms (Q676933) (← links)
- Quadratic congruential pseudorandom numbers: Distribution of lagged pairs (Q678814) (← links)
- Upper bounds in spectral test for multiple recursive random number generators with missing terms (Q679270) (← links)
- Efficient and optimal exponentiation in finite fields (Q685709) (← links)
- Feasibility problems for recurring tasks on one processor (Q688715) (← links)
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) (Q688722) (← links)
- Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568) (← links)
- Permutation statistics and the \(q,t\)-Catalan sequence (Q703606) (← links)
- Parallel use of multiplicative congruential random number generators (Q710021) (← links)
- Obtaining the quantum Fourier transform from the classical FFT with QR decomposition (Q711225) (← links)
- Universal codes as a basis for time series testing (Q713722) (← links)
