Pseudo-random Number Generators
Pseudo-Random Number Generators is a computational algorithm that deterministically produces sequences of numbers designed to simulate the statistical properties of true random processes, differing from true random number generators by relying on initial seed values and periodic, reproducible outputs.
1.2K
Publications
61.1K
Citations
2.4K
Authors
957
Institutions
Publications per year
2017–2026
329
Parents
1.2K
Makoto Matsumoto, Takuji Nishimura · ACM Transactions on Modeling and Computer Simulation · 1998 · 5.7K citations
1–5 of 1.2K
2.4K
24
h-index
Darmstadt University of Applied Sciences, Germany
18 publications · 392 citations
13
h-index
9
h-index
9
h-index
9
h-index
1–5 of 2.4K
957
Austrian Academy of Sciences
Vienna, Austria
20 h-index
33 publications
4K citations

Centre National de la Recherche Scientifique
Paris, France
18 h-index
61 publications
2.5K citations
University of California, Berkeley
Berkeley, United States
16 h-index
20 publications
2.2K citations
Darmstadt University of Applied Sciences
Darmstadt, Germany
11 h-index
21 publications
658 citations

Cairo University
Giza, Egypt
10 h-index
17 publications
555 citations

Harbin Institute of Technology
Harbin, China
10 h-index
19 publications
1.4K citations

Huazhong University of Science and Technology
Wuhan, China
10 h-index
28 publications
2.6K citations
University of Illinois Urbana-Champaign
Urbana, United States
10 h-index
18 publications
1.1K citations
1–8 of 957
20 publications · 1.4K citations
18
h-index
MCOM · 31 publications · 1.3K citations
17
h-index
24 publications · 1K citations
17
h-index
17 publications · 1.6K citations
17
h-index
TOMACS · 18 publications · 6.5K citations
15
h-index
1–5