default search action
Makoto Matsumoto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j36]Makoto Matsumoto, Kento Ogawa:
Wreath Products and Projective System of non-Schurian Association Schemes. Electron. J. Comb. 31(1) (2024) - [j35]Takashi Goda
, Kosuke Suzuki
A Universal Median Quasi-Monte Carlo Integration. SIAM J. Numer. Anal. 62(1): 533-566 (2024) - 2022
- [j34]Hiroshi Haramoto
Unveiling patterns in xorshift128+ pseudorandom number generators. J. Comput. Appl. Math. 402: 113791 (2022) - 2021
- [j33]Hiroki Kajiura, Makoto Matsumoto
Non-existence and Construction of Pre-difference Sets, and Equi-Distributed Subsets in Association Schemes. Graphs Comb. 37(5): 1531-1544 (2021) - [c7]Shota Murai
Toward human-centered visual design based on sound symbolic information. LifeTech 2021: 71-74 - 2020
- [i4]Mutsuo Saito, Makoto Matsumoto, Vincent Roca, Emmanuel Baccelli:
TinyMT32 Pseudorandom Number Generator (PRNG). RFC 8682: 1-12 (2020)
2010 – 2019
- 2019
- [j32]Hiroshi Haramoto
Checking the quality of approximation of p-values in statistical tests for random number generators by using a three-level test. Math. Comput. Simul. 161: 66-75 (2019) - [i3]Hiroshi Haramoto, Makoto Matsumoto, Mutsuo Saito:
Pseudo random number generators: attention for a newly proposed generator. CoRR abs/1907.03251 (2019) - [i2]Hiroshi Haramoto, Makoto Matsumoto:
Again, random numbers fall mainly in the planes: xorshift128+ generators. CoRR abs/1908.10020 (2019) - 2018
- [j31]Hiroki Kajiura, Makoto Matsumoto, Kosuke Suzuki
Characterization of matrices B such that (I, B, B2) generates a digital net with t-value zero. Finite Fields Their Appl. 52: 289-300 (2018) - [j30]Makoto Matsumoto, Ryuichi Ohori, Takehito Yoshiki
Approximation of Quasi-Monte Carlo worst case error in weighted spaces of infinitely times smooth functions. J. Comput. Appl. Math. 330: 155-164 (2018) - 2014
- [j29]Makoto Matsumoto, Mutsuo Saito, Kyle Matoba:
A computable figure of merit for quasi-Monte Carlo point sets. Math. Comput. 83(287): 1233-1250 (2014) - [c6]Makoto Matsumoto, Ryuichi Ohori:
Walsh Figure of Merit for Digital Nets: An Easy Measure for Higher Order Convergent QMC. MCQMC 2014: 143-160 - 2013
- [j28]Josef Dick
On the Fast Computation of the Weight Enumerator Polynomial and the t Value of Digital Nets over Finite Abelian Groups. SIAM J. Discret. Math. 27(3): 1335-1359 (2013) - [j27]Mutsuo Saito, Makoto Matsumoto:
Variants of Mersenne Twister Suitable for Graphic Processors. ACM Trans. Math. Softw. 39(2): 12:1-12:20 (2013) - 2011
- [j26]Toshimori Atsushi, Chieko Mizoue, Makoto Matsumoto:
Curriculum reform in library and information science education by evidence-based decision making. Educ. Inf. 28(2-4): 305-314 (2011) - [j25]Shin Harase
Fast lattice reduction for F2-linear pseudorandom number generators. Math. Comput. 80(273): 395-407 (2011)
2000 – 2009
- 2008
- [j24]Mariko Hagita, Makoto Matsumoto, Fumio Natsu, Yuki Ohtsuka:
Error Correcting Sequence and Projective De Bruijn Graph. Graphs Comb. 24(3): 185-194 (2008) - [j23]Hiroshi Haramoto
Efficient Jump Ahead for 2-Linear Random Number Generators. INFORMS J. Comput. 20(3): 385-390 (2008) - [c5]Yuki Ohtsuka, Makoto Matsumoto, Mariko Hagita:
Projective de Bruijn Sequences. SETA 2008: 167-174 - [c4]Hiroshi Haramoto
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
- [j22]Makoto Matsumoto, Isaku Wada, Ai Kuramoto, Hyo Ashihara:
Common defects in initialization of pseudorandom number generators. ACM Trans. Model. Comput. Simul. 17(4): 15 (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
- [j21]Makoto Matsumoto, Mutsuo Saito, Hiroshi Haramoto, Takuji Nishimura:
Pseudorandom Number Generation: Impossibility and Compromise. J. Univers. Comput. Sci. 12(6): 672-690 (2006) - [j20]François Panneton, Pierre L'Ecuyer
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 Cryptol. ePrint Arch. 2005: 165 (2005) - 2003
- [j19]Makoto Matsumoto, Takuji Nishimura:
Sum-discrepancy test on pseudorandom number generators. Math. Comput. Simul. 62(3-6): 431-442 (2003) - 2000
- [j18]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)
1990 – 1999
- 1999
- [j17]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. PP 1999 - 1998
- [j16]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) - [j15]Hikoe Enomoto, Mariko Hagita, Makoto Matsumoto:
A Note on Difference Sets. J. Comb. Theory A 84(2): 133-144 (1998) - [j14]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) - [j13]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
- [j12]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
- [j11]Peter Frankl, Makoto Matsumoto, Imre Z. Ruzsa, Norihide Tokushige:
Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function. J. Comb. Theory A 69(1): 125-148 (1995) - 1994
- [j10]Boliong Chen, Makoto Matsumoto, Jianfang Wang, Zhongfu Zhang, Jianxun Zhang:
A short proof of Nash-Williams' theorem for the arboricity of a graph. Graphs Comb. 10(1): 27-28 (1994) - [j9]Makoto Matsumoto, Yoshiharu Kurita:
Twisted GFSR Generators II. ACM Trans. Model. Comput. Simul. 4(3): 254-266 (1994) - 1992
- [j8]Makoto Matsumoto, Yoshiharu Kurita:
Twisted GFSR Generators. ACM Trans. Model. Comput. Simul. 2(3): 179-194 (1992) - 1991
- [j7]Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto:
A mixed version of Menger's theorem. Comb. 11(1): 71-74 (1991) - 1990
- [j6]Makoto Matsumoto:
Bounds for the vertex linear arboricity. J. Graph Theory 14(1): 117-126 (1990)
1980 – 1989
- 1989
- [j5]Shuichi Moritsugu, Makoto Matsumoto:
A note on the numerical evaluation of arctangent function. SIGSAM Bull. 23(3): 8-12 (1989) - [j4]Makoto Matsumoto, Norihide Tokushige
A generalization of the katona theorem for crosst-intersecting families. Graphs Comb. 5(1): 159-171 (1989) - [j3]Makoto Matsumoto, Norihide Tokushige
The exact bound in the Erdös-Ko-Rado theorem for cross-intersecting families. J. Comb. Theory A 52(1): 90-97 (1989) - [j2]Noriyuki Fukaya, Mitsuo Hirashima, Makoto Matsumoto, Shin Enami:
Noncontact Three-Dimensional Contour Instrumentation - Development of High-Speed Active Range Finder -. J. Robotics Mechatronics 1(4): 264-268 (1989) - 1988
- [j1]Masatosi Imori, Makoto Matsumoto, Hisao Yamada:
The line digraph of a regular and pancircular digraph is also regular and pancircular. Graphs Comb. 4(1): 235-239 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-04 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: