Recent Quotes
-
Voting:
-
0
+
Remember in 11th grade you had these word problems: "Alice is taking a milk bath, the milk is going in at some rate, the chocolate syrup is going in at some rate..."
— Fred Schneider,
On the use of (sometimes gratuitous) formalism.
·
Feb. 26, 2004
·
Permalink
-
Voting:
-
2
+
The purpose of this is for Alice and Bob to have enough knives to do what they want to do for the rest of this dance.
— Fred Schneider,
In a discussion of the SSL protocol.
·
Feb. 24, 2004
·
Permalink
-
Voting:
-
10
+
Let message m be "Naked men mud-wrestling"
— Fred Schneider,
Describing how to use hybrid encryption to send a single encrypted message such that multiple principals (with different keys) can decrypt it. The principals were cable boxes authorized to view (1) sports and (2) dirty movies.
·
Feb. 17, 2004
·
Permalink
-
Voting:
-
-1
+
Electrical engineers are engineers; I don't know about Computer Scientists, really.
— Keshav Pingali,
CS612 lecture
·
Feb. 5, 2004
·
Permalink
-
Voting:
-
0
+
If you like those sort of marketing buzzwords, that's what we're going to focus on in this course.
— Keshav Pingali,
In the introduction to CS612, talking about the self-* buzzwords.
·
Jan. 27, 2004
·
Permalink
-
Voting:
-
3
+
You never want to ! an array.
— Greg Morrisett,
CS 411 lecture; on why arrays in C are never implicitly dereferenced when passed to functions.
·
Nov. 10, 2003
·
Permalink
-
Voting:
-
0
+
You won't find this in any book...
— Charlie Van Loan,
CS421: Preface to the Doctrine of Least Change
·
Oct. 29, 2003
·
Permalink
-
Voting:
-
3
+
I'm famous, you're not.
— Ken Birman,
To students at Brown Bag lunch on "How to give talks".
·
Oct. 28, 2003
·
Permalink
-
Voting:
-
0
+
By the way, one of the things that's not improving over time is the time to watch a movie.
— Hank Levy,
Colloquim
·
Oct. 23, 2003
·
Permalink
-
Voting:
-
0
+
In reality that never usually happens.
— Jayavel Shanmugasundaram,
CS432: Why we don't care about the worst case performance for evaluating relational operators.
·
Oct. 17, 2003
·
Permalink
-
Voting:
-
0
+
There are n - 2 steps. Proof: let n = 5 and look at the blackboard.
— Charlie Van Loan,
Presenting Householder reductions to tri-diagonal form in CS421.
·
Oct. 10, 2003
·
Permalink
-
Voting:
-
1
+
QED: proof by the English language and intimidation.
— Charlie Van Loan,
CS421: "Proving" that the roots of the characteristic polynomials Pk and Pk-1 are distinct.
·
Oct. 10, 2003
·
Permalink