« earlier | later » Page 2 of 3
Software Carpentry: Index edit / delete
"Software Carpentry is an intensive introduction to basic software development practices for scientists and engineers." I'd love to teach this...
to cs engineering python science software-engineering teaching ... on 08 February 2010
gmane.comp.java.openjdk.core-libs.devel edit / delete
Two-pivot quicksort. Can this be generalised to N-pivot quicksort (yes), and where's the optimum point for the tradeoff between recursion cost and wrangling pivots?
Main Page - CERCS Multi-Core Repository edit / delete
Teaching materials (although you can't get at the slides...) from Georgia Tech's Intel-related multicore course.
to concurrency cs multicore multicore-msc teaching ... on 04 May 2009
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.
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.
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
« earlier | later » Page 2 of 3
| - cs | |
| 1 | + academia |
| 1 | + academic |
| 1 | + admissions |
| 1 | + ag0700 |
| 1 | + ag0803 |
| 1 | + algorithm |
| 2 | + algorithms |
| 2 | + amusements |
| 2 | + architecture |
| 1 | + benchmarking |
| 1 | + compilation |
| 1 | + complexity |
| 1 | + computability |
| 2 | + computing |
| 2 | + concurrency |
| 1 | + cosmos |
| 1 | + digicomp |
| 1 | + empirical |
| 1 | + engineering |
| 1 | + floating-point |
| 2 | + history |
| 2 | + journal |
| 3 | + maths |
| 1 | + mechanica |
| 1 | + multicore |
| 1 | + multicore-msc |
| 2 | + open-access |
| 1 | + performance |
| 1 | + phd |
| 3 | + programming |
| 1 | + python |
| 1 | + quicksort |
| 1 | + quotes |
| 10 | + research |
| 2 | + retrocomputing |
| 1 | + risc |
| 2 | + scheme |
| 1 | + school |
| 1 | + science |
| 1 | + scotland |
| 1 | + security |
| 1 | + server |
| 1 | + software-engineering |
| 2 | + sorting |
| 1 | + spelling |
| 1 | + statistics |
| 1 | + strategy |
| 10 | + teaching |
| 5 | + theory |
| 1 | + ui |
tasty by Adam Sampson.