Research

Software

Documentation


Home

Erdős Number

The shortest path I've identified from me to Paul Erdős has 4 steps.

Erdős NumberPersonPublication
0Paul Erdős
1Stephen T. HedetniemiPaul Erdős, W.R. Hare, Stephen T. Hedetniemi, and R. Laskar. On the equality of the Grundy and ochromatic numbers of a graph. 1987
2Ken KennedyZhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, and Alice McRae. An algorithm for partial Grundy number on trees. 2005.
3Kathryn S. McKinleyKen Kennedy and Kathryn S. McKinley. Optimizing for parallelism and data locality. 1992.
4Donald E. PorterIndrajit Roy, Donald E. Porter, Michael D. Bond, Kathryn S. McKinley, and Emmett Witchel. Laminar: Practical Fine-Grained Decentralized Information Flow Control. 2009.

Of course, I'd be much obliged to anyone who identified a shorter path.

To learn more about Erdős numbers, look here.