Skip to content

My Erdős number is now 6

[wiki]

  1. C. Butterfield, R. Mason, and S. Thede. “Sentence Selection for Extractive Summaries in PARE,” Proceedings of the Midstates Conference for Undergraduate Research in Computer Science and Mathematics, Nov. 2007, pp. 53-62.
  2. A. M. Surprenant, S. L. Hura, M. P. Harper, L. H. Jamieson, G. Long, S. M. Thede, A. Rout, T.-H. Hsueh, S. A. Hockema, M. T. Johnson, P. Srinivasan, C. White, and J. Laflen. “Familiarity and Pronounceability of Nouns and Names,” Behavior Research Methods, Instruments, & Computers, Vol. 31, Nov. 1999, pp. 638-649.
  3. J. N. Patel, A. A. Khokhar, and L. H. Jamieson. “Scalability of 2-D wavelet transform algorithms: analytical and experimental results on MPPs,” IEEE Transactions on Signal Processing, Vol. 48, Issue 12, Dec. 2000, pp. 3407-3419.
  4. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. A. Khokhar. “A randomized parallel 3D convex hull algorithm for coarse grained multicomputers,” Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, 1995, pp. 27-33.
  5. X. Deng, P. Hell, and J. Huang. “Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs,” SIAM Journal on Computing, Vol. 25, Issue 2, Feb. 1996, pp. 390-403.
  6. P. Erdős, P. Hell, and P. Winkler. “Bandwidth versus Bandsize,” Annals of Discrete Mathematics, Vol. 41, 1989, pp. 117-130.

In this day and age, having a finite Erdős number essentially means that you have co-written a paper with someone on a subject whose field occasionally involves numbers in some fashion.

Post a Comment

You must be logged in to post a comment.