How can we solve a linear Diophantine equation by the basis reduction algorithm. (English)
Int. J. Comput. Math. 82, No. 10, 1227-1234 (2005).
1
A note on E. Thiémard’s algorithm to compute bounds for the star discrepancy. (English)
J. Complexity 21, No. 3, 320-323 (2005).
2
An algorithm to compute bounds for the star discrepancy. (English)
J. Complexity 17, No.4, 850-880 (2001).
3
The exponent of discrepancy is at least 1. 0669. (English)
J. Complexity 14, No.4, 448-453 (1998).
4
Discrete Fourier transform computation using prime Ramanujan numbers. (English)
Proc. Indian Acad. Sci., Math. Sci. 107, No.1, 95-100 (1997).
5
The exact length of the Euclidean algorithm in ${\bbfF}\sb q[X]$. (English)
Mathematika 35, No.2, 297-304 (1988).
6
Pseudozufallszahlen und die Theorie der Gleichverteilung. (Pseudo-random numbers and the theory of uniform distribution). (German)
Sitzungsber., Abt. II, Österr. Akad. Wiss., Math.-Naturwiss. Kl. 195, 109-138 (1986).
7
Supplement to "The maximal modulus of an algebraic integer". (English)
Math. Comput. 45, S17-S20 (1985).
8
The maximal modulus of an algebraic integer. (English)
Math. Comput. 45, 243-249 (1985).
9
Start
Contact
Print
General Help
