![[CAIDA - Cooperative Association for Internet Data Analysis logo]](/images/caida_globe_faded.png)
![[CAIDA]](/images/caida_whitewords.png "Go to CAIDA home page"){kind=small}
From Wikipedia: The Erdös number, honouring the late Hungarian mathematician Paul Erdös, one of the most prolific writers of mathematical papers, is a way of describing the "collaborative distance", in regard to mathematical papers, between an author and Erdös. In order to be assigned an Erdös number, an author must co-write a mathematical paper with an author with a finite Erdös number. Paul Erdös has an Erdös number of zero. If the lowest Erdös number of a coauthor is X, then the author's Erdös number is X + 1.
You can read more about the Erdös Number project here.
My Erdös Number is 3 via the following collaborations:
Paul Erdös --> László Babai --> Carsten Lund --> Amogh Dhamdhere
Following are the publications corresponding to these collaborations:
- László Babai, Paul Erdös and Stanley Selkow, "Random Graph Isomorphism", SIAM J. Comput. 9 (1980), no. 3, 628-6358.
- László Babai, Lance Fortnow, and Carsten Lund, "Nondeterministic exponential time has two-prover interactive protocols", 31st Annual Symposium on Foundations of Computer Science, Vol. I, II (St. Louis, MO, 1990), 16-25, IEEE Computer Society Press, Los Alamitos, CA, 1990.
- Amogh Dhamdhere, Lee Breslau, Nick Duffield, Alexandre Gerber, Cheng Ee, Carsten Lund and Shubho Sen, "FlowRoute: Inferring Forwarding Table Updates using Passive Flow-level Measurements", USENIX/ACM/SIGCOMM Internet Measurement Conference (IMC) 2010.