Arnold L. Rosenberg

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Arnold Leonard Rosenberg is an American computer scientist. He is a distinguished university professor emeritus at the University of Massachusetts Amherst,[1] and despite his retirement from UMass he continues to hold research positions at Northeastern University[2] and Colorado State University.[3]

Rosenberg is known, among other contributions, for formulating the Aanderaa–Karp–Rosenberg conjecture stating that many nontrivial properties in graph theory cannot be answered without testing for the presence or absence of every possible edge in a given graph.[4]

Rosenberg did both his undergraduate and graduate studies at Harvard University, receiving a bachelor's degree in 1962 and a Ph.D. in 1966 under the supervision of Patrick C. Fischer.[1][5] Prior to joining the UMass faculty, Rosenberg worked at the Thomas J. Watson Research Center from 1965 until 1981, and was a faculty member at Duke University from 1981 until 1985. He was elected a fellow of the Association for Computing Machinery in 1996 for his work on "graph-theoretic models of computation, emphasizing theoretical studies of parallel algorithms and architectures, VLSI design and layout, and data structures".[6] In 1997, he was elected as a fellow of the IEEE "for fundamental contributions to theoretical aspects of computer science and engineering".[7]

References[edit]

  1. ^ a b Faculty directory, UMass Amherst CS, retrieved 2011-03-13.
  2. ^ Faculty directory, Northeastern CCS, retrieved 2011-03-13.
  3. ^ Faculty directory, CSU CS, retrieved 2011-03-31.
  4. ^ Lovász, László; Young, Neal E. (2002), Lecture Notes on Evasiveness of Graph Properties, arXiv:cs/0205031v1 .
  5. ^ Arnold Leonard Rosenberg at the Mathematics Genealogy Project
  6. ^ ACM Fellow citation, Association for Computing Machinery, retrieved 2011-03-13.
  7. ^ IEEE Fellows directory, retrieved 2011-03-13.

External links[edit]