Tim Roughgarden - Andreessen Horowitz

Tim Roughgarden is a Professor in the Computer Science Department at Columbia University. Prior to joining Columbia, he spent 15 years on the computer science faculty at Stanford, following a PhD at Cornell and a postdoc at UC Berkeley. He works on the boundary of computer science and economics, and on the design, analysis, applications, and limitations of algorithms. He is also a Research Partner on the a16z Crypto team.

From @algo_class

Tim Roughgarden@algo_class

Talk by @ericneyman on recent work that we (mostly, he) did on QA pooling (a general theory of forecast aggregation): https://t.co/4QmEryViIi We give a generic way of compiling a proper scoring rule into an aggregation method that is optimal (in various senses) w.r.t. that rule.

Tim Roughgarden@algo_class

Some musings on teaching from a lunch talk awhile back: https://t.co/19vOXpxcjs

Tim Roughgarden@algo_class

"Perhaps the most important principle for the good algorithm designer is to refuse to be content." (A favorite quote, from the 1974 book "The Design and Analysis of Computer Algorithms" by Aho, Hopcroft, and Ullman. Even today, algorithms are taught according to their blueprint.)