Random Permutations
Random Permutations is a probabilistic combinatorial model that specifies a uniform probability distribution over the set of all permutations of a given finite set, distinguishing it from deterministic permutation models by assigning equal likelihood to each possible ordering.
401
Publications
25.7K
Citations
679
Authors
381
Institutions
Publications per year
2017–2026
62
401
Extreme Learning Machines [Trends & Controversies]
Erik Cambria, Guang-Bin Huang, Hongming Zhou et al. · IEEE Intelligent Systems · 2013 · 706 citations
1–5 of 401
679
University of Electronic Science and Technology of China, China
8 publications · 294 citations
8
h-index
8
h-index
7
h-index
6
h-index
6
h-index
1–5 of 679
381

University of Warwick
Coventry, United Kingdom
12 h-index
21 publications
846 citations
Stanford University
Stanford, United States
11 h-index
17 publications
1.6K citations

Centre National de la Recherche Scientifique
Paris, France
10 h-index
17 publications
819 citations
University of California, Berkeley
Berkeley, United States
9 h-index
12 publications
515 citations

University of Electronic Science and Technology of China
Chengdu, China
8 h-index
16 publications
588 citations
University of Zurich
Zurich, Switzerland
7 h-index
14 publications
269 citations
University of Washington
Seattle, United States
6 h-index
7 publications
205 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
10 publications
388 citations
1–8 of 381
17 publications · 451 citations
14
h-index
15 publications · 492 citations
12
h-index
Repository · 14 publications · 309 citations
11
h-index
11 publications · 361 citations
11
h-index
9 publications · 673 citations
9
h-index
1–5