Pseudo-random Number Generation
Pseudo-Random Number Generation is a deterministic computational process that produces sequences of numbers approximating the properties of true random sequences, distinguished from true random generation by its reliance on an initial seed value and algorithmic reproducibility.
1.1K
Publications
74.8K
Citations
2.4K
Authors
953
Institutions
Publications per year
2017–2026
322
1.1K
Quantum computation and quantum information
Jim Law · ACM SIGSOFT Software Engineering Notes · 2001 · 19.2K citations
Computing, Computer Science, Physics +13
Quantum computation and quantum information
Thierry Paul · Mathematical Structures in Computer Science · 2007 · 1.9K citations
Computing, Computer Science, Physics +13
1–5 of 1.1K
2.4K
25
h-index
Darmstadt University of Applied Sciences, Germany
20 publications · 425 citations
13
h-index
11
h-index
9
h-index
8
h-index
1–5 of 2.4K
953
Austrian Academy of Sciences
Vienna, Austria
23 h-index
43 publications
4.2K citations

Centre National de la Recherche Scientifique
Paris, France
18 h-index
54 publications
4.4K citations
Darmstadt University of Applied Sciences
Darmstadt, Germany
13 h-index
27 publications
730 citations
University of California, Berkeley
Berkeley, United States
11 h-index
16 publications
3K citations

Cairo University
Giza, Egypt
10 h-index
19 publications
844 citations
Massachusetts Institute of Technology
Cambridge, United States
10 h-index
16 publications
2.5K citations
National University of Singapore
Singapore, Singapore
10 h-index
16 publications
402 citations

Huazhong University of Science and Technology
Wuhan, China
10 h-index
32 publications
1.9K citations
1–8 of 953
19 publications · 1.4K citations
18
h-index
MCOM · 30 publications · 796 citations
16
h-index
23 publications · 767 citations
16
h-index
JACM · 17 publications · 1K citations
16
h-index
13 publications · 929 citations
13
h-index
1–5