go 2

Rob Pike's dotGo 2015 talk argues that Go only seems simple, and that its simplicity hides real complexity that is part of the design. He explains the thinking behind Go's restraint in features.

Rob Pike presents the Go 2 draft specifications at the Sydney Golang Meetup, covering the Go 2 process and several proposals including generics. The Q&A contains a well-known exchange about the name of the language.

Rob Pike's Google I/O 2012 talk shows how goroutines and channels solve tricky concurrency problems with simple Go code. It features a playful goroutine demo with gophers passing messages and a search engine example.

A roughly hour-long live hacking session in which Go team members Andrew Gerrand and Brad Fitzpatrick write the new version of tip.golang.org, the site serving leading-edge Go documentation. It is unedited pair programming on a real Go project.

Rob Pike's GopherCon 2016 talk on the design of the Go assembler, explaining why Go uses a common assembly language translated to each architecture.

Rick Hudson's GopherCon 2015 talk on Go 1.5's new low-latency concurrent garbage collector. It covers the motivation, performance numbers, technical challenges and why the approach fits Go.

Rob Pike presents Go Proverbs at Gopherfest 2015, a set of pithy aphorisms about Go design such as 'Clear is better than clever' and 'A little copying is better than a little dependency'.

Rob Pike's October 2009 Google Tech Talk introducing Go, a new experimental systems language designed for fast builds, concurrency and garbage collection. It covers the goals, syntax and type system.

A fireside Q&A with the Go team (Pike, Thompson, Griesemer and others) at Google I/O 2012. They answer audience questions about Go's design, goals, garbage collection plans and future.

A Google I/O 2011 talk by Andrew Gerrand and Rob Pike on building and deploying a web application in Go. It argues that Go offers speed, reliability and simplicity together.

A JSConf 2014 talk visually breaking down algorithms behind everyday UI patterns, such as dropdown menus that vanish when the mouse drifts and picking the nearest target to the cursor. It shows how these are implemented in JavaScript.

A visualization and sonification of 15 sorting algorithms, from selection sort to bogo sort, run on shuffled integers in six minutes. Each algorithm gets a size and speed scaled to its complexity.

Rob Pike's 2010 talk at OSCON's Emerging Languages Camp on where Go's concurrency style comes from. It traces the idea from Hoare's CSP through Squeak, Newsqueak and Limbo to Go.

Go runtime contributor Dmitry Vyukov looks inside the Go scheduler, explaining how goroutines and channels are implemented. He covers the main scheduler components and overall operation, then goes into details such as preemption and stacks.

An interview with Anders Hejlsberg, lead architect of TypeScript, about porting the TypeScript compiler to Go. He covers the 10x type-checking speedup, lower memory use, and why Go was chosen.

Rob Pike opens GopherCon 2014 with a keynote on the design and evolution of Go. He covers where its ideas came from, including the origin of hello world.

A GopherCon 2014 session where Blake Mizerany replaced his planned talk with a panel discussion with members of the Go team. It covers Go's design choices and community questions.

A short excerpt of Rob Pike's Lang.NEXT 2014 talk where he describes Go's target audience as young Google programmers who are not researchers. The language has to be easy for them to understand and adopt.

Feature-length documentary following DeepMind's AlphaGo program as it prepares for and plays the 2016 match against Go champion Lee Sedol. It covers the team, the games, and the emotional reaction of the Go world to an AI beating a top human.

The Google I/O 2018 keynote led by Sundar Pichai, covering Google's product and platform announcements. Highlights included AI features such as smart replies and the Assistant.

Rob Pike presents Upspin at Gopherfest 2017, an experimental framework for naming and sharing files and data securely and uniformly across a global namespace. It is a project written in Go rather than about Go.

Martin Donald explains the Wave Function Collapse algorithm using Sudoku-like constraint solving and shows how he implemented it with Blender and Godot. It links demos and reference articles.

The Google I/O 2009 keynote introducing Google Wave, a real-time collaborative communication and document platform. It includes a long live demo and the developer preview announcement.

Google's 2008 press announcement of its open source browser, Chrome, featuring Sundar Pichai among the presenters.

The day 2 keynote at Google Cloud Next '17, announcing new GCP and G Suite products with demos and customer stories from Google leaders.

Stanford Blitzscaling class session where Reid Hoffman interviews Eric Schmidt about structuring teams and scaling Google. Topics include Alphabet, hiring, and how Chrome and Android operated inside the company.

Google's "Dear Sophie" Chrome ad, in which a father emails his daughter's life moments to her future self over the years. It portrays an email account as a lifelong keepsake.

Rob Pike shows how the Go text/template lexer is built, using state functions, goroutines and channels. The talk was given at a Google Technology User Group in Sydney in 2011.

Liz Rice live-codes a minimal container runtime in a few lines of Go at GOTO Amsterdam 2018. She explains namespaces, control groups and what a host knows about its containers.

Liz Rice builds a container from scratch in about 100 lines of Go, showing that a container is not a lightweight VM but a set of Linux kernel features and flags.

Two Google engineers perform a mock coding interview and then discuss best practices for candidates, including asking clarifying questions and communicating while solving.

Hungarian folk dancers from Sapientia University act out the quicksort algorithm step by step, with music. It is part of the AlgoRythmics series of sorting algorithms performed as dance.

Andrei Alexandrescu's CppCon 2019 talk revisits sorting, showing how branchless tricks, hybrid strategies and a cost metric can speed up std::sort-style algorithms on modern hardware.

Kevlin Henney revisits structured programming, from Go To Statement Considered Harmful to block-structured code and object orientation. He argues it still matters for how we write code today.

Hyrum Wright shares lessons from five years of mass code migrations in Google's huge C++ codebase. He covers why to migrate, how hard it really is, and how Google updates core libraries and their users continually.

Uber Engineering's Joseph Gilley explains why Uber uses hexagons for geospatial indexing and introduces H3, its open source hierarchical grid system. He covers use cases and how distortion is handled.

A one-minute clip of Peter Norvig saying that Google found programming contest success correlates negatively or poorly with job performance. The description links to a blog post discussing it.

A short CGP Grey bonus video explaining the shortest-splitline algorithm, which draws electoral districts by repeatedly splitting a state along its shortest dividing line while balancing population. It is offered as a neutral, algorithmic fix for gerrymandering.

Peter Norvig's 2007 Google talk on theorizing from data, covering what huge datasets can do for language understanding, translation, information extraction and inference. It argues that more data often beats cleverer models.

A Google Tech Talk by Raymond Blum on how Google backs up massive amounts of data such as Gmail and Picasa. It covers scaling challenges, failure types, and approaches that did not work, including tape.