|
|
Arnold L. Rosenberg
Distinguished University Professor Emeritus |
Effective January 1, 2008, I am retired from the University of
Massachusetts Amherst. Prior to retiring, I held the rank of
Distinguished University Professor in the Department of Computer Science at
UMass 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. I
held visiting positions at Yale University and the University of
Toronto. 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 will continue unabated---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 new modalities of
"collaborative computing," especially within the context of
Internet-based computing. My current main research/writing
projects are:
I have (co)authored more than 160 technical papers on multiple topics
in theoretical computer science and discrete mathematics (and 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 publication (in PDF):
The model spelled
out and exemplified via a couple of natural algorithmic problems
A second paper will be available quite soon.
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 a book on
Computation Theory that I am working on: The Pillars of Computation
Theory: State, Nondeterminism, Encoding.
Graph Separators,
with Applications.
As noted above, I am currently working on a book on
Computation Theory,
The Pillars of Computation
Theory: State, Nondeterminism, Encoding,
which I hope will be available by the end of 2008 (maybe even late summer).
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