2008 |
22 | EE | Yuki Ohtsuka,
Makoto Matsumoto,
Mariko Hagita:
Projective de Bruijn Sequences.
SETA 2008: 167-174 |
21 | EE | Hiroshi Haramoto,
Makoto Matsumoto,
Pierre L'Ecuyer:
A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space.
SETA 2008: 290-298 |
20 | EE | Hiroshi Haramoto,
Makoto Matsumoto,
Takuji Nishimura,
François Panneton,
Pierre L'Ecuyer:
Efficient Jump Ahead for 2-Linear Random Number Generators.
INFORMS Journal on Computing 20(3): 385-390 (2008) |
2007 |
19 | EE | Makoto Matsumoto,
Mutsuo Saito,
Takuji Nishimura,
Mariko Hagita:
A Fast Stream Cipher with Huge State Space and Quasigroup Filter for Software.
Selected Areas in Cryptography 2007: 246-263 |
18 | EE | Makoto Matsumoto,
Isaku Wada,
Ai Kuramoto,
Hyo Ashihara:
Common defects in initialization of pseudorandom number generators.
ACM Trans. Model. Comput. Simul. 17(4): (2007) |
2006 |
17 | | Hyo Ashihara,
Ai Kuramoto,
Isaku Wada,
Makoto Matsumoto,
Hironori Kikuchi,
Masato Kiyama:
Parallel Computations Reveal Hidden Errors of Commonly Used Random Number Generators.
CSC 2006: 85-90 |
16 | EE | François Panneton,
Pierre L'Ecuyer,
Makoto Matsumoto:
Improved long-period generators based on linear recurrences modulo 2.
ACM Trans. Math. Softw. 32(1): 1-16 (2006) |
15 | EE | Makoto Matsumoto,
Mutsuo Saito,
Hiroshi Haramoto,
Takuji Nishimura:
Pseudorandom Number Generation: Impossibility and Compromise.
J. UCS 12(6): 672-690 (2006) |
2003 |
14 | EE | Makoto Matsumoto,
Takuji Nishimura:
Sum-discrepancy test on pseudorandom number generators.
Mathematics and Computers in Simulation 62(3-6): 431-442 (2003) |
2000 |
13 | | Toshihiro Kumada,
Hannes Leeb,
Yoshiharu Kurita,
Makoto Matsumoto:
New primitive t-nomials (t = 3, 5) over GF(2) whose degree is a Mersenne exponent.
Math. Comput. 69(230): 811-814 (2000) |
1999 |
12 | | Makoto Matsumoto,
Takuji Nishimura:
The Dynamic Creation of Distributed Random Number Generators.
PPSC 1999 |
11 | EE | Stefan Wegenkittl,
Makoto Matsumoto:
Getting rid of correlations among pseudorandom numbers: discarding versus tempering.
ACM Trans. Model. Comput. Simul. 9(3): 282-294 (1999) |
1998 |
10 | EE | Makoto Matsumoto,
Takuji Nishimura:
Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator.
ACM Trans. Model. Comput. Simul. 8(1): 3-30 (1998) |
9 | EE | Makoto Matsumoto:
Simple Cellular Automata as Pseudo-Random m-Sequence Generators for Built-In Self-Test.
ACM Trans. Model. Comput. Simul. 8(1): 31-42 (1998) |
8 | EE | Hiroshi Maehara,
Makoto Matsumoto:
Is There a Circle that Passes Through a Given Number of Lattice Points?
Eur. J. Comb. 19(5): 591-592 (1998) |
7 | EE | Hikoe Enomoto,
Mariko Hagita,
Makoto Matsumoto:
A Note on Difference Sets.
J. Comb. Theory, Ser. A 84(2): 133-144 (1998) |
1996 |
6 | | Makoto Matsumoto,
Yoshiharu Kurita:
Strong Deviations from Randomness in m-Sequences Based on Trinomials.
ACM Trans. Model. Comput. Simul. 6(2): 99-106 (1996) |
1995 |
5 | | Peter Frankl,
Makoto Matsumoto,
Imre Z. Ruzsa,
Norihide Tokushige:
Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function.
J. Comb. Theory, Ser. A 69(1): 125-148 (1995) |
1994 |
4 | EE | Makoto Matsumoto,
Yoshiharu Kurita:
Twisted GFSR Generators II.
ACM Trans. Model. Comput. Simul. 4(3): 254-266 (1994) |
1992 |
3 | EE | Makoto Matsumoto,
Yoshiharu Kurita:
Twisted GFSR Generators.
ACM Trans. Model. Comput. Simul. 2(3): 179-194 (1992) |
1991 |
2 | | Yoshimi Egawa,
Atsushi Kaneko,
Makoto Matsumoto:
A mixed version of Menger's theorem.
Combinatorica 11(1): 71-74 (1991) |
1989 |
1 | EE | Makoto Matsumoto,
Norihide Tokushige:
The exact bound in the Erd$ouml;s-Ko-Rado theorem for cross-intersecting families.
J. Comb. Theory, Ser. A 52(1): 90-97 (1989) |