sreedhar@longhair.cs.unlv.edu (06/03/90)
Summary of the response to my earlier posting
**************************************************************
The Wichita State University, Computer Science Department:
Analysis of Algorithms:
Text: The Design and Analysis of Computer Algorithms
by Aho, Hopcroft, and Ullman
Addison and Wesley
Principles of Database Systems:
Text: Principles of Database and Knowledge-base Systems Vol. I and II
by Ullman
Computer Science Press
Raj Sunderraman
************************************************************
From: Victor Kan <kan@dg-rtp.dg.com>
1. Advanced algorithms and complexity analysis.
Hopcroft and Ullman's "Intro to Complexity, Languages and Automata
???" We used two other books (very thin!), but I can't remember their
titles just now. Authors:
a. Juris Hartmanis (Cornell)
b. Balcazar, Diaz and Gabarro ???
(I'll try to find the titles)
2. Theory of computation
Hopcroft and Ullman
Daniel Cohen, Intro to the Theory of computation ?
3. Advanced formal languages and automata theory
Hopcroft and Ullman (gets used a lot, doesn't it!?)
4. Advanced programming languages
(Columbia doesn't/didn't have one of these)
5. Parallel algorithms
Hwang and Briggs, Parallel Computer Architecture and Algorithms
6. Concurrency computation (CSP, CCS, petri-nets, etc.)
We used Concurrent Euclid and later Turing Plus in an OS class. CE
had the book Tunis, Concurrent Euclid and the Unix System. For Turing
Plus, we only had the language tech reports from U. Toronto CSRI.
7. Distributed and network (operating) systems
I just got this a few weeks ago via ftp:
spam.itstd.sri.com (128.18.4.3) pub/amoeba/amoeba-doc.tar.Z
(The .ps output is also on this machine in a previous directory)
It's a collection of papers about the Amoeba Distributed OS (Tanenbaum).
Comer, Internetworking with TCP/IP
Tanenbaum, Computer Networks (second edition)
(I guess these last two aren't really what you're asking for)
8. Advanced computer architecture
An unfinished (or just unpublished?) book written by the instructor
(David Bantz of IBM's T.J. Watson Research Center in NY)
9. and any other advanced subjects offered at your university.
For Advanced OS, we used articles published in IEEE Computer, ACM
SIGOPS, Computing Surveys, JACM, Usenix, the professor's own papers,
etc.
For Graph Theory, we used the instructor's book (Topological Graph
Theory, by Jonathan Gross and ??? Tucker (not Alan Tucker though).
For Programming Environments & Software Tools (PEST), we used papers
from IEEE Computer, SIGPLAN, the professor's own papers, etc.
****************************************************************
From: Jim Harkins <harvard!jharkins%sagpd1%mit-eddie@convex.uucp>
Algorithms by Sedgewick is an excellant book for teaching non-trivial
algorithms, and is a pretty good reference as well.
Operating Systems by Tannenbaum is another very good book.
Although I never used it as a textbook I'd also give thumbs up to Serial
Communications, by Joe Campbell.
****************************************************************
At UNLV we follow
1. Aho, Hopcroft and Ullman series for algorithms, database, compilers,
and automata/language.
2. Papadimitriou's book is also used as a reference
3. CSP book by Hoare andd Reisig on Petri-nets for concurrency
4. Papers by Lampoort, Dijsktra, Chandy, Misra, Jefferson, etc
for Advanced OS. Our instructor has compiled a good collection
of these papers.
5. In theory of computation our instructor covers
primitive and partial recursive function theory, lambda-calculus,
combinatory logic, pure-lisp, and introduction to domain theory.
6. Formal semantic book by Gordan and Stoy's book as reference.
-vcs
thanks for the response