$\sqrt{\log n}$ (SLOGN) is a new conference in theoretical computer science, narrowly construed, encouraging difficult arguments, analyses, and algorithms. SLOGN aims to regain and support the interest in works that are heavily technically focused. Its goal is to provide a venue for papers that contain pages and pages of involved calculations, heavy-duty math, extensive case analyses, and a general flavor of "grinding it out". When you're sloggin', SLOGN is the conference for you.

A paper about the pi-calculus

"Impossibility of Distributed Consensus with One Faulty Process," Journal of the ACM, April 1985, 32(2):374-382

The Crypto Reading Group is under the auspices of the NYU Cryptography Group, which is part of the NYU Computer Science Department.

We conduct discussions on various topics in cryptography. We consist of faculty and students. Individuals are always wel

Recommended by graydon on his advogato blog

Lecture notes based on Patterson & Hennessy

Abstract: As computer systems become more open and interconnected, the need for reliable and secure communication also increases. In this paper, we introduce a communication device, the Pump, that balances the requirements of reliability and security.

Big downloads (500 Mb / lecture), but I hear these are worth watching.

Singularity is a research project focused on the construction of dependable systems through innovation in the areas of systems, languages, and tools. We are building a research operating system prototype (called Singularity), extending programming languag