Makoto Matsumoto

Orcid: 0000-0003-1914-7208

According to our database1, Makoto Matsumoto authored at least 48 papers between 1988 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
1
2
1
1
1
3
2
1
2
2
2
1
2
1
1
1
1
4
1
1
2
1
1
1
4
1
1
1
2
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Universal Median Quasi-Monte Carlo Integration.
SIAM J. Numer. Anal., February, 2024

Wreath Products and Projective System of non-Schurian Association Schemes.
Electron. J. Comb., 2024

2022
Unveiling patterns in xorshift128+ pseudorandom number generators.
J. Comput. Appl. Math., 2022

2021
Non-existence and Construction of Pre-difference Sets, and Equi-Distributed Subsets in Association Schemes.
Graphs Comb., 2021

Toward human-centered visual design based on sound symbolic information.
Proceedings of the 3rd IEEE Global Conference on Life Sciences and Technologies, 2021

2020
TinyMT32 Pseudorandom Number Generator (PRNG).
RFC, January, 2020

2019
Checking the quality of approximation of p-values in statistical tests for random number generators by using a three-level test.
Math. Comput. Simul., 2019

Again, random numbers fall mainly in the planes: xorshift128+ generators.
CoRR, 2019

Pseudo random number generators: attention for a newly proposed generator.
CoRR, 2019

2018
Approximation of Quasi-Monte Carlo worst case error in weighted spaces of infinitely times smooth functions.
J. Comput. Appl. Math., 2018

Characterization of matrices <i>B</i> such that (<i>I</i>, <i>B</i>, <i>B</i><sup>2</sup>) generates a digital net with <i>t</i>-value zero.
Finite Fields Their Appl., 2018

2014
A computable figure of merit for quasi-Monte Carlo point sets.
Math. Comput., 2014

Walsh Figure of Merit for Digital Nets: An Easy Measure for Higher Order Convergent QMC.
Proceedings of the Monte Carlo and Quasi-Monte Carlo Methods, 2014

2013
Variants of Mersenne Twister Suitable for Graphic Processors.
ACM Trans. Math. Softw., 2013

On the Fast Computation of the Weight Enumerator Polynomial and the t Value of Digital Nets over Finite Abelian Groups.
SIAM J. Discret. Math., 2013

2011
Fast lattice reduction for F<sub>2</sub>-linear pseudorandom number generators.
Math. Comput., 2011

Curriculum reform in library and information science education by evidence-based decision making.
Educ. Inf., 2011

2008
CryptMT3 Stream Cipher.
Proceedings of the New Stream Cipher Designs - The eSTREAM Finalists, 2008

Efficient Jump Ahead for 2-Linear Random Number Generators.
INFORMS J. Comput., 2008

Error Correcting Sequence and Projective De Bruijn Graph.
Graphs Comb., 2008

Projective de Bruijn Sequences.
Proceedings of the Sequences and Their Applications, 2008

A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space.
Proceedings of the Sequences and Their Applications, 2008

2007
Common defects in initialization of pseudorandom number generators.
ACM Trans. Model. Comput. Simul., 2007

A Fast Stream Cipher with Huge State Space and Quasigroup Filter for Software.
Proceedings of the Selected Areas in Cryptography, 14th International Workshop, 2007

2006
Improved long-period generators based on linear recurrences modulo 2.
ACM Trans. Math. Softw., 2006

Pseudorandom Number Generation: Impossibility and Compromise.
J. Univers. Comput. Sci., 2006

Parallel Computations Reveal Hidden Errors of Commonly Used Random Number Generators.
Proceedings of the 2006 International Conference on Scientific Computing, 2006

2005
CRYPTOGRAPHIC MERSENNE TWISTER AND FUBUKI STREAM/BLOCK CIPHER.
IACR Cryptol. ePrint Arch., 2005

2003
Sum-discrepancy test on pseudorandom number generators.
Math. Comput. Simul., 2003

2000
New primitive t-nomials (t = 3, 5) over GF(2) whose degree is a Mersenne exponent.
Math. Comput., 2000

1999
Getting rid of correlations among pseudorandom numbers: discarding versus tempering.
ACM Trans. Model. Comput. Simul., 1999

The Dynamic Creation of Distributed Random Number Generators.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999

1998
Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudo-Random Number Generator.
ACM Trans. Model. Comput. Simul., 1998

Simple Cellular Automata as Pseudo-Random <i>m</i>-Sequence Generators for Built-In Self-Test.
ACM Trans. Model. Comput. Simul., 1998

A Note on Difference Sets.
J. Comb. Theory A, 1998

Is There a Circle that Passes Through a Given Number of Lattice Points?
Eur. J. Comb., 1998

1996
Strong Deviations from Randomness in m-Sequences Based on Trinomials.
ACM Trans. Model. Comput. Simul., 1996

1995
Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function.
J. Comb. Theory A, 1995

1994
Twisted GFSR Generators II.
ACM Trans. Model. Comput. Simul., 1994

A short proof of Nash-Williams' theorem for the arboricity of a graph.
Graphs Comb., 1994

1992
Twisted GFSR Generators.
ACM Trans. Model. Comput. Simul., 1992

1991
A mixed version of Menger's theorem.
Comb., 1991

1990
Bounds for the vertex linear arboricity.
J. Graph Theory, 1990

1989
Noncontact Three-Dimensional Contour Instrumentation - Development of High-Speed Active Range Finder -.
J. Robotics Mechatronics, 1989

The exact bound in the Erdös-Ko-Rado theorem for cross-intersecting families.
J. Comb. Theory A, 1989

A generalization of the katona theorem for cross<i>t</i>-intersecting families.
Graphs Comb., 1989

A note on the numerical evaluation of arctangent function.
SIGSAM Bull., 1989

1988
The line digraph of a regular and pancircular digraph is also regular and pancircular.
Graphs Comb., 1988


  Loading...