Explicit digital inversive pseudorandom numbers
Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus
Fill's algorithm for absolutely continuous stochastically monotone kernels.
Generación de un sistema bivariante con marginales dadas y estimación de su parámetro de dependencia.
En este trabajo se proponen dos posibles estimadores del parámetro de dependencia de una familia de distribuciones bivariantes con marginales dadas y se realiza un estudio de Monte Carlo de sus respectivos sesgo y eficiencia, a fin de determinar cuál de ambos estimadores es preferible. También se propone y se estudia, de forma similar, una posible versión "Jackknife" del mejor de los dos estimadores anteriores. En este estudio se emplean técnicas de reducción de la varianza. Para poder realizar...
General discrepancy estimates II: the Haar function system
General Discrepancy Estimates III: The Erdös-Turán-Koksma Inequality for the Haar Function System.
Generating Dirichlet random vectors using a rejection property
Generating Uniformly Distributed Points In A Sphere Of Norm ..... In .....
Generátory pseudonáhodných čísel založené na nekonečných slovech
Improved discrepancy bounds for hybrid sequences involving Halton sequences
Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators
Infinite pseudo-random sequences of high algorithmic complexity
Kloosterman-type sums and the discrepancy of nonoverlapping pairs of inversive congruential pseudorandom numbers
Kolmogorov complexity, pseudorandom generators and statistical models testing
An attempt to formalize heuristic concepts like strings (sequences resp.) “typical” for a probability measure is stated in the paper. Both generating and testing of such strings is considered. Kolmogorov complexity theory is used as a tool. Classes of strings “typical” for a given probability measure are introduced. It is shown that no pseudorandom generator can produce long strings from the classes. The time complexity of pseudorandom generators with oracles capable to recognize “typical” strings...
Lower Bounds for the Discrepancy of Triples of Inversive Congruential Pseudorandom Numbers with Power of Two Modulus.
Marsaglia's Lattice Test and Non-Linear Congruential Pseudo Random Number Generators.
Measures of pseudorandomness of finite binary lattices, I. The measures , normality
Monotone subsequences in the sequence of fractional parts of multiples of an irrational.
Nonoverlapping Pairs of Explicit Inversive Congruential Pseudorandom Numbers.
On a Conjecture of Zaremba.