"Computer Science is no more about computers than astronomy is about
telescopes."- E. W. Dijkstr
"To err is human, but to really foul things up requires a computer." -
Farmers' Almanac, 1978
"The great thing about a computer notebook is that no matter how much you
stuff into it, it doesn't get bigger or heavier." - Bill Gates,
Business @ The Speed of Thought
"Hardware: the parts of a computer that can be kicked." - Jeff Pesis
Computational Geometry | Computer
| Parallel Computing
Books, Lectures, Tutorials
The Association of C & C++ Users -- is a non-profit
organization devoted to professionalism at all levels in C, C++, Java and
Python. This Web site has a categorized directory of related links and other
resources and book reviews.
-- Contains a suite of benchmarks designed to measure the performance of the
code generated by C++ compilers.
- Fortran Library -- provides a
large number of routines to perform standard non-numeric coding tasks for
scientists & engineers; it also includes some routines for numeric tasks.
Object-Oriented Programming Using C++ -- A self-paced course to learn
object-oriented programming. Concepts are presented using the C++ programming
language, but the course is not intended to learn C++ in all its details.
Pascal Programming --
An interactive introduction to the Pascal programming language that covers the
basics of learning to program, data types, declarations, arrays, functions,
records, pointers, enumerated & set types, and file handling.
- ACM SIGACT --
ACM's special interest group for Theoretical Computer Science.
Analysis Of Algorithms Home Page -- An initiative of attendees of
the 1997 Dagstuhl seminar, these pages provide research papers, a bulletin
board, and links to researchers and other resources in the field. The focus is
on average case and probabilistic analysis.
An Introduction to the Theory of Computation -- An
online text aimed at advanced undergraduate and graduate students. Chapters
include Finite-Memory Programs, Recursive Finite-Domain Programs, General
Programs, Resource Bounded Computation, Probabilistic Computation, and
- Aria Technology Group --
Deals with the physics of non traditional computing methods.
Complexity Forum -- Provides an overview, including surveys and a
bibliography, of recent work on average-case complexity analysis.
- CAC-NET/FoCM-NET --
Archives and membership information of an electronic forum for researchers in
Continuous Algorithms and Complexity and in Foundations of Computational
Comp.Theory FAQ -- Frequently Asked Questions on Theoretical
Computer Science from the comp.theory newsgroup.
Computability and Complexity in Analysis Network --
CCA Net aims to provide a central location for collecting information useful
to researchers working in the field.
Contributions of Theoretical Computer Science -- A
1996 statement by the SIGACT Long Term Planning Committee on the importance of
theoretical computer science to other fields.
Foundations of Computational Mathematics -- A group which sponsors
regular meetings on the relationships between mathematical analysis, topology,
geometry and algebra and the computational process.
Information-Based Complexity Home Page -- Provides information on
computational complexity problems in the presence of partial or contaminated
information and links to researchers in this field.
Innovations in Teaching And Learning in Information and Computer Sciences
-- An electronic journal targeting academics within the Information and
Computer Science communities. Full text articles and submission guidelines for
authors are available.
- SIGACT News Theory
Calendar -- A calendar of upcoming theoretical computer science
events and a list of recently released books in the field.
Theoretical Computation on the Web -- A directory of
resources related to theoretical computer science from Stanford University.
Types Forum -- Archives and subscription information for this
moderated mailing list which focuses on semantical, categorical, operational,
and proof theoretical topics relating to type theory.
- Theory of
Computation -- Lecture notes for an undergraduate class taught by
Leonid Levin at UC Berkeley.
- MIT LCS Theory of
Computation Group -- Research areas include
algorithms, complexity theory, computation and biology, cryptography and
information security, distributed systems, numerical analysis and scientific
computing, semantics, and supercomputing technologies.
- DIMACS --
Center for Discrete Mathematics and Theoretical Computer Science, Rutgers, New
- Stanford CS Theory --
Research includes sequential and parallel algorithms, computational problems
in databases, computational geometry, design and analysis of programs and
programming languages, and combinatorial, logical, and algebraic mathematics.
Centre for Discrete Mathematics and Theoretical Computer Science --
Research areas include artificial intelligence, combinatorial optimization,
computability and complexity, and constructive algorithmics.
- CERCS: Center for
Experimental Research in Computer Systems at Georgia Tech -- one of the
largest experimental systems programs in the U.S.
- CERFACS: European Centre for Research and
Advanced Training in Scientific Computation -- One of the world's
leading research institutes, working on efficient algorithms for solving
large-scale scientific problems. This involves the evaluation and development
of tools which exploit high-performance serial, vector, and parallel
- Alate: Research
Group in Algorithms -- Performs research in algorithms: applied,
theoretical, experimental, for serial or parallel computers. Applications
areas include statistics, discrete mathematics and simulation.
for Theoretical Computer Science -- ETH, Zurich. The members are
active in teaching and research in topics including design and analysis of
algorithms, in particular in graph theory and computational geometry; data
structures, in particular for spatial data; computability and complexity;
information security and cryptography; and parallel computation.
- ICS Theory Group --
University of California, Irvine. Research centers on the design and analysis
of algorithms and data structures as well as computational complexity.
Theoretical Computer Science at the University of Waterloo --
Research areas include design and analysis of algorithms, models of
computation, and computational complexity.
Group: Mathematical Structures in Computer Science -- Part of the
Turku Centre for Computer Science, this group performs research in formal
languages, automata, complexity theory, combinatorics on words, semigroups,
universal algebras, term rewriting, concurrency and parallelism, cryptography
and data security.
There is no place like