Tasty » Adam Sampson's cs bookmarks

P-versus-NP page edit / delete

A list of work proving or disproving P=NP.

to amusements cs research theory ... on 16 November 2008

A Disciplinary Commons in Computing edit / delete

The subject of SAF's seminar yesterday: a big collaborative effort to study how we teach CS -- and learn from other peoples' approaches. The portfolios make fascinating reading.

to cs teaching ... on 16 January 2008

Computers edit / delete

An excellent retrocomputing-oriented guide to "how computers work". Has a particularly good page on different floating-point formats.

to architecture computing cs floating-point retrocomputing teaching ... on 05 March 2007

You Can't Get There From Here edit / delete

A neat little guide to the concept of NP-completeness.

to cs research teaching theory ... on 20 May 2006

Epsilon-Delta: Mathematics and Computer Programming » Modeling a Resource Pool edit / delete

to concurrency cs maths research server theory ... on 20 May 2006

Logical Methods in Computer Science edit / delete

An open-access TCS journal.

to cs journal open-access research theory ... on 27 October 2005

How to Design Programs edit / delete

The better-known Scheme CS textbook.

to cs programming scheme teaching ... on 13 October 2005

Concrete Abstractions edit / delete

A CS introductory text using Scheme. Recommended by Matt.

to cs programming scheme teaching ... on 13 October 2005

Quotes by and about Edsger Dijkstra edit / delete

Dan's excellent collection of Dijkstra quotes.

to amusements cs quotes research ... on 28 August 2005

David S. Johnson - NP-Completeness Columns edit / delete

to cs maths research ... on 10 May 2005