Standout Papers

A hierarchical O(N log N) force-calculation algorithm 1986 2026 1999 2012 2.0k
  1. A hierarchical O(N log N) force-calculation algorithm (1986)
    Piet Hut et al. Nature

Immediate Impact

14 by Nobel laureates 35 from Science/Nature 73 standout
Sub-graph 1 of 18

Citing Papers

Genetic manipulation of Patescibacteria provides mechanistic insights into microbial dark matter and the epibiotic lifestyle
2023 StandoutNobel
Discovering faster matrix multiplication algorithms with reinforcement learning
2022 StandoutNatureNobel
2 intermediate papers

Works of Piet Hut being referenced

A hierarchical O(N log N) force-calculation algorithm
1986 StandoutNature

Author Peers

Author Last Decade Papers Cites
Piet Hut 5561 1179 878 128 7.5k
Junichiro Makino 4690 1159 650 209 5.9k
Simon Portegies Zwart 10108 1940 403 293 10.9k
Salman Habib 2168 432 821 113 4.1k
F. R. Pearce 7947 3420 757 104 8.3k
Romain Teyssier 13826 4371 520 216 14.6k
Andrew J. Connolly 5284 2446 240 108 5.8k
E. Bertin 7519 3546 145 125 8.3k
F. X. Timmes 8427 1410 121 110 9.7k
B. D. Wandelt 8715 1323 716 191 9.8k
Matthias Bartelmann 7569 1818 465 173 8.3k

All Works

Loading papers...

Rankless by CCL
2026