|
Arnold L. Rosenberg
Research Professor
Distinguished University Professor Emeritus |
On January 1, 2008, I retired from
the University of
Massachusetts Amherst. I now split my year between Cape Cod, MA,
during which time I do research and write, and Denver, CO, where I
hold the rank of Research Professor in the ECE Department at Colorado
State University, with a secondary appointment in Computer Science.
Prior to retiring from UMass, I held the rank of Distinguished
University Professor in
the Department of Computer
Science for 20+ years. Before joining UMass, I was a Professor of
Computer Science at Duke University from 1981 to 1986, and a Research
Staff Member at the IBM Watson Research Center from 1965 to 1981.
Over the years, I held visiting positions at Yale University and the
University of Toronto, in addition to part-time positions at the
predecessor of Polytechnic University and at New York University. I
was a Lady Davis Visiting Professor at the Technion (Israel Institute
of Technology) and a Fulbright Senior Research Scholar at the
University of Paris-South.
My research program is continuing unabated post-retirement---perhaps
even at a higher level of intensity, with no required teaching and
committee work. My main research focus is on developing algorithmic
models and techniques to deal with the many new modalities of
"collaborative computing," the use of many, possibly
geographically dispersed, computers to cooperatively solve individual
computing problems. My current main research/writing projects include:
I have (co)authored more than 170 technical papers on multiple topics
in theoretical computer science and discrete mathematics (including one in
linguistics); these appear in venues devoted to computer science,
engineering, mathematics, and/or linguistics. In collaboration with
my friend and former student, Prof. Lenwood S. Heath, I coauthored
the book, I am a Fellow of the ACM, a Fellow of the IEEE, and a Golden Core
member of the IEEE Computer Society. I received an A.B. in mathematics from Harvard College
in 1962, and an A.M. and Ph.D. in applied mathematics from Harvard
University, in 1963 and 1966, respectively.
In response to many requests, here is a link to my one-and-only
linguistics paper "The Hardest Natural Languages"
(in PDF)
, which appeared in the journal Linguisticae
Investigationes. Responding to allegations in various blogs ---
Everything in this article is accurate!
My extracurricular activities include travel (see the pictures below),
jogging (slowly, but faithfully), and writing poetry (samples
available on request).
Sample publications (in PDF):
1. The paper that
turned my initial idea into a theory
2. Simulation
experiments that suggest the benefits of IC-scheduling
3. Sample "real"
computations that yield to IC-scheduling
Sample publications (in PDF) that flesh out the model and illustrate
it via some natural algorithmic problems:
the first paper in
the series
the second
paper
This project is now on hold pending my finding systems-oriented
collaborators --- but I am using the respite from ANTOmata to discover
interesting things about the algorithmics of "intelligent" ant-robots.
Sample questions: QU: Does heterogeneity actually enhance
computing power? (ANS: Yes) QU: If you can replace just one of your
computers with a faster one, which one should you choose? (ANS: The
fastest one)
Sample publication (in PDF):
The framework
spelled out and exemplified via a series of questions such as the two
samples
Sample publication (in PDF):
The model spelled
out and exemplified via a natural design problem
Sample publication (in PDF):
An
iconoclastic view of how to teach Computation Theory.
This paper is a sort of "manifesto" that prefaces
The
Pillars of Computation Theory: State, Encoding, Nondeterminism,
my book on Computation Theory which just appeared as part of the
Springer Universitext series.
Graph Separators, with Applications.
As noted above, I have recently completed a textbook on
Computation Theory,
The
Pillars of Computation Theory: State, Encoding, Nondeterminism,
I have also served as coeditor of several books, most recently,
Theoretical
Computer Science: Essays in Memory of Shimon Even.
a volume in memory of my late dear friend Shimon Even.
Bibliography
Contact Information
EMAIL:
rsnbrg @ cs.umass.edu or rsnbrg @ colostate.edu