Pseudorandomness of a random Kronecker sequence. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 157-171 (2012).
1
A note on “Euclidean algorithms are Gaussian” by V. Baladi and B. Vallée. (English)
J. Number Theory 129, No. 10, 2267-2273 (2009).
2
Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms. (English)
J. Symb. Comput. 44, No. 7, 726-767 (2009).
3
On the non randomness of modular arithmetic progressions. (English)
Fourth colloquium on mathematics and computer science IV. Algorithms, trees, combinatorics and probabilities. Papers based on the presentations at the colloquium, Nancy, France, September 18‒22, 2006. Nancy: The Association. Discrete Mathematics \& Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 271-288, electronic only (2006).
4
The $α$-concentration of Procaccia of infinite words in finitely generated Fuchsian groups. (English)
Rev. Unión Mat. Argent. 40, No.1-2, 127-139 (1996).
5
Start
Contact
Print
General Help
