Re: Ideas for course on great ideas in (theoretical) CS?
From: Chip Klostermeyer (klostermeyer_at_hotmail.com)
Date: 02/24/04
- Next message: Pento: "Re: Comparing two notions of computable number"
- Previous message: Axel Boldt: "Comparing two notions of computable number"
- In reply to: Gila Morgenstern: "Re: Ideas for course on great ideas in (theoretical) CS?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 24 Feb 2004 07:54:14 -0800
> I was looking at Amazon for the book you have mentained, but didn't find it.
> Could you please tell me who the writer is?
>
Here it is, along with a few related others. All can be found
at Amazon:
Great Ideas in Computer Science - 2nd Edition: A Gentle Introduction
by Alan W. Bierman
Publisher: MIT Press; 2nd edition (March 1, 1997) ISBN: 0262522233
ACM Turing Award Lectures: The First Twenty Years 1966-1985
Publisher: Addison-Wesley Pub Co; 1st edition (July 1, 1991) ISBN:
0201548852
A History of Algorithms: From the Pebble to the Microchip
by Jean-Luc Chabert (Editor), E. Barbin (Editor), R. Aasnogorodski, V.
Malyshev
Publisher: Springer Verlag; (September 1999) ISBN: 3540633693
People & Ideas in Theoretical Computer Science (Springer Series in
Discrete Mathematics and Theoretical Computer Science)
by Cristian Calude
Publisher: Springer Verlag; (October 1999)
ISBN: 981402113X
- Next message: Pento: "Re: Comparing two notions of computable number"
- Previous message: Axel Boldt: "Comparing two notions of computable number"
- In reply to: Gila Morgenstern: "Re: Ideas for course on great ideas in (theoretical) CS?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
