LIST OF PUBLICATIONS

Harald Niederreiter


BOOKS:


  1. (with L. Kuipers), Uniform Distribution of Sequences, Interscience Tracts, John Wiley and Sons, New York, 1974, xiv + 390 pp.

  2. (with R. Lidl), Finite Fields, Encyclopedia of Math. and Its Appl., Vol. 20, Addison-Wesley Publ. Co., Reading, Mass., 1983, xx + 755 pp.; reprint, Cambridge Univ. Press, Cambridge, 1997.

  3. (with L. Kuipers), Ravnomernoe Raspredelenie Posledovatel'noste{\v{\i\/}}\kern.15em, Izdat. ``Nauka'', Moscow, 1985, 407 pp. (Russian translation of 1.)

  4. (with R. Lidl), Introduction to Finite Fields and Their Applications, Cambridge Univ. Press, Cambridge, 1986, viii + 407 pp.; revised edition, 1994, xi + 416 pp.

  5. (with R. Lidl), Konecnye Polja, Izdat. ``Mir'', Moscow, 1988, 820 pp. (Russian translation of 2.).

  6. Random Number Generation and Quasi-Monte Carlo Methods, CBMS-NSF Regional Conference Series in Applied Math., Vol. 63, Soc. Industr. Applied Math., Philadelphia, 1992, vi + 241 pp. (1995 Outstanding Simulation Publication Award)

  7. (with P.J.-S. Shiue, eds.), Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Lecture Notes in Statistics, Vol. 106, Springer-Verlag, New York, 1995, xiv + 372 pp.

  8. (with S. Cohen, eds.), Finite Fields and Applications, London Math. Society Lecture Note Series, Vol. 233, Cambridge Univ. Press, Cambridge, 1996, xx + 401 pp.

  9. (with P. Hellekalek, G. Larcher, and P. Zinterhof, eds.), Monte Carlo and Quasi-Monte Carlo Methods 1996, Lecture Notes in Statistics, Vol. 127, Springer-Verlag, New York, 1998, xii + 448 pp.

  10. (with C. Ding and T. Helleseth, eds.), Sequences and Their Applications (Proceedings of SETA '98), Springer-Verlag, London, 1999, ix + 393 pp.

  11. (with J. Spanier, eds.), Monte Carlo and Quasi-Monte Carlo Methods 1998, Springer-Verlag, Berlin, 2000, xvi + 470 pp.

  12. (with D. Jungnickel, eds.), Finite Fields and Applications, Springer-Verlag, Berlin, 2001, ix + 490 pp.

  13. (with C.P. Xing), Rational Points on Curves over Finite Fields: Theory and Applications, London Math. Society Lecture Note Series, Vol. 285, Cambridge Univ. Press, Cambridge, 2001, x + 245 pp.

  14. (with K.-T. Fang and F.J. Hickernell, eds.), Monte Carlo and Quasi-Monte Carlo Methods 2000, Springer-Verlag, Berlin, 2002, xxii + 548 pp.

  15. (ed.), Coding Theory and Cryptology, Singapore University Press and World Scientific Publishing, Singapore, 2002, xi + 446 pp.


PAPERS:


  1. (with E. Hlawka), Diskrepanz in kompakten abelschen Gruppen I, Manuscripta Math. 1, 259-288 (1969).

  2. Diskrepanz in kompakten abelschen Gruppen II, Manuscripta Math. 1, 293-306 (1969).

  3. Permutation polynomials in several variables over finite fields, Proc. Japan Acad. 46, 1001-1005 (1970).

  4. Orthogonal systems of polynomials in finite fields, Proc. Amer. Math. Soc. 28, 415-422 (1971).

  5. Distribution of sequences and induced orders, Nieuw Archief voor Wisk. (3) 19, 210-219 (1971).

  6. Almost-arithmetic progressions and uniform distribution, Trans. Amer. Math. Soc. 161, 283-292 (1971).

  7. Permutation polynomials in several variables, Acta Sci. Math. (Szeged) 33, 53-58 (1972).

  8. Methods for estimating discrepancy, Applications of Number Theory to Numerical Analysis (S.K. Zaremba, ed.), pp. 203-236, Academic Press, New York - London, 1972.

  9. A distribution problem in finite sets, Applications of Number Theory to Numerical Analysis (S.K. Zaremba, ed.), pp. 237-248, Academic Press, New York - London, 1972.

  10. Distribution of Fibonacci numbers mod $5^{k}$, Fibonacci Quart. 10, 373-374 (1972).

  11. On the distribution of pseudo-random numbers generated by the linear congruential method, Math. Comp. 26, 793-795 (1972).

  12. On a number-theoretical integration method, Aequationes Math. 8, 304-311 (1972).

  13. On the existence of uniformly distributed sequences in compact spaces, Compositio Math. 25, 93-99 (1972).

  14. (with H.G. Meijer), On a distribution problem in finite sets, Compositio Math. 25, 153-160 (1972).

  15. On a class of sequences of lattice points, J. Number Th. 4, 477-502 (1972).

  16. Discrepancy and convex programming, Ann. Mat. Pura Appl. (IV) 93, 89-97 (1972).

  17. Uniform distribution of lattice points, Proc. Number Theory Conf. (Boulder, CO, 1972), pp. 162-166.

  18. (with W. Philipp), On a theorem of Erdös and Turán on uniform distribution, Proc. Number Theory Conf. (Boulder, CO, 1972), pp. 180-182.

  19. (with R. Lidl), On orthogonal systems and permutation polynomials in several variables, Acta Arith. 22, 257-265 (1973).

  20. Zur quantitativen Theorie der Gleichverteilung, Monatsh. Math. 77, 55-62 (1973).

  21. The distribution of Farey points, Math. Annalen 201, 341-345 (1973).

  22. Metric theorems on the distribution of sequences, Proc. Symp. Pure Math., Vol. 24, pp. 195-212, American Math. Society, Providence, RI, 1973.

  23. Application of diophantine approximations to numerical integration, Diophantine Approximation and Its Applications (C.F. Osgood, ed.), pp. 129-199, Academic Press, New York, 1973.

  24. (with W. Philipp), Berry-Esseen bounds and a theorem of Erdös and Turán on uniform distribution mod $1$, Duke Math. J. 40, 633-649 (1973).

  25. (with L. Kuipers), Asymptotic distribution mod $m$ and independence of sequences of integers. I, II, Proc. Japan Acad. 50, 256-260, 261-265 (1974).

  26. On the distribution of pseudo-random numbers generated by the linear congruential method. II, Math. Comp. 28, 1117-1132 (1974).

  27. Well-distributed sequences with respect to systems of convex sets, Proc. Amer. Math. Soc. 47, 305-310 (1975).

  28. On a paper of Blum, Eisenberg, and Hahn concerning ergodic theory and the distribution of sequences in the Bohr group, Acta Sci. Math. (Szeged) 37, 103-108 (1975).

  29. (with J.M. Wills), Diskrepanz und Distanz von Maßen bezüglich konvexer und Jordanscher Mengen, Math. Zeitschrift 144, 125-134 (1975); Corrigendum, ibid. 148, 99 (1976).

  30. Rearrangement theorems for sequences, Journées Arithmétiques de Bordeaux (Univ. de Bordeaux, 1974), Astérisque, Vol. 24-25, pp. 243-261, Soc. Math. France, Paris, 1975.

  31. (with H.G. Meijer), Equirépartition et théorie des nombres premiers, Répartition Modulo 1 (Colloque de Marseille-Luminy, 1974), Lecture Notes in Math., Vol. 475, pp. 104-112, Springer-Verlag, Berlin, 1975.

  32. Indépendance de suites, Répartition Modulo 1 (Colloque de Marseille-Luminy, 1974), Lecture Notes in Math., Vol. 475, pp. 120-131, Springer-Verlag, Berlin, 1975.

  33. Résultats nouveaux dans la théorie quantitative de l'équirépartition, Répartition Modulo 1 (Colloque de Marseille-Luminy, 1974), Lecture Notes in Math., Vol. 475, pp. 132-154, Springer-Verlag, Berlin, 1975.

  34. (with L. Kuipers and J.-S. Shiue), Uniform distribution of sequences in the ring of Gaussian integers, Bull. Inst. Math. Acad. Sinica 3, 311-325 (1975).

  35. Quantitative versions of a result of Hecke in the theory of uniform distribution mod $1$, Acta Arith. 28, 321-339 (1975).

  36. (with S.K. Lo), Uniform distribution of sequences of algebraic integers, Math. J. Okayama Univ. 18, 13-29 (1975).

  37. (with S.K. Lo), Banach-Buck measure, density, and uniform distribution in rings of algebraic integers, Pacific J. Math. 61, 191-208 (1975).

  38. (with C.F. Osgood), A uniform distribution question related to numerical analysis, Math. Comp. 30, 366-370 (1976).

  39. On the cycle structure of linear recurring sequences, Math. Scand. 38, 53-77 (1976).

  40. On the distribution of pseudo-random numbers generated by the linear congruential method. III, Math. Comp. 30, 571-597 (1976).

  41. An application of the Hilbert-Montgomery-Vaughan inequality to the metric theory of uniform distribution mod $1$, J. London Math. Soc. (2) 13, 497-506 (1976).

  42. Some new exponential sums with applications to pseudo-random numbers, Topics in Number Theory (Debrecen, 1974), Colloquia Math. Soc. János Bolyai, Vol. 13, pp. 209-232, North-Holland Publ. Co., Amsterdam, 1976.

  43. Statistical independence of linear congruential pseudo-random numbers, Bull. Amer. Math. Soc. 82, 927-929 (1976).

  44. (with J. Schoißengeier), Almost periodic functions and uniform distribution mod $1$, J. reine angew. Math. 291, 189-203 (1977).

  45. Weights of cyclic codes, Information and Control 34, 130-140 (1977).

  46. Pseudo-random numbers and optimal coefficients, Advances in Math. 26, 99-181 (1977).

  47. (with J.-S. Shiue), Equidistribution of linear recurring sequences in finite fields, Indagationes Math. 80, 397-405 (1977).

  48. (with H.L. Montgomery), Estimation optimale de sommes exponentielles, Bull. Soc. Math. Grèce 18, 291-301 (1977).

  49. The serial test for linear congruential pseudo-random numbers, Bull. Amer. Math. Soc. 84, 273-274 (1978).

  50. Statistical tests for linear congruential pseudo-random numbers, COMPSTAT 1978: Proceedings in Computational Statistics (Leiden, 1978), pp. 398-404, Physica-Verlag, Vienna, 1978.

  51. Ergodic sequences of measures and a problem in additive number theory, Archiv der Math. 31, 21-32 (1978).

  52. Quasi-Monte Carlo methods and pseudo-random numbers, Bull. Amer. Math. Soc. 84, 957-1041 (1978).

  53. Existence of good lattice points in the sense of Hlawka, Monatsh. Math. 86, 203-219 (1978).

  54. Nombres pseudo-aléatoires et équirépartition, Journées Arithmétiques de Marseille (Univ. de Marseille-Luminy, 1978), Astérisque, Vol. 61, pp. 155-164, Soc. Math. France, Paris, 1979.

  55. (with J.-S. Shiue), Uniform distribution of sequences in rings of integral matrices, Glasgow Math. J. 20, 169-178 (1979).

  56. (with K. McCurley), Optimization of functions by quasi-random search methods, Computing 22, 119-123 (1979).

  57. (with S.K. Lo), Permutation polynomials over rings of algebraic integers, Abh. Math. Sem. Univ. Hamburg 49, 126-139 (1979).

  58. Verteilung von Resten rekursiver Folgen, Archiv der Math. 34, 526-533 (1980).

  59. (with J.-S. Shiue), Equidistribution of linear recurring sequences in finite fields, II, Acta Arith. 38, 197-207 (1980).

  60. (with K.H. Robinson), Bol loops of order $pq$, Math. Proc. Cambridge Philos. Soc. 89, 241-256 (1981).

  61. Statistical independence properties of Tausworthe pseudo-random numbers, Proc. Third Caribbean Conf. on Combinatorics and Computing (Cave Hill, Barbados, 1981), pp. 163-168, Univ. of the West Indies, Cave Hill, Barbados, 1981.

  62. (with P. Peart), A comparative study of quasi-Monte Carlo methods for optimization of functions of several variables, Caribbean J. Math. 1, 27-44 (1982).

  63. Statistical tests for Tausworthe pseudo-random numbers, Probability and Statistical Inference (W. Grossmann, G.C. Pflug, and W. Wertz, eds.), pp. 265-274, D. Reidel, Dordrecht - Boston, 1982.

  64. (with K.H. Robinson), Complete mappings of finite fields, J. Austral. Math. Soc. Ser. A 33, 197-212 (1982).

  65. Richard Dedekind and the development of the theory of finite fields, Dedekind-Festband, Abh. Braunschweig. Wissenschaftl. Gesellschaft 33, 183-187 (1982).

  66. (with R.F. Tichy), Beiträge zur Diskrepanz bezüglich gewichteter Mittel, Manuscripta Math. 42, 85-99 (1983).

  67. (with I. Borosh), Optimal multipliers for pseudo-random number generation by the linear congruential method, BIT 23, 65-74 (1983).

  68. A quasi-Monte Carlo method for the approximate computation of the extreme values of a function, Studies in Pure Mathematics (To the Memory of Paul Turán), pp. 523-529, Birkhäuser, Basel, 1983.

  69. Letter to the editor, Amer. Math. Monthly 90, 581 (1983).

  70. (with M.R. Aub), A criterion for stationary states in quantum mechanics, Amer. J. Physics 51, 818-819 (1983).

  71. Applications des corps finis aux nombres pseudo-aléatoires, Sém. Théorie des Nombres 1982-1983, Exp. 38, 9 pp., Univ. de Bordeaux I, Talence, 1983.

  72. Optimal multipliers for linear congruential pseudo-random numbers: The decimal case, Statistics and Probability (J. Mogyoródi, I. Vincze, and W. Wertz, eds.), pp. 255-269, D. Reidel, Dordrecht - Boston, 1984.

  73. Number-theoretic methods for numerical integration and optimization. I (Japanese), Sugaku Seminar 23, no. 11, 57-63 (1984).

  74. On a measure of denseness for sequences, Topics in Classical Number Theory (Budapest, 1981), Colloquia Math. Soc. János Bolyai, Vol. 34, pp. 1163-1208, North-Holland Publ. Co., Amsterdam, 1984.

  75. Number-theoretic methods for numerical integration and optimization. II (Japanese), Sugaku Seminar 23, no. 12, 90-96 (1984).

  76. Distribution mod $1$ of monotone sequences, Indagationes Math. 46, 315-327 (1984).

  77. Number-theoretic problems in pseudorandom number generation, Proc. Symp. on Applications of Number Theory to Numerical Analysis (Kyoto, 1984), Lecture Notes No. 537, pp. 18-28, Research Inst. of Math. Sciences, Kyoto Univ., 1984.

  78. A general rearrangement theorem for sequences, Archiv der Math. 43, 530-534 (1984).

  79. The performance of $k$-step pseudorandom number generators under the uniformity test, SIAM J. Sci. Statist. Computing 5, 798-810 (1984).

  80. The serial test for pseudo-random numbers generated by the linear congruential method, Numer. Math. 46, 51-68 (1985).

  81. (with G.L. Mullen), The structure of a group of permutation polynomials, J. Austral. Math. Soc. Ser. A 38, 164-170 (1985).

  82. (with R.F. Tichy), Solution of a problem of Knuth on complete uniform distribution of sequences, Mathematika 32, 26-32 (1985).

  83. Exponential sums over finite fields, Math. J. Okayama Univ. 27, 147-158 (1985).

  84. (with P. Peart), Quasi-Monte Carlo optimization in general domains, Caribbean J. Math. 4, 67-85 (1985).

  85. Quasi-Monte Carlo methods for global optimization, Proc. Fourth Pannonian Symp. on Math. Statistics (Bad Tatzmannsdorf, 1983), pp. 251-267, D. Reidel, Dordrecht - Boston, 1986.

  86. Multidimensional numerical integration using pseudorandom numbers, Stochastic Programming 84 Part I (A. Prékopa and R.J.-B. Wets, eds.), Math. Programming Study, Vol. 27, pp. 17-38, North-Holland Publ. Co., Amsterdam, 1986.

  87. A public-key cryptosystem based on shift register sequences, Advances in Cryptology - EUROCRYPT '85 (F. Pichler, ed.), Lecture Notes in Computer Science, Vol. 219, pp. 35-39, Springer-Verlag, Berlin, 1986.

  88. Distribution properties of feedback shift register sequences, Problems of Control and Information Theory 15, 19-34 (1986).

  89. (with P. Peart), Localization of search in quasi-Monte Carlo methods for global optimization, SIAM J. Sci. Statist. Computing 7, 660-664 (1986).

  90. Good lattice points for quasirandom search methods, System Modelling and Optimization (A. Prékopa, J. Szelezsán, and B. Strazicky, eds.), Lecture Notes in Control and Information Sciences, Vol. 84, pp. 647-654, Springer-Verlag, Berlin, 1986.

  91. Dyadic fractions with small partial quotients, Monatsh. Math. 101, 309-315 (1986).

  92. Knapsack-type cryptosystems and algebraic coding theory, Problems of Control and Information Theory 15, 159-166 (1986).

  93. Pseudozufallszahlen und die Theorie der Gleichverteilung, Sitzungsber. Österr. Akad. Wiss. Math.-Naturwiss. Kl. Abt. II 195, 109-138 (1986).

  94. A pseudorandom vector generator based on finite field arithmetic, Math. Japonica 31, 759-774 (1986).

  95. On an irrationality theorem of Mahler and Bundschuh, J. Number Th. 24, 197-199 (1986).

  96. Low-discrepancy point sets, Monatsh. Math. 102, 155-167 (1986).

  97. Continued fractions with small partial quotients, Proc. 1986 Nagasaki Symp. on Number Theory (Y. Morita, ed.), pp. 1-11, Tohoku Univ., Sendai (Japan), 1987.

  98. (with R.F. Tichy), Metric theorems on uniform distribution and approximation theory, Journées Arithmétiques de Besançon (Besançon, 1985), Astérisque, Vol. 147-148, pp. 319-323, Soc. Math. France, Paris, 1987.

  99. (with G.L. Mullen), Dickson polynomials over finite fields and complete mappings, Canad. Math. Bull. 30, 19-27 (1987).

  100. Rational functions with partial quotients of small degree in their continued fraction expansion, Monatsh. Math. 103, 269-288 (1987).

  101. Continued fractions for formal power series, pseudorandom numbers, and linear complexity of sequences, Contributions to General Algebra 5 (Proc. Salzburg Conf., 1986), pp. 221-233, B.G. Teubner, Stuttgart, 1987.

  102. (with N.S. James and R. Lidl), Breaking the Cade cipher, Advances in Cryptology - CRYPTO '86 (A.M. Odlyzko, ed.), Lecture Notes in Computer Science, Vol. 263, pp. 60-63, Springer-Verlag, Berlin, 1987.

  103. (with G.L. Mullen), Optimal characteristic polynomials for digital multistep pseudorandom numbers, Computing 39, 155-163 (1987).

  104. On a problem of Kodama concerning the Hasse-Witt matrix and the distribution of residues, Proc. Japan Acad. Ser. A 63, 367-369 (1987).

  105. A statistical analysis of generalized feedback shift register pseudorandom number generators, SIAM J. Sci. Statist. Computing 8, 1035-1051 (1987).

  106. Point sets and sequences with small discrepancy, Monatsh. Math. 104, 273-337 (1987).

  107. Algebraische Methoden zum Entwurf kryptographischer Systeme, Elektrotechnik und Informationstechnik 105, 35-40 (1988).

  108. Sequences with almost perfect linear complexity profile, Advances in Cryptology - EUROCRYPT '87 (D. Chaum and W.L. Price, eds.), Lecture Notes in Computer Science, Vol. 304, pp. 37-51, Springer-Verlag, Berlin, 1988.

  109. Cryptology - The mathematical theory of data security, Prospects of Mathematical Science (T. Mitsui, K. Nagasaka, and T. Kano, eds.), pp. 189-209, World Scientific Publishing, Singapore, 1988.

  110. The generation of pseudorandom sequences for stream ciphers, Proc. Internat. Forum on Information Theory and Its Applications (Tokyo, 1988), Paper LT-5, 10 pp., Tokyo Inst. of Technology, 1988.

  111. (with R.A. Hultquist and G.L. Mullen), Association schemes and derived PBIB designs of prime power order, Ars Combinatoria 25, 65-82 (1988).

  112. Quasi-Monte Carlo methods for multidimensional numerical integration, Numerical Integration III (H. Braß and G. Hämmerlin, eds.), International Series of Numerical Mathematics, Vol. 85, pp. 157-171, Birkhäuser, Basel, 1988.

  113. Low-discrepancy and low-dispersion sequences, J. Number Th. 30, 51-70 (1988).

  114. The probabilistic theory of linear complexity, Advances in Cryptology - EUROCRYPT '88 (C.G. Günther, ed.), Lecture Notes in Computer Science, Vol. 330, pp. 191-209, Springer-Verlag, Berlin, 1988.

  115. (with J. Eichenauer), On Marsaglia's lattice test for pseudorandom numbers, Manuscripta Math. 62, 245-248 (1988).

  116. A simple and general approach to the decimation of feedback shift-register sequences, Problems of Control and Information Theory 17, 327-331 (1988).

  117. Statistical independence of nonlinear congruential pseudorandom numbers, Monatsh. Math. 106, 149-159 (1988).

  118. Remarks on nonlinear congruential pseudorandom numbers, Metrika 35, 321-328 (1988).

  119. (with J.-S. Shiue), Weak equidistribution of sequences in finite fields, Contributions to General Algebra 6 (To the Memory of W. Nöbauer), pp. 203-212, B.G. Teubner, Stuttgart, 1988.

  120. The serial test for digital $k$-step pseudorandom numbers, Math. J. Okayama Univ. 30, 93-119 (1988).

  121. Some new cryptosystems based on feedback shift register sequences, Math. J. Okayama Univ. 30, 121-149 (1988).

  122. (with J. Horbowicz), Optimal bounds for exponential sums in terms of discrepancy, Colloq. Math. 55, 355-366 (1988).

  123. The serial test for congruential pseudorandom numbers generated by inversions, Math. Comp. 52, 135-144 (1989).

  124. Pseudorandom numbers with strong uniformity properties, IMACS Transactions on Scientific Computing (12th IMACS World Congress, Paris, 1988), IMACS Annals on Computing and Applied Mathematics, Vol. 4, Sec. 5, 3pp., J.C. Baltzer, Basel, 1989.

  125. (with J. Horbowicz), Weighted exponential sums and discrepancy, Acta Math. Hungarica 54, 89-97 (1989).

  126. The linear complexity profile of keystream sequences, Proc. Workshop on Stream Ciphers (Karlsruhe, 1989), pp. 69-80, Europäisches Institut für Systemsicherheit, Karlsruhe, 1989.

  127. (with G. Larcher), Optimal coefficients modulo prime powers in the three-dimensional case, Ann. Mat. Pura Appl. (IV) 155, 299-315 (1989).

  128. (with R.F. Tichy and G. Turnwald), An inequality for differences of distribution functions, Archiv der Math. 54, 166-172 (1990).

  129. (with I.H. Sloan), Lattice rules for multiple integration and discrepancy, Math. Comp. 54, 303-312 (1990).

  130. (with D.A. André and G.L. Mullen), Figures of merit for digital multistep pseudorandom numbers, Math. Comp. 54, 737-748 (1990).

  131. A short proof for explicit formulas for discrete logarithms in finite fields, Applicable Algebra Engrg. Comm. Comput. 1, 55-57 (1990).

  132. A combinatorial approach to probabilistic results on the linear-complexity profile of random sequences, J. Cryptology 2, 105-112 (1990).

  133. Lower bounds for the discrepancy of inversive congruential pseudorandom numbers, Math. Comp. 55, 277-287 (1990).

  134. (with J. Eichenauer-Herrmann, H. Grothe, and A. Topuzoglu), On the lattice structure of a nonlinear generator with modulus $2^{\alpha}$, J. Comput. Appl. Math. 31, 81-85 (1990).

  135. Statistical independence properties of pseudorandom vectors produced by matrix generators, J. Comput. Appl. Math. 31, 139-151 (1990).

  136. Keystream sequences with a good linear complexity profile for every starting point, Advances in Cryptology - EUROCRYPT '89 (J.-J. Quisquater and J. Vandewalle, eds.), Lecture Notes in Computer Science, Vol. 434, pp. 523-532, Springer-Verlag, Berlin, 1990.

  137. Pseudorandom numbers generated from shift register sequences, Number-Theoretic Analysis (E. Hlawka and R.F. Tichy, eds.), Lecture Notes in Math., Vol. 1452, pp. 165-177, Springer-Verlag, Berlin, 1990.

  138. An enumeration formula for certain irreducible polynomials with an application to the construction of irreducible polynomials over the binary field, Applicable Algebra Engrg. Comm. Comput. 1, 119-124 (1990).

  139. The linear complexity profile and the jump complexity of keystream sequences, Advances in Cryptology - EUROCRYPT '90 (I.B. Damgård, ed.), Lecture Notes in Computer Science, Vol. 473, pp. 174-188, Springer-Verlag, Berlin, 1991.

  140. The distribution of values of Kloosterman sums, Archiv der Math. 56, 270-277 (1991).

  141. (with J. Eichenauer-Herrmann), On the discrepancy of quadratic congruential pseudorandom numbers, J. Comput. Appl. Math. 34, 243-249 (1991).

  142. Finite fields and their applications, Contributions to General Algebra 7 (Proc. Vienna Conf., 1990), pp. 251-264, B.G. Teubner, Stuttgart, 1991.

  143. Recent trends in random number and random vector generation, Ann. Operations Research 31, 323-345 (1991).

  144. (with A. Schinzel and L. Somer), Maximal frequencies of elements in second-order linear recurring sequences over a finite field, Elemente der Math. 46, 139-143 (1991).

  145. A combinatorial problem for vector spaces over finite fields, Discrete Math. 96, 221 -228 (1991).

  146. The existence of efficient lattice rules for multidimensional numerical integration, Math. Comp. 58, 305-314, S7-S16 (1992).

  147. Nonlinear methods for pseudorandom number and vector generation, Simulation and Optimization (G. Pflug and U. Dieter, eds.), Lecture Notes in Economics and Math. Systems, Vol. 374, pp. 145-153, Springer-Verlag, Berlin, 1992.

  148. (with J. Eichenauer-Herrmann), Lower bounds for the discrepancy of inversive congruential pseudorandom numbers with power of two modulus, Math. Comp. 58, 775-779 (1992).

  149. Low-discrepancy point sets obtained by digital constructions over finite fields, Czechoslovak Math. J. 42, 143-166 (1992).

  150. Quasirandom sampling in computer graphics, Proc. Third Internat. Seminar on Digital Image Processing in Medicine, Remote Sensing and Visualization of Information (Riga, 1992), pp. 29-34, Latvian Academy of Sciences, Riga, 1992.

  151. Lattice rules for multiple integration, Stochastic Optimization: Numerical Methods and Technical Applications (K. Marti, ed.), Lecture Notes in Economics and Math. Systems, Vol. 379, pp. 15-26, Springer-Verlag, Berlin, 1992.

  152. Existence theorems for efficient lattice rules, Numerical Integration: Recent Developments, Software and Applications (T.O. Espelid and A. Genz, eds.), pp. 71-80, Kluwer Academic Publ., Dordrecht, 1992.

  153. Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes, Discrete Math. 106/107, 361-367 (1992).

  154. Constructions of low-discrepancy point sets and sequences, Sets, Graphs and Numbers (Budapest, 1991), Colloquia Math. Soc. János Bolyai, Vol. 60, pp. 529-559, North-Holland Publ. Co., Amsterdam, 1992.

  155. (with M. Flahive), On inversive congruential generators for pseudorandom numbers, Finite Fields, Coding Theory, and Advances in Communications and Computing (G.L. Mullen and P.J.-S. Shiue, eds.), pp. 75-80, Dekker, New York, 1992.

  156. Recent advances in the theory of finite fields, Finite Fields, Coding Theory, and Advances in Communications and Computing (G.L. Mullen and P.J.-S. Shiue, eds.), pp. 153-163, Dekker, New York, 1992.

  157. Finite fields and cryptology, Finite Fields, Coding Theory, and Advances in Communications and Computing (G.L. Mullen and P.J.-S. Shiue, eds.), pp. 359-373, Dekker, New York, 1992.

  158. Finite fields, pseudorandom numbers, and quasirandom points, Finite Fields, Coding Theory, and Advances in Communications and Computing (G.L. Mullen and P.J.-S. Shiue, eds.), pp. 375-394, Dekker, New York, 1992.

  159. (with R.J. Evans and J. Greene), Linearized polynomials and permutation polynomials of finite fields, Michigan Math. J. 39, 405-413 (1992).

  160. New methods for pseudorandom number and pseudorandom vector generation, Proc. 1992 Winter Simulation Conference (Arlington, VA, 1992), pp. 264-269, IEEE Press, Piscataway, NJ, 1992.

  161. (with P. Bratley and B.L. Fox), Implementation and tests of low-discrepancy sequences, ACM Trans. on Modeling and Computer Simulation 2, 195-213 (1992).

  162. Proof of Williams' conjecture on experimental designs balanced for pairs of interacting residual effects, European J. Combinatorics 14, 55-58 (1993).

  163. (with C.P. Schnorr), Local randomness in candidate one-way functions, Advances in Cryptology - EUROCRYPT '92 (R.A. Rueppel, ed.), Lecture Notes in Computer Science, Vol. 658, pp. 408-419, Springer-Verlag, Berlin, 1993.

  164. A new efficient factorization algorithm for polynomials over small finite fields, Applicable Algebra Engrg. Comm. Comput. 4, 81-87 (1993).

  165. (with C.P. Schnorr), Local randomness in polynomial random number and random function generators, SIAM J. on Computing 22, 684-694 (1993).

  166. Pseudorandom numbers and quasirandom points, Z. angew. Math. Mech. 73, T648-T652 (1993).

  167. Improved error bounds for lattice rules, J. Complexity 9, 60-75 (1993).

  168. (with G. Larcher), A lower bound for the dispersion of multidimensional sequences, Analytic Number Theory and Related Topics (K. Nagasaka, ed.), pp. 81-85, World Scientific Publishing, Singapore, 1993.

  169. (with T. Hansen and G.L. Mullen), Good parameters for a class of node sets in quasi-Monte Carlo integration, Math. Comp. 61, 225-234 (1993).

  170. Affine polynomials and permutation polynomials over finite fields, Grazer Math. Berichte 318, 99-104 (1993).

  171. (with G. Larcher), Kronecker-type sequences and nonarchimedean diophantine approximations, Acta Arith. 63, 379-396 (1993).

  172. Factorization of polynomials and some linear-algebra problems over finite fields, Linear Algebra and Its Appl. 192, 301-328 (1993).

  173. (with I.H. Sloan), Quasi-Monte Carlo methods with modified vertex weights, Numerical Integration IV (H. Braß and G. Hämmerlin, eds.), International Series of Numerical Mathematics, Vol. 112, pp. 253-265, Birkhäuser, Basel, 1993.

  174. (with J. Eichenauer-Herrmann), Kloosterman-type sums and the discrepancy of nonoverlapping pairs of inversive congruential pseudorandom numbers, Acta Arith. 65, 185-194 (1993).

  175. (with R. Göttfert), Factorization of polynomials over finite fields and characteristic sequences, J. Symbolic Computation 16, 401-412 (1993).

  176. (with K.H. Robinson), On isomorphisms and isotopisms of Bol loops of order $3p$, Comm. in Algebra 22, 345-347 (1994).

  177. Factoring polynomials over finite fields using differential equations and normal bases, Math. Comp. 62, 819-830 (1994).

  178. (with R. Göttfert), On the linear complexity of products of shift-register sequences, Advances in Cryptology - EUROCRYPT '93 (T. Helleseth, ed.), Lecture Notes in Computer Science, Vol. 765, pp. 151-158, Springer-Verlag, Berlin, 1994.

  179. (with I.H. Sloan), Integration of nonperiodic functions of two variables by Fibonacci lattice rules, J. Comput. Appl. Math. 51, 57-70 (1994).

  180. (with J. Eichenauer-Herrmann), On the statistical independence of nonlinear congruential pseudorandom numbers, ACM Trans. on Modeling and Computer Simulation 4, 89-95 (1994).

  181. (with J. Eichenauer-Herrmann), Bounds for exponential sums and their applications to pseudorandom numbers, Acta Arith. 67, 269-281 (1994).

  182. Pseudorandom vector generation by the inversive method, ACM Trans. on Modeling and Computer Simulation 4, 191-212 (1994).

  183. (with R. Göttfert), Hasse-Teichmüller derivatives and products of linear recurring sequences, Finite Fields: Theory, Applications, and Algorithms (G.L. Mullen and P.J.-S. Shiue, eds.), Contemporary Math., Vol. 168, pp. 117-125, American Math. Society, Providence, RI, 1994.

  184. New deterministic factorization algorithms for polynomials over finite fields, Finite Fields: Theory, Applications, and Algorithms (G.L. Mullen and P.J.-S. Shiue, eds.), Contemporary Math., Vol. 168, pp. 251-268, American Math. Society, Providence, RI, 1994.

  185. (with P. Bratley and B.L. Fox), Algorithm 738: Programs to generate Niederreiter's low-discrepancy sequences, ACM Trans. on Math. Software 20, 494-495 (1994).

  186. (with J. Eichenauer-Herrmann), Digital inversive pseudorandom numbers, ACM Trans. on Modeling and Computer Simulation 4, 339-349 (1994).

  187. On a new class of pseudorandom numbers for simulation methods, J. Comput. Appl. Math. 56, 159-167 (1994).

  188. The multiple-recursive matrix method for pseudorandom number generation, Finite Fields and Their Appl. 1, 3-30 (1995).

  189. (with J. Eichenauer-Herrmann), An improved upper bound for the discrepancy of quadratic congruential pseudorandom numbers, Acta Arith. 69, 193-198 (1995).

  190. Pseudorandom vector generation by the multiple-recursive matrix method, Math. Comp. 64, 279-294 (1995).

  191. (with R. Göttfert), On a new factorization algorithm for polynomials over finite fields, Math. Comp. 64, 347-353 (1995).

  192. (with R. Göttfert), On the minimal polynomial of the product of linear recurring sequences, Finite Fields and Their Appl. 1, 204-218 (1995).

  193. Low-discrepancy sequences and nonarchimedean diophantine approximations, Studia Sci. Math. Hungarica 30, 111-122 (1995).

  194. (with R. Göttfert), A general lower bound for the linear complexity of the product of shift-register sequences, Advances in Cryptology - EUROCRYPT '94 (A. De Santis, ed.), Lecture Notes in Computer Science, Vol. 950, pp. 223-229, Springer-Verlag, Berlin, 1995.

  195. (with G. Larcher), Generalized $(t,s)$-sequences, Kronecker-type sequences, and diophantine approximations of formal Laurent series, Trans. Amer. Math. Soc. 347, 2051-2073 (1995).

  196. (with G.L. Mullen and A. Mahalanabis), Tables of $(t,m,s)$-net and $(t,s)$-sequence parameters, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (H. Niederreiter and P.J.-S. Shiue, eds.), Lecture Notes in Statistics, Vol. 106, pp. 58-86, Springer-Verlag, New York, 1995.

  197. New developments in uniform pseudorandom number and vector generation, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (H. Niederreiter and P.J.-S. Shiue, eds.), Lecture Notes in Statistics, Vol. 106, pp. 87-120, Springer-Verlag, New York, 1995.

  198. (with W.-S. Chou), On the lattice test for inversive congruential pseudorandom numbers, Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing (H. Niederreiter and P.J.-S. Shiue, eds.), Lecture Notes in Statistics, Vol. 106, pp. 186-197, Springer-Verlag, New York, 1995.

  199. (with C.P. Xing), Low-discrepancy sequences obtained from algebraic function fields over finite fields, Acta Arith. 72, 281-298 (1995).

  200. (with M. Vielhaber), On the fractal nature of the set of all binary sequences with almost perfect linear complexity profile, Communications and Multimedia Security (R. Posch, ed.), pp. 214-221, Chapman & Hall, London, 1995.

  201. (with C.P. Xing), A construction of low-discrepancy sequences using global function fields, Acta Arith. 73, 87-102 (1995).

  202. Some linear and nonlinear methods for pseudorandom number generation, Proc. 1995 Winter Simulation Conference (Arlington, VA, 1995), pp. 250-254, IEEE Press, Piscataway, NJ, 1995.

  203. (with R. Lidl), Finite fields and their applications, Handbook of Algebra (M. Hazewinkel, ed.), Vol. 1, pp. 321-363, North-Holland, Amsterdam, 1996.

  204. (with I.H. Sloan), Variants of the Koksma-Hlawka inequality for vertex-modified quasi-Monte Carlo integration rules, Math. and Computer Modelling 23, no. 8/9, 69-77 (1996).

  205. (with G. Larcher and W.C. Schmid), Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration, Monatsh. Math. 121, 231-253 (1996).

  206. (with C.P. Xing), Explicit global function fields over the binary field with many rational places, Acta Arith. 75, 383-396 (1996).

  207. (with C.P. Xing), Modules de Drinfeld et courbes algébriques ayant beaucoup de points rationnels, C.R. Acad. Sci. Paris Sér. I Math. 322, 651-654 (1996).

  208. Improved bounds in the multiple-recursive matrix method for pseudorandom number and vector generation, Finite Fields and Their Appl. 2, 225-240 (1996).

  209. (with C.P. Xing), Low-discrepancy sequences and global function fields with many rational places, Finite Fields and Their Appl. 2, 241-273 (1996).

  210. (with C.P. Xing), Quasirandom points and global function fields, Finite Fields and Applications (S. Cohen and H. Niederreiter, eds.), London Math. Society Lecture Note Series, Vol. 233, pp. 269-296, Cambridge Univ. Press, Cambridge, 1996. (Featured review in Math. Reviews 97j:11037)

  211. (with M. Vielhaber), Tree complexity and a doubly exponential gap between structured and random sequences, J. Complexity 12, 187-198 (1996).

  212. (with G. Larcher, A. Lauß, and W.C. Schmid), Optimal polynomials for $(t,m,s)$-nets and numerical integration of multivariate Walsh series, SIAM J. Numer. Analysis 33, 2239-2253 (1996).

  213. (with C.P. Xing), Cyclotomic function fields, Hilbert class fields, and global function fields with many rational places, Acta Arith. 79, 59-76 (1997).

  214. (with C.P. Xing), Drinfeld modules of rank 1 and algebraic curves with many rational points. II, Acta Arith. 81, 81-100 (1997).

  215. (with J. Eichenauer-Herrmann), Parallel streams of nonlinear congruential pseudorandom numbers, Finite Fields and Their Appl. 3, 219-233 (1997).

  216. (with M. Vielhaber), Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles, J. Complexity 13, 353-383 (1997).

  217. (with J. Eichenauer-Herrmann), Inversive congruential pseudorandom numbers: distribution of triples, Math. Comp. 66, 1629-1644 (1997).

  218. (with C.P. Xing), Global function fields with many rational places over the quinary field, Demonstratio Math. 30, 919-930 (1997).

  219. (with C.P. Xing), The algebraic-geometry approach to low-discrepancy sequences, Monte Carlo and Quasi-Monte Carlo Methods 1996 (H. Niederreiter et al., eds.), Lecture Notes in Statistics, Vol. 127, pp. 139-160, Springer-Verlag, New York, 1998.

  220. (with C.P. Xing), Global function fields with many rational places over the ternary field, Acta Arith. 83, 65-86 (1998).

  221. (with J. Eichenauer-Herrmann), Lower bounds for the discrepancy of triples of inversive congruential pseudorandom numbers with power of two modulus, Monatsh. Math. 125, 211-217 (1998).

  222. (with C.P. Xing), Algebraic curves over finite fields with many rational points, Number Theory: Diophantine, Computational and Algebraic Aspects (K. Györy, A. Pethö, and V.T. Sós, eds.), pp. 423-443, W. de Gruyter, Berlin, 1998.

  223. (with P. Hellekalek), The weighted spectral test: diaphony, ACM Trans. on Modeling and Computer Simulation 8, 43-60 (1998).

  224. (with C.P. Xing), A general method of constructing global function fields with many rational places, Algorithmic Number Theory (J.P. Buhler, ed.), Lecture Notes in Computer Science, Vol. 1423, pp. 555-566, Springer-Verlag, Berlin, 1998.

  225. Nets, $(t,s)$-sequences, and algebraic curves over finite fields with many rational points, Proc. International Congress of Mathematicians (Berlin, 1998), Documenta Math. Extra Volume ICM III, 377-386 (1998).

  226. (with M. Vielhaber), Simultaneous shifted continued fraction expansions in quadratic time, Applicable Algebra Engrg. Comm. Comput. 9, 125-138 (1998).

  227. (with C.P. Xing), Towers of global function fields with asymptotically many rational places and an improvement on the Gilbert-Varshamov bound, Math. Nachrichten 195, 171-186 (1998).

  228. (with C.P. Xing), Global function fields with many rational places over the quinary field. II, Acta Arith. 86, 277-288 (1998).

  229. (with C.P. Xing), Nets, $(t,s)$-sequences, and algebraic geometry, Random and Quasi-Random Point Sets (P. Hellekalek and G. Larcher, eds.), Lecture Notes in Statistics, Vol. 138, pp. 267-302, Springer-Verlag, New York, 1998.

  230. (with C.P. Xing), Global function fields with many rational places and their applications, Finite Fields: Theory, Applications, and Algorithms (R.C. Mullin and G.L. Mullen, eds.), Contemporary Math., Vol. 225, pp. 87-111, American Math. Society, Providence, RI, 1999.

  231. (with C.P. Xing), Drinfeld modules of rank 1 and algebraic curves with many rational points, Monatsh. Math. 127, 219-241 (1999).

  232. (with C.P. Xing), Algebraic curves with many rational points over finite fields of characteristic 2, Number Theory in Progress (K. Györy, H. Iwaniec, and J. Urbanowicz, eds.), pp. 359-380, W. de Gruyter, Berlin, 1999.

  233. (with C.P. Xing and K.Y. Lam), Constructions of algebraic-geometry codes, IEEE Trans. Information Theory 45, 1186-1193 (1999).

  234. (with C.P. Xing and K.Y. Lam), A new construction of algebraic-geometry codes, Applicable Algebra Engrg. Comm. Comput. 9, 373-381 (1999).

  235. (with A.T. Clayman, K.M. Lawrence, G.L. Mullen, and N.J.A. Sloane), Updated tables of parameters of $(t,m,s)$-nets, J. Combinatorial Designs 7, 381-393 (1999).

  236. Some computable complexity measures for binary sequences, Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 67-78, Springer-Verlag, London, 1999.

  237. (with H. Paschinger), Counting functions and expected values in the stability theory of stream ciphers, Sequences and Their Applications (C. Ding, T. Helleseth, and H. Niederreiter, eds.), pp. 318-329, Springer-Verlag, London, 1999.

  238. (with C.P. Xing), A counterexample to Perret's conjecture on infinite class field towers for global function fields, Finite Fields and Their Appl. 5, 240-245 (1999).

  239. (with I.E. Shparlinski), On the distribution and lattice structure of nonlinear congruential pseudorandom numbers, Finite Fields and Their Appl. 5, 246-253 (1999).

  240. (with C.P. Xing, K.Y. Lam, and C.S. Ding), Constructions of sequences with almost perfect linear complexity profile from curves over finite fields, Finite Fields and Their Appl. 5, 301-313 (1999).

  241. (with M. Vielhaber), An algorithm for shifted continued fraction expansions in parallel linear time, Theoretical Computer Science 226, 93-104 (1999).

  242. (with C.P. Xing and K.Y. Lam), A generalization of algebraic-geometry codes, IEEE Trans. Information Theory 45, 2498-2501 (1999).

  243. (with F. Griffin and I.E. Shparlinski), On the distribution of nonlinear recursive congruential pseudorandom numbers of higher orders, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (M. Fossorier, H. Imai, S. Lin, and A. Poli, eds.), Lecture Notes in Computer Science, Vol. 1719, pp. 87-93, Springer-Verlag, Berlin, 1999.

  244. (with C.P. Xing), Curve sequences with asymptotically many rational points, Applications of Curves over Finite Fields (M.D. Fried, ed.), Contemporary Math., Vol. 245, pp. 3-14, American Math. Society, Providence, RI, 1999.

  245. Constructions of $(t,m,s)$-nets, Monte Carlo and Quasi-Monte Carlo Methods 1998 (H. Niederreiter and J. Spanier, eds.), pp. 70-85, Springer-Verlag, Berlin, 2000.

  246. (with J. Gutierrez and I.E. Shparlinski), On the multidimensional distribution of inversive congruential pseudorandom numbers in parts of the period, Monatsh. Math. 129, 31-36 (2000).

  247. (with I.E. Shparlinski), Exponential sums and the distribution of inversive congruential pseudorandom numbers with prime-power modulus, Acta Arith. 92, 89-98 (2000).

  248. (with I.E. Shparlinski), On the distribution of pseudorandom numbers and vectors generated by inversive methods, Applicable Algebra Engrg. Comm. Comput. 10, 189-202 (2000).

  249. (with C.P. Xing), Algebraic curves over finite fields with many rational points and their applications, Number Theory (R.P. Bambah, V.C. Dumir, and R.J. Hans-Gill, eds.), pp. 287-300, Birkhäuser, Basel, 2000.

  250. (with A. Winterhof), Incomplete exponential sums over finite fields and their applications to new inversive pseudorandom number generators, Acta Arith. 93, 387-399 (2000).

  251. (with C.P. Xing), A propagation rule for linear codes, Applicable Algebra Engrg. Comm. Comput. 10, 425-432 (2000).

  252. (with N. Sookoo), Partial densities on the group of integers, Archivum Math. (Brno) 36, 17-24 (2000).

  253. (with C.S. Ding and C.P. Xing), Some new codes from algebraic curves, IEEE Trans. Information Theory 46, 2638-2642 (2000).

  254. (with S. Ling and C.P. Xing), Symmetric polynomials and some good codes, Finite Fields and Their Appl. 7, 142-148 (2001).

  255. (with G. Pirsic), Duality for digital nets and its applications, Acta Arith. 97, 173-182 (2001).

  256. Design and analysis of nonlinear pseudorandom number generators, Monte Carlo Simulation (G.I. Schuëller and P.D. Spanos, eds.), pp. 3-9, A.A. Balkema Publ., Rotterdam, 2001.

  257. (with C.P. Xing), Applications of algebraic curves to constructions of codes and almost perfect sequences, Finite Fields and Applications (D. Jungnickel and H. Niederreiter, eds.), pp. 475-489, Springer-Verlag, Berlin, 2001.

  258. (with I.E. Shparlinski), On the distribution of inversive congruential pseudorandom numbers in parts of the period, Math. Comp. 70, 1569-1574 (2001).

  259. (with S.D. Cohen, I.E. Shparlinski, and M. Zieve), Incomplete character sums and a special class of permutations, J. Théorie des Nombres Bordeaux 13, 53-63 (2001).

  260. (with A. Winterhof), On the lattice structure of pseudorandom numbers generated over arbitrary finite fields, Applicable Algebra Engrg. Comm. Comput. 12, 265-272 (2001).

  261. (with A. Winterhof), On a new class of inversive pseudorandom numbers for parallelized simulation methods, Periodica Math. Hungarica 42, 77-87 (2001).

  262. (with A. Winterhof), On the distribution of compound inversive congruential pseudorandom numbers, Monatsh. Math. 132, 35-48 (2001).

  263. Error-correcting codes and cryptography, Public-Key Cryptography and Computational Number Theory (K. Alster, J. Urbanowicz, and H.C. Williams, eds.), pp. 209-219, W. de Gruyter, Berlin, 2001.

  264. (with G. Pirsic), The microstructure of $(t,m,s)$-nets, J. Complexity 17, 683-696 (2001).

  265. (with I.E. Shparlinski), Recent advances in the theory of nonlinear pseudorandom number generators, Monte Carlo and Quasi-Monte Carlo Methods 2000 (K.-T. Fang, F.J. Hickernell, and H. Niederreiter, eds.), pp. 86-102, Springer-Verlag, Berlin, 2002.

  266. (with G. Pirsic), A Kronecker product construction for digital nets, Monte Carlo and Quasi-Monte Carlo Methods 2000 (K.-T. Fang, F.J. Hickernell, and H. Niederreiter, eds.), pp. 396-405, Springer-Verlag, Berlin, 2002.

  267. (with W. Meidl), Linear complexity, $k$-error linear complexity, and the discrete Fourier transform, J. Complexity 18, 87-103 (2002).

  268. (with W. Meidl), Counting functions and expected values for the $k$-error linear complexity, Finite Fields and Their Appl. 8, 142-154 (2002).

  269. (with A. Winterhof), Incomplete character sums and polynomial interpolation of the discrete logarithm, Finite Fields and Their Appl. 8, 184-192 (2002).

  270. (with C.P. Xing), Constructions of digital nets, Acta Arith. 102, 189-197 (2002).

  271. (with N. Sookoo), Partial densities on locally compact abelian groups and uniformly distributed sequences, Monatsh. Math. 136, 243-247 (2002).

  272. (with C.S. Ding, T. Helleseth, and C.P. Xing), The minimum distance of the duals of binary irreducible cyclic codes, IEEE Trans. Information Theory 48, 2679-2689 (2002).

  273. Finite fields, The Concise Handbook of Algebra (A.V. Mikhalev and G.F. Pilz, eds.), pp. 359-361, Kluwer Academic Publ., Dordrecht, 2002.

  274. (with W. Meidl), On the expected value of the linear complexity and the $k$-error linear complexity of periodic sequences, IEEE Trans. Information Theory 48, 2817-2825 (2002).

  275. (with F. Özbudak), Constructions of digital nets using global function fields, Acta Arith. 105, 279-302 (2002).

  276. (with I.E. Shparlinski), On the average distribution of inversive pseudorandom numbers, Finite Fields and Their Appl. 8, 491-503 (2002).

  277. (with W.-S. Chou), Monomials and binomials over finite fields as ${\cal R}$-orthomorphisms, Publicationes Math. Debrecen 61, 511-521 (2002).

  278. Algebraic function fields over finite fields, Coding Theory and Cryptology (H. Niederreiter, ed.), pp. 259-282, Singapore University Press and World Scientific Publishing, Singapore, 2002.

  279. (with A. Winterhof), Lattice structure and linear complexity of nonlinear pseudorandom numbers, Applicable Algebra Engrg. Comm. Comput. 13, 319-326 (2002).

  280. Error bounds for quasi-Monte Carlo integration with uniform point sets, J. Comput. Appl. Math. 150, 283-292 (2003).

  281. (with W. Meidl), The expected value of the joint linear complexity of periodic multisequences, J. Complexity 19, 61-72 (2003).

  282. Periodic sequences with large $k$-error linear complexity, IEEE Trans. Information Theory 49, 501-505 (2003).

  283. (with F.J. Hickernell), The existence of good extensible rank-1 lattices, J. Complexity 19, 286-300 (2003).

  284. Some current issues in quasi-Monte Carlo methods, J. Complexity 19, 428-433 (2003).

  285. (with I.E. Shparlinski), Dynamical systems generated by rational functions, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (M. Fossorier, T. Høholdt, and A. Poli, eds.), Lecture Notes in Computer Science, Vol. 2643, pp. 6-17, Springer-Verlag, Berlin, 2003.

  286. (with I.E. Shparlinski), On the distribution of power residues and primitive elements in some nonlinear recurring sequences, Bull. London Math. Soc. 35, 522-528 (2003).

  287. The existence of good extensible polynomial lattice rules, Monatsh. Math. 139, 295-307 (2003).

  288. (with A. Winterhof), On the distribution of points in orbits of $PGL(2,q)$ acting on $GF(q^n)$, Finite Fields and Their Appl. 9, 458-471 (2003).


 2003-10-23