- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j24 |      | Mutsuo Saito, Makoto Matsumoto: Variants of Mersenne Twister Suitable for Graphic Processors. ACM Trans. Math. Softw. 39(2): 12 (2013) |
| 2011 | ||
| j23 | | Shin Harase, Makoto Matsumoto, Mutsuo Saito: Fast lattice reduction for F2-linear pseudorandom number generators. Math. Comput. 80(273): 395-407 (2011) |
| 2008 | ||
| j22 | | Mariko Hagita, Makoto Matsumoto, Fumio Natsu, Yuki Ohtsuka: Error Correcting Sequence and Projective De Bruijn Graph. Graphs and Combinatorics 24(3): 185-194 (2008) |
| j21 | | 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) |
| c5 | | |
| c4 | | Hiroshi Haramoto, Makoto Matsumoto, Pierre L'Ecuyer: A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space. SETA 2008: 290-298 |
| p1 | | Makoto Matsumoto, Mutsuo Saito, Takuji Nishimura, Mariko Hagita: CryptMT3 Stream Cipher. The eSTREAM Finalists 2008: 7-19 |
| 2007 | ||
| j20 | | Makoto Matsumoto, Isaku Wada, Ai Kuramoto, Hyo Ashihara: Common defects in initialization of pseudorandom number generators. ACM Trans. Model. Comput. Simul. 17(4) (2007) |
| c3 | | 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 |
| 2006 | ||
| j19 | | Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, Takuji Nishimura: Pseudorandom Number Generation: Impossibility and Compromise. J. UCS 12(6): 672-690 (2006) |
| j18 | | 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) |
| c2 |  | 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 |
| 2005 | ||
| i1 | | Makoto Matsumoto, Takuji Nishimura, Mariko Hagita, Mutsuo Saito: CRYPTOGRAPHIC MERSENNE TWISTER AND FUBUKI STREAM/BLOCK CIPHER. IACR Cryptology ePrint Archive 2005: 165 (2005) |
| 2003 | ||
| j17 | | Makoto Matsumoto, Takuji Nishimura: Sum-discrepancy test on pseudorandom number generators. Mathematics and Computers in Simulation 62(3-6): 431-442 (2003) |
| 2000 | ||
| j16 | | 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 | ||
| j15 | | Stefan Wegenkittl, Makoto Matsumoto: Getting rid of correlations among pseudorandom numbers: discarding versus tempering. ACM Trans. Model. Comput. Simul. 9(3): 282-294 (1999) |
| c1 | | Makoto Matsumoto, Takuji Nishimura: The Dynamic Creation of Distributed Random Number Generators. PPSC 1999 |
| 1998 | ||
| j14 | | 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) |
| j13 | | Hikoe Enomoto, Mariko Hagita, Makoto Matsumoto: A Note on Difference Sets. J. Comb. Theory, Ser. A 84(2): 133-144 (1998) |
| j12 | | 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) |
| j11 | | 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) |
| 1996 | ||
| j10 | | 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 | ||
| j9 | | 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 | ||
| j8 | | Boliong Chen, Makoto Matsumoto, Jianfang Wang, Zhongfu Zhang, Jianxun Zhang: A short proof of Nash-Williams' theorem for the arboricity of a graph. Graphs and Combinatorics 10(1): 27-28 (1994) |
| j7 | | Makoto Matsumoto, Yoshiharu Kurita: Twisted GFSR Generators II. ACM Trans. Model. Comput. Simul. 4(3): 254-266 (1994) |
| 1992 | ||
| j6 | | Makoto Matsumoto, Yoshiharu Kurita: Twisted GFSR Generators. ACM Trans. Model. Comput. Simul. 2(3): 179-194 (1992) |
| 1991 | ||
| j5 | | Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto: A mixed version of Menger's theorem. Combinatorica 11(1): 71-74 (1991) |
| 1990 | ||
| j4 | | Makoto Matsumoto: Bounds for the vertex linear arboricity. Journal of Graph Theory 14(1): 117-126 (1990) |
| 1989 | ||
| j3 | | Makoto Matsumoto, Norihide Tokushige: A generalization of the katona theorem for crosst-intersecting families. Graphs and Combinatorics 5(1): 159-171 (1989) |
| j2 | | 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) |
| 1988 | ||
| j1 | | Masatosi Imori, Makoto Matsumoto, Hisao Yamada: The line digraph of a regular and pancircular digraph is also regular and pancircular. Graphs and Combinatorics 4(1): 235-239 (1988) |
Colors in the list of coauthors
Last update Sun May 19 17:19:50 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page