Home   LARC   News

Claim to Fame

Nagware

Wikipedia seems to credit me for the earliest use of the term Nagware, since I used it in I. Parberry, "The Internet and the Aspiring Games Programmer", Proceedings of DAGS 95, "Electronic Publishing and the Information Superhighway", James Ford, Fillia Makedon, Samuel Rebelsky (Editors), pp. 155-159, Birkhauser, Boston, MA, June 1995.

Quotes

  1. Wikiquote credits me for the quote "Bureaucracy is expanding to meet the needs of an expanding bureaucracy", which I used as a .sig in my emails and newsgroup posts in the late 1980s.
  2. "Computer Science is no more about computers than astronomy is about telescopes, biology is about microscopes or chemistry is about beakers and test tubes." Michael R. Fellows and Ian Parberry, "SIGACT Trying to Get Children Excited About CS", Computing Research News, Vol. 5, No. 1, p. 7, Jan. 1993. The first part of this quote is often misattributed to Edsgar Dijkstra.

Erdös Number

Image

My Erdös number is 3, at least four different ways:

  1. Paul Erdös, Endre Szemerédi, Georg Schnitger, Ian Parberry
  2. Paul Erdös, Jeff Shallit, John Sorenson, Ian Parberry
  3. Paul Erdös, Carl Pomerance, John Sorenson, Ian Parberry
  4. Paul Erdös, Michael Saks, Piotr Berman, Ian Parberry

Coauthorship diagram.

Citations for Erdös number 1:

  1. Miklos Ajtai, Paul Erdös, Janos Komlós, and Endre Szemerédi, "On Turán's theorem for sparse graphs", Combinatorica, Vol. 1, No. 4, pp. 313-317, 1981.
  2. Paul Erdös and Jeff Shallit, "New bounds on the length of finite Pierce and Engel series", Sém. Théor. Nombres Bordeaux (2) Vol. 3, no. 1, pp. 43-53, 1991.
  3. Paul Erdös and Carl Pomerance, "On the largest prime factors of n and n+1" Aequationes Math., Vol. 17 no. 2-3, pp. 311-321, 1978.
  4. Paul Erdös, Michael Saks, and Vera Sós,"Maximum induced trees in graphs", J. Combin. Theory Ser. B, Vol. 41, no. 1, 61-79, 1986.

Citations for Erdös number 2:

  1. Wolfgang Maass, Georg Schnitger, Endre Szemerédi, and György Turán, "Two tapes versus one for off-line Turing machines", Computational Complexity, Vol. 3 , no. 4, pp. 392-401, 1993.
  2. Piotr Berman, Avrim Blum, Amos Fiat, Howard Karloff, Adi Rosén, and Michael Saks, "Randomized robot navigation algorithms", Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, pp. 75-84, 1996.
  3. Carl Pomerance and Jonathon Sorenson, "Counting the integers factorable via cyclotomic methods", Journal of Algorithms, Vol. 19, pp. 250-265, 1995.
  4. Jeffrey Shallit and Jonathon Sorenson, "A binary algorithm for the Jacobi symbol", ACM SIGSAM Bulletin, Vol. 27, No. 1, Jan. 1993.

Citations for Erdös number 3:

  1. Piotr Berman, Ian Parberry, and Georg Schnitger, "A Note on the Complexity of Reliability in Neural Networks", IEEE Transactions on Neural Networks, Vol. 3, No. 6, pp. 998-1002, 1992.
  2. Jonathon Sorenson and Ian Parberry, "Two Fast Parallel Prime Number Sieves", Information and Computation, Vol. 114, No. 1, pp. 115-130, 1994.

Random Numbers

Coin flip image. Thumbnails

Created August 5, 2015. Written in HTML 4.01 and CSS 3 using Notepad++. Last updated August 5, 2015.

Valid HTML 4.01 Strict Valid CSS!