Kernel Strategies
Kernel Strategies is a strategic framework in combinatorial game theory that identifies invariant subsets of game states, termed kernels, which uniquely determine optimal move selections by ensuring that no two positions within the kernel are mutually reachable and every position outside the kernel has a move leading into it.
28
Publications
817
Citations
82
Authors
43
Institutions
Publications per year
2017–2026
10
Parents
28
Scaling Hierarchical N-body Simulations on GPU Clusters
Pritish Jetley, Lukasz Wesolowski, Filippo Gioachin et al. · 2010 · 95 citations
Kernel Machine SNP‐Set Testing Under Multiple Candidate Kernels
Michael C. Wu, Arnab Maity, Seunggeun Lee et al. · Genetic Epidemiology · 2013 · 81 citations · Full text
1–5 of 28
82
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 82
43
Harvard University
Cambridge, United States
3 h-index
6 publications
300 citations

Scuola Superiore Sant'Anna
Pisa, Italy
2 h-index
5 publications
69 citations

Télécom Paris
Palaiseau, France
2 h-index
6 publications
171 citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
2 h-index
6 publications
500 citations
North Carolina State University
Raleigh, United States
2 h-index
3 publications
271 citations

Institute of Mathematical Sciences
Chennai, India
1 h-index
1 publications
13 citations
University of Science and Technology Bannu
Bannu, Pakistan
1 h-index
1 publications
16 citations
Tianjin University
Tianjin, China
1 h-index
1 publications
48 citations
1–8 of 43
JAP · 2 publications · 57 citations
2
h-index
2 publications · 176 citations
2
h-index
2 publications · 28 citations
2
h-index
Conference · 1 publications · 15 citations
1
h-index
1 publications · 13 citations
1
h-index
1–5