Print this page

Erdos Number

I have an Erdős Number of 5. Two possible paths for that are:

  1. Hershkovitz -> Baker -> Tamassia -> Atallah -> Wagstaff -> Erdős
  2. Hershkovitz -> Baker -> Goodrich -> Kosaraju -> Aronov -> Erdős
    (Goodrich has at least ten disjoint paths to demonstrate his Erdos Number 3.)

Full Citations for Path 1 (one possible match):

  • Cocea, M., A. Hershkovitz, and R.S.J.d. Baker. (Accepted). The impact of off-task and gaming on learning: Immediate or aggregate? The 14th International Conference on Artificial Intelligence in Education. Brighton, UK.
  • Baker, R.S., Boilen, M., Goodrich, M., Tamassia, R., and Stibel, B.A. (1999). Testers and Visualizers for Teaching Data Structures. 30th ACM SIGCSE Technical Symposium on Computer Science Education, New Orleans, LA.
  • Yao, D., Frikken, K., Atallah, M., and Tamassia, R. (2008). Private information: To reveal or not to reveal, ACM Transactions on Information and System Security, 12(1), pp. 1–27.
  • Atallah, M. and Wagstaff, S. (1999). Watermarking with quadratic residues. SPIE Workshop on Electronic Imaging (SPIE'99), San Jose, CA.
  • Wagstaff, S. and Erdos, P. (1980). The Fractional Parts of the Bernoulli Numbers. Illinois Journal of Mathematics, 24, 104-112.

Full Citations for Path 2 (one possible match):

  • Cocea, M., A. Hershkovitz, and R.S.J.d. Baker. (Accepted). The impact of off-task and gaming on learning: Immediate or aggregate? The 14th International Conference on Artificial Intelligence in Education. Brighton, UK.
  • Baker, R.S., Boilen, M., Goodrich, M., Tamassia, R., and Stibel, B.A. (1999). Testers and Visualizers for Teaching Data Structures. 30th ACM SIGCSE Technical Symposium on Computer Science Education, New Orleans, LA.
  • Goodrich, M. and Kosaraju, S.R. (1996). Sorting on a parallel pointer machine with applications to set expression evaluation. Journal of the ACM, 43(2), 331-361.
  • Agarwal, P.K., Aggarwal, A., Aronov, B., Kosaraju, S.R., Schieber, B., and Suri, S.. (1991). Computing external farthest neighbors for a simple polygon. Discrete Applied Mathematics, 31(2), 97-111.
  • Aronov, B. , Erdos, P., Goddard, W., Kleitman, D.J., Klugerman, M., Pach, J., and Schulman, L.J. (1994). Crossing families. Combinatorica, 14(2), 127-134.

Previous page: User-defined tags