Arnold L. Rosenberg
Encyclopedia
Arnold Leonard Rosenberg is an American computer scientist
Computer scientist
A computer scientist is a scientist who has acquired knowledge of computer science, the study of the theoretical foundations of information and computation and their application in computer systems....

. He is a distinguished university professor emeritus
Emeritus
Emeritus is a post-positive adjective that is used to designate a retired professor, bishop, or other professional or as a title. The female equivalent emerita is also sometimes used.-History:...

 at the University of Massachusetts Amherst
University of Massachusetts Amherst
The University of Massachusetts Amherst is a public research and land-grant university in Amherst, Massachusetts, United States and the flagship of the University of Massachusetts system...

, and despite his retirement from UMass he continues to hold research positions at Northeastern University and Colorado State University
Colorado State University
Colorado State University is a public research university located in Fort Collins, Colorado. The university is the state's land grant university, and the flagship university of the Colorado State University System.The enrollment is approximately 29,932 students, including resident and...

.

Rosenberg is known, among other contributions, for formulating the Aanderaa–Karp–Rosenberg conjecture stating that many nontrivial properties in graph theory
Graph theory
In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects from a certain collection. A "graph" in this context refers to a collection of vertices or 'nodes' and a collection of edges that connect pairs of...

 cannot be answered without testing for the presence or absence of every possible edge in a given graph.

Rosenberg did both his undergraduate and graduate studies at Harvard University
Harvard University
Harvard University is a private Ivy League university located in Cambridge, Massachusetts, United States, established in 1636 by the Massachusetts legislature. Harvard is the oldest institution of higher learning in the United States and the first corporation chartered in the country...

, receiving a bachelor's degree in 1962 and a Ph.D. in 1966 under the supervision of Patrick C. Fischer
Patrick C. Fischer
Patrick Carl Fischer was an American computer scientist, a noted researcher in computational complexity theory and database theory, and a target of the Unabomber.-Biography:...

.
Prior to joining the UMass faculty, Rosenberg worked at the Thomas J. Watson Research Center
Thomas J. Watson Research Center
The Thomas J. Watson Research Center is the headquarters for the IBM Research Division.The center is on three sites, with the main laboratory in Yorktown Heights, New York, 38 miles north of New York City, a building in Hawthorne, New York, and offices in Cambridge, Massachusetts.- Overview :The...

 from 1965 until 1981, and was a faculty member at Duke University
Duke University
Duke University is a private research university located in Durham, North Carolina, United States. Founded by Methodists and Quakers in the present day town of Trinity in 1838, the school moved to Durham in 1892. In 1924, tobacco industrialist James B...

 from 1981 until 1985. He was elected a fellow of the Association for Computing Machinery
Association for Computing Machinery
The Association for Computing Machinery is a learned society for computing. It was founded in 1947 as the world's first scientific and educational computing society. Its membership is more than 92,000 as of 2009...

 in 1996 for his work on "graph-theoretic
Graph theory
In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects from a certain collection. A "graph" in this context refers to a collection of vertices or 'nodes' and a collection of edges that connect pairs of...

 models of computation
Model of computation
In computability theory and computational complexity theory, a model of computation is the definition of the set of allowable operations used in computation and their respective costs...

, emphasizing theoretical studies of parallel algorithm
Parallel algorithm
In computer science, a parallel algorithm or concurrent algorithm, as opposed to a traditional sequential algorithm, is an algorithm which can be executed a piece at a time on many different processing devices, and then put back together again at the end to get the correct result.Some algorithms...

s and architectures
Parallel computing
Parallel computing is a form of computation in which many calculations are carried out simultaneously, operating on the principle that large problems can often be divided into smaller ones, which are then solved concurrently . There are several different forms of parallel computing: bit-level,...

, VLSI
Very-large-scale integration
Very-large-scale integration is the process of creating integrated circuits by combining thousands of transistors into a single chip. VLSI began in the 1970s when complex semiconductor and communication technologies were being developed. The microprocessor is a VLSI device.The first semiconductor...

 design and layout, and data structure
Data structure
In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks...

s". In 1997, he was elected as a fellow of the IEEE "for fundamental contributions to theoretical aspects of computer science and engineering".

External links

The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK