The design of transparent telemetry

Version SAT (by Russ Cox, on why dependency resolution is NP-hard in the general case, and which practical solutions exist)

Go Proposals

Go’s Version Control History

What NPM Should Do Today to Stop a New Colors Attack Tomorrow

Minimal Boolean Formulas

On “Trojan Source” Attacks

Updating the Go Memory Model

Programming Language Memory Models

Hardware Memory Models

Unix Viruses (2008)

The Generic Dilemma (2009)

research!rsc: Zip Files All The Way Down

QArt Codes (2012) - Embedding an image into QR codes

A Tour of Acme (2012)

Our Software Dependency Problem

research!rsc: Glob Matching Can Be Simple And Fast Too

The Principles of Versioning in Go

Using Uninitialized Memory for Fun and Profit

research!rsc: Go Proposal Process: Enabling Experiments (Go Proposals, Part 5)

research!rsc: Go Proposal Process: Scaling Discussions (Go Proposals, Part 4)

research!rsc: Go Proposal Process: Large Changes (Go Proposals, Part 3)

rsc: Thinking about the Go Proposal Process (Go Proposals, Part 1)

rsc: Go Proposal Process: Clarity & Transparency (Go Proposals, Part 2)

Transparent Logs for Skeptical Clients

An Encoded Tree Traversal

Our Software Dependency Problem

Computing History at Bell Labs

QArt Codes (2012)

Dependency hell is NP-complete (2016)

More →