-
Notifications
You must be signed in to change notification settings - Fork 32
/
FacultyAlgorithmChallenge.md.html
466 lines (460 loc) · 21.1 KB
/
FacultyAlgorithmChallenge.md.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>FacultyAlgorithmChallenge.md</title>
<link rel="stylesheet" href="https://stackedit.io/style.css" />
</head>
<body class="stackedit">
<div class="stackedit__left">
<div class="stackedit__toc">
<ul>
<li><a href="#guidelines-for-evaluation">Guidelines for Evaluation</a>
<ul>
<li><a href="#faculty-eli5-algorithm-teaching-feat-challenge-feat">Faculty ELi5 Algorithm Teaching (FEAT) challenge #FEAT</a></li>
</ul>
</li>
<li><a href="#inspiration-for-algorithmic-challenge">Inspiration for Algorithmic Challenge</a>
<ul>
<li><a href="#algorithms-at-work">Algorithms at work</a></li>
<li><a href="#dictionary-of-algorithms-and-ds-dads">Dictionary of Algorithms and DS (DaDS)</a></li>
<li><a href="#quora-based">Quora Based</a></li>
<li><a href="#misc">Misc</a></li>
<li><a href="#stackoverflow-tcs-theoretical-computer-science">Stackoverflow TCS (Theoretical Computer Science)</a></li>
<li><a href="#personality-based">Personality based</a></li>
<li><a href="#nine-algorithms-that-change-the-world">Nine Algorithms that change the World</a></li>
<li><a href="#timeline-of-computer-science">Timeline of Computer Science</a></li>
</ul>
</li>
<li><a href="#the-next-50-years-of-computing-by-mit">The Next 50 years of Computing by MIT</a>
<ul>
<li><a href="#session-1">SESSION 1</a></li>
<li><a href="#session-ii">SESSION II</a></li>
<li><a href="#session-iii">SESSION III</a></li>
<li><a href="#session-iv">SESSION IV</a></li>
<li><a href="#session-v">SESSION V</a></li>
<li><a href="#session-vi">SESSION VI</a></li>
</ul>
</li>
</ul>
</div>
</div>
<div class="stackedit__right">
<div class="stackedit__html">
<h1 id="guidelines-for-evaluation">Guidelines for Evaluation</h1>
<p><a href="http://j.mp/facultyPK">http://j.mp/facultyPK</a></p>
<h2 id="faculty-eli5-algorithm-teaching-feat-challenge-feat">Faculty ELi5 Algorithm Teaching (FEAT) challenge <code>#FEAT</code></h2>
<h3 id="update-2">UPDATE 2</h3>
<p>The key thing is <code>ELi5</code> -> “Explain Like I am 5” applies to the part of explaining the algorithm. Of course, for the real world use case, they might want to target a more mature audience. The faculty presentation will be scored on</p>
<ul>
<li>the power and elegance of algorithm</li>
<li>the interestingness and entertainment value of the real world application</li>
<li>the style and content of the presenter and his presentation</li>
</ul>
<p><strong>OBJECTIVE</strong>: To tell the world why you as a CSE faculty care about<br>
algorithms, which is the bedrock of Computer Science. Secondly, your<br>
presentation must motivate and inspire your peers and students to adopt an<br>
algorithm of their choice and be inspired to make a presentation which is as<br>
fascinating as yours.</p>
<p><strong>IMPORTANT</strong>: Bonus points for adopting PechaKucha format, and sticking to 400<br>
seconds (20 by 20). No more than 10 minutes, whatsoever.</p>
<blockquote>
<ol>
<li>Personality of the presentation - there is no right or wrong in your<br>
choice of algorithm. All that matters, why are <em>you</em> passionate about the<br>
algorithm and what about it is so fascinating from your perspective?</li>
<li>Choose at least one real-world application that the algorithm finds use<br>
for. Don’t choose more than two. Describe the real-world application.</li>
<li>Show the code for the algorithm either in pseudo code or your favourite<br>
language</li>
<li>Choose whatever format makes sense to you to present all the above three.<br>
Bring your creativity to the fore.</li>
</ol>
</blockquote>
<h1 id="inspiration-for-algorithmic-challenge">Inspiration for Algorithmic Challenge</h1>
<p>How do I go about finding algorithms to get inspired by? Visit any of the<br>
following links.</p>
<h2 id="algorithms-at-work">Algorithms at work</h2>
<ul>
<li><a href="http://j.mp/algoAtWork">http://j.mp/algoAtWork</a></li>
</ul>
<h2 id="dictionary-of-algorithms-and-ds-dads">Dictionary of Algorithms and DS (DaDS)</h2>
<p><a href="https://xlinux.nist.gov/dads/">https://xlinux.nist.gov/dads/</a></p>
<h2 id="quora-based">Quora Based</h2>
<ul>
<li><a href="http://j.mp/AlgoKG">http://j.mp/AlgoKG</a></li>
<li><a href="https://www.quora.com/What-is-the-most-clever-yet-simple-algorithm">https://www.quora.com/What-is-the-most-clever-yet-simple-algorithm</a></li>
<li><a href="https://www.quora.com/Which-are-the-10-algorithms-every-computer-science-student">https://www.quora.com/Which-are-the-10-algorithms-every-computer-science-student</a><br>
-must-implement-at-least-once-in-life</li>
<li><a href="https://www.quora.com/What-are-some-interesting-algorithms-that-have-no-known-im">https://www.quora.com/What-are-some-interesting-algorithms-that-have-no-known-im</a><br>
plementation-to-date</li>
</ul>
<h2 id="misc">Misc</h2>
<ul>
<li><a href="http://j.mp/algo2KG">http://j.mp/algo2KG</a></li>
<li><a href="http://www.scriptol.com/programming/list-algorithms.php">http://www.scriptol.com/programming/list-algorithms.php</a> by various<br>
application domains</li>
<li><a href="http://www.scriptol.com/programming/graphic-algorithms.php">http://www.scriptol.com/programming/graphic-algorithms.php</a></li>
<li><a href="http://blog.hackerearth.com/2015/05/top-7-algorithms-and-data-structures-every-programmer-should-know-about.html">http://blog.hackerearth.com/2015/05/top-7-algorithms-and-data-structures-every-programmer-should-know-about.html</a></li>
<li><a href="http://interviewkickstart.com/curriculum">http://interviewkickstart.com/curriculum</a> - what you need to know to get<br>
employed at leading tech companies</li>
</ul>
<h2 id="stackoverflow-tcs-theoretical-computer-science">Stackoverflow TCS (Theoretical Computer Science)</h2>
<ul>
<li><a href="https://cstheory.stackexchange.com/questions/189/algorithms-from-the-book">https://cstheory.stackexchange.com/questions/189/algorithms-from-the-book</a>
<ul>
<li><a href="https://cstheory.stackexchange.com/questions/189/algorithms-from-the-book">Euclid’s Algorithm</a> features in this list</li>
<li>And also on this list - <a href="https://cstheory.stackexchange.com/a/10422/12933">https://cstheory.stackexchange.com/a/10422/12933</a></li>
<li>From <a href="https://softwareengineering.stackexchange.com/questions/20128/which-are-the-significant-algorithms-for-humankind-in-past-decades">Software Engineering SO</a></li>
</ul>
</li>
</ul>
<h2 id="personality-based">Personality based</h2>
<ul>
<li>
<p>50 ways MIT has transformed computing - <a href="http://j.mp/mitCSE">http://j.mp/mitCSE</a></p>
</li>
<li>
<p><a href="http://www.informit.com/articles/article.aspx?p=2213858">http://www.informit.com/articles/article.aspx?p=2213858</a> - what Knuth thinks<br>
of algorithms (search for “algorithm” across the article)</p>
<ul>
<li><a href="https://news.ycombinator.com/item?id=10897460">https://news.ycombinator.com/item?id=10897460</a> - Hackers on Knuth’s books</li>
</ul>
</li>
<li>
<p><a href="https://www.quora.com/What-is-Professor-Thomas-Cormens-favorite-algorithm">https://www.quora.com/What-is-Professor-Thomas-Cormens-favorite-algorithm</a></p>
<ul>
<li>It’s not an algorithm, but a data structure. I’ve always marveled at<br>
the simple tree-based data structure for disjoint-set union, using union by<br>
rank and path compression (Section 21.3 in the third edition of CLRS). The<br>
code is amazingly simple, the data structure operations take just barely<br>
superlinear time, and the analysis (by Bob Tarjan) blows my mind.</li>
</ul>
</li>
<li>
<p><a href="https://www.quora.com/What-are-some-of-the-most-ingenious-algorithms-in-computer-science/answer/Keith-Adams?srid=ul6v">Slack’s Keith Adams, Chief Architect</a> favourites</p>
<ul>
<li>Skip lists</li>
<li>Paxos</li>
<li>The “state machine” family of lock-free algorithms.</li>
</ul>
</li>
<li>
<p><a href="http://www.siam.org/pdf/news/637.pdf">http://www.siam.org/pdf/news/637.pdf</a> - SIAM News, Volume 33, Number 4</p>
</li>
<li>
<p><a href="https://www.computer.org/csdl/mags/cs/2000/01/c1022.html">https://www.computer.org/csdl/mags/cs/2000/01/c1022.html</a> - American<br>
Institute of Physics and the IEEE Computer Society</p>
<ul>
<li>Comments about it on <a href="https://www.reddit.com/r/programming/comments/1qztc0/from_the_ieee_computer_society_journal_the_top_10">reddit</a></li>
</ul>
</li>
</ul>
<h2 id="nine-algorithms-that-change-the-world">Nine Algorithms that change the World</h2>
<p>An algorithm is a well defined procedure for performing a task. A household<br>
example of an algorithm is a recipe – for example, the list of ingredients<br>
together with the sequence of instructions needed to bake a pie. In order for a<br>
computer to perform a task, it needs ingredients – the data – and<br>
instructions – the algorithm.</p>
<p>Author John MacCormick, currently Professor of Computer Science at Dickinson<br>
College, has chosen nine important tasks performed by computers and explained<br>
the algorithms that are used. In a chapter devoted to each, he explains:</p>
<ul>
<li>The development of search engines – how to find information on the internet.</li>
<li>The PageRank process used by Google to produce highly relevant search<br>
results.</li>
<li>Public-key cryptography, enabling secure transmission of secret messages –<br>
such as your credit card number – over open communication channels.</li>
<li>Methods for detecting errors in data transmission and automatically<br>
correcting them.</li>
<li>Several pattern recognition techniques, illustrated by classifying<br>
handwritten numbers, facial recognition, and decision trees.</li>
<li>Data compression. Storing text, music, and images efficiently.</li>
<li>Databases. Storing and retrieving information efficiently. Techniques for<br>
modifying databases reliably, even when computers crash while the modification<br>
is in progress.</li>
<li>Digital signatures. How to be certain data is trustworthy.</li>
<li>Deciding what is computable.</li>
</ul>
<p>Even though the techniques that enable these algorithms are complex, Dr.<br>
MacCormick explains them in a clear and interesting manner using well<br>
constructed examples.</p>
<p>I highly recommend this book for a fascinating and easily accessible look at<br>
the core of computer science and its application to everyday lives.</p>
<h2 id="timeline-of-computer-science">Timeline of Computer Science</h2>
<p>Please read <a href="https://www.scottaaronson.com/blog/?p=524">https://www.scottaaronson.com/blog/?p=524</a> and<br>
<a href="https://www.scottaaronson.com/blog/?p=608">https://www.scottaaronson.com/blog/?p=608</a> (including the zillion comments<br>
below).</p>
<p><strong>CS timeline voting: the results are in!</strong></p>
<h3 id="the-top-10">The top 10</h3>
<ol>
<li>Euclid’s Elements: 116 votes</li>
<li>Turing’s “On Computable Numbers”: 110 votes</li>
<li>Gödel’s Incompleteness Theorem: 107 votes</li>
<li>Gödel’s P vs. NP Letter to von Neumann: 106 votes</li>
<li>George Boole’s Logic: 88 votes</li>
<li>Shor’s Algorithm: 88 votes</li>
<li>Wikipedia: 85 votes</li>
<li>Claude Shannon’s Digital Logic: 82 votes</li>
<li>PRIMES in P: 82 votes</li>
<li>Cook-Levin Theorem: 80 votes</li>
</ol>
<h3 id="the-rest">The rest</h3>
<p>Al-Khwarizmi’s “On the Calculation with Hindu Numerals”: 79 votes<br>
Bardeen, Brattain, and Shockley Invent Transistor: 79 votes<br>
Babbage’s Analytical Engine: 77 votes<br>
Tim Berners-Lee Invents WWW: 75 votes<br>
Fast Fourier Transform: 73 votes<br>
Brin and Page Create Google: 73 votes<br>
von Neumann Architecture: 71 votes<br>
RSA: 70 votes<br>
Hilbert Calls for Mechanization of Mathematical Reasoning: 69 votes<br>
Simplex Algorithm: 69 votes<br>
Claude Shannon Formalizes Cryptography: 68 votes<br>
Dijkstra’s Algorithm: 68 votes<br>
Gaussian Elimination Described in Ancient China: 67 votes<br>
Quicksort: 65 votes<br>
UNIX and C: 65 votes<br>
Newton’s Method: 64 votes<br>
Leibniz Describes Binary Notation, Calculus Ratiocinator: 64 votes<br>
First Program written by Ada Lovelace: 64 votes<br>
Gauss’s Disquisitiones Arithmeticae: 62 votes<br>
Monte Carlo Method: 62 votes<br>
“Bit” Coined: 62 votes<br>
TeX Typesetting: 62 votes<br>
Ginsparg Creates arXiv: 61 votes<br>
Kleene Invents Regular Expressions: 61 votes<br>
McCarthy Invents LISP: 59 votes<br>
“The Art of Computer Programming”: 59 votes<br>
TCP/IP Protocol: 58 votes<br>
Strassen’s Algorithm: 58 votes<br>
PCP Theorem: 56 votes<br>
Turing Test: 55 votes<br>
Randomized Primality Testing: 55 votes<br>
IP=PSPACE: 55 votes<br>
Scott and Rabin’s Paper on Nondeterminism: 54 votes<br>
Jacquard Loom: 54 votes<br>
Colossus Begins Operation at Bletchley Park: 53 votes<br>
Integrated Circuit: 53 votes<br>
Chomsky Hierarchy: 52 votes<br>
Pascal Builds Arithmetic Machine: 51 votes<br>
First Genome Sequenced: 51 votes<br>
Reed-Solomon Codes: 50 votes<br>
Time Hierarchy Theorem: 50 votes<br>
ARPAnet: 49 votes<br>
Four Color Map Theorem Proved: 49 votes<br>
Linux: 49 votes<br>
Diophantine Equations Proved Undecidable: 46 votes<br>
Feynman Suggests Quantum Computing: 46 votes<br>
Deep Blue Defeats Kasparov: 46 votes<br>
Solomonoff-Kolmogorov-Chaitin Complexity: 44 votes<br>
Lempel-Ziv Data Compression: 43 votes<br>
GPS: 42 votes<br>
Marian Rejewski’s “Bombe” + Alan Turing’s Improvements: 41 votes<br>
Diffie-Hellman Public Key Exchange Protocol: 41 votes<br>
Zuse’s Z1: 40 votes<br>
Viterbi Algorithm: 40 votes<br>
First Email Message: 38 votes<br>
Pseudorandom Generators: 37 votes<br>
Oughtred Invents Slide Rule: 36 votes<br>
FORTRAN: 36 votes<br>
ENIAC: 35 votes<br>
Semaphores: 35 votes<br>
Gottlob Frege’s “Begriffsschrift”: 34 votes<br>
Grace Murray Hopper Creates A-O Compiler: 34 votes<br>
Conway’s Game of Life: 34 votes<br>
Xerox Parc’s Alto With First GUI: 33 votes<br>
Kuttaka Algorithm from Ancient India: 32 votes<br>
Scientific Computing During Manhattan Project: 30 votes<br>
Wilkes, Wheeler, and Gill Define Closed Subroutines: 29 votes<br>
Stroustrup creates C++: 28 votes<br>
Zimmermann creates PGP: 28 votes<br>
Dartmouth Conference Popularizes Term “AI”: 27 votes<br>
Moore’s Law: 27 votes<br>
Boosting in Machine Learning: 27 votes<br>
Codd Proposes Relational Databases: 26 votes<br>
Ethernet Invented: 26 votes<br>
Valiant Proposes PAC-Learning: 26 votes<br>
Stallman Writes GNU Manifesto: 25 votes<br>
Wiesner Proposes Quantum Money and Multiplexing: 24 votes<br>
Antikythera Mechanism: 23 votes<br>
BitTorrent: 23 votes<br>
Low-Density Parity Check Codes: 23 votes<br>
McCulloch and Pitts’ “A Logical Calculus Immanent in Nervous Activity”: 22 votes<br>
Engelbart and English Invent Mouse: 22 votes<br>
Dijkstra’s “Go To Statement Considered Harmful”: 22 votes<br>
Back-Propagation: 22 votes<br>
MIT SAGE Creates First Large-Scale Computer Network: 21 votes<br>
Vannevar Bush Creates First Large-Scale Analog Calculator: 20 votes<br>
IBM Introduces Hard Drive: 20 votes<br>
Checkers Solved: 20 votes<br>
First Packet-Switching Network: 20 votes<br>
Atanasoff and Berry’s Vaccum-tube Computer: 19 votes<br>
Vannevar Bush’s “As We May Think”: 19 votes<br>
Hollerith’s Electromechanical Counting Machine: 18 votes<br>
MIT Builds First Time-Sharing System: 18 votes<br>
First Computer Virus: 18 votes<br>
IEEE Floating-Point Standard: 18 votes<br>
IBM PC: 18 votes<br>
“Spacewar!”, First Computer Game: 17 votes<br>
RISC Architecture: 17 votes<br>
Intel’s 8086: 17 votes<br>
al-Jazari’s Water Clocks and Musical Automata: 17 votes<br>
Edward Lorenz (Re)discovers Chaos Theory: 16 votes<br>
Apollo Guidance Computer: 16 votes<br>
CAPTCHAs: 16 votes<br>
VC Dimension: 16 votes<br>
Macsyma Computer Algebra System: 15 votes<br>
<a href="http://Amazon.com">Amazon.com</a>: 15 votes<br>
UNIVAC I: 13 votes<br>
DaVinci Surgical Robot: 13 votes<br>
Mark II Incident Popularizes Word “Bug”: 12 votes<br>
Weizenbaum Creates ELIZA: 12 votes<br>
ASCII: 11 votes<br>
TI Handheld Calculator: 11 votes<br>
Simula 67: 11 votes<br>
MIT Whirlwind I Displays Graphics: 10 votes<br>
Sketchpad, First CAD Software: 10 votes<br>
NCSA Mosaic: 10 votes<br>
Robert Morris’ Computer Worm: 9 votes<br>
Pixar Releases “Toy Story”: 9 votes<br>
Stuxnet Worm: 9 votes<br>
IBM System/360: 8 votes<br>
Mac Hack Chess Program: 7 votes<br>
Microsoft Windows: 7 votes<br>
Sojourner on Mars: 7 votes<br>
BASIC: 6 votes<br>
Apple Macintosh: 6 votes<br>
SETI@home: 6 votes<br>
IBM’s Watson Wins At Jeopardy!: 5 votes<br>
Atari’s Pong: 4 votes<br>
Atlas Computer in Manchester: 4 votes<br>
Norbert Wiener Founds Cybernetics: 3 votes<br>
First ATM in Tokyo: 3 votes<br>
Youtube Launched: 3 votes<br>
VisiCalc: 2 votes<br>
Jevon’s Logic Piano: 1 vote<br>
Apple II: 1 vote<br>
Adobe PostScript: 1 vote<br>
SABRE Travel Reservation System: 0 votes<br>
Fischer-Lynch-Paterson Theorem: 0 votes<br>
Facebook, Twitter Use in Egypt Revolution: 0 votes<br>
First Machine Translation Demonstration: -1 vote<br>
Usenet: -1 vote<br>
Akamai: -2 votes<br>
TX-0: -3 votes<br>
CDC 6600: -3 votes<br>
Compact Disc Invented: -3 votes<br>
Aiken’s Mark I: -4 votes<br>
CM-1 Connection Machine: -4 votes<br>
Whirlwind I Displays Graphics: -5 votes<br>
Floppy Disk Invented: -6 votes<br>
MITS Altair Microcomputer and Microsoft BASIC: -6 votes<br>
Axelrod’s “The Evolution of Cooperation”: -7 votes<br>
Microsoft Office: -7 votes<br>
Pentium FDIV Bug: -7 votes<br>
EDSAC: -8 votes<br>
UNIMATE, First Industrial Robot: -9 votes<br>
CLU Programming Language: -9 votes<br>
1ESS Switching System: -11 votes<br>
UNIVAC Predicts Presidential Election: -12 votes<br>
Stanford Arm: -13 votes<br>
“2001 A Space Odyssey” Introduces HAL: -15 votes<br>
“Spam” Coined: -16 votes<br>
First Denial-of-Service Attack: -17 votes<br>
Y2K Bug: -18 votes<br>
Facebook Launched: -18 votes<br>
Nintendo’s Donkey Kong: -19 votes<br>
“Robot” Coined: -21 votes<br>
CSIRAC -21<br>
Apple’s iPhone: -21 votes<br>
Slashdot: -27 votes<br>
Godwin’s Law: -29 votes<br>
Asimov’s Three Laws of Robotics: -32 votes<br>
<a href="http://Match.com">Match.com</a>: -34 votes<br>
de Vaucanson’s Mechanical Duck: -39 votes<br>
von Kempelen’s Mechanical Turk: -52 votes</p>
<h1 id="the-next-50-years-of-computing-by-mit">The Next 50 years of Computing by MIT</h1>
<p><a href="http://mac50.csail.mit.edu/agenda.html">http://mac50.csail.mit.edu/agenda.html</a></p>
<h2 id="session-1">SESSION 1</h2>
<p>9:00 AM<br>
Fifty Years of Robotics; Now the Practical Payoff<br>
Rodney Brooks, Rethink Robotics, Inc</p>
<p>Tales from the Blocks World<br>
Matt Mason, Carnegie Mellon University</p>
<p>Dynamic Robots<br>
Marc Raibert, Boston Dynamics</p>
<p>Aerial Robots: Computing in the Sky<br>
Russ Tedrake, MIT CSAIL</p>
<p>The Analysis Revolution in Genomics and Modern Medicine<br>
Manolis Kellis, MIT CSAIL</p>
<p>10:30 AM - BREAK</p>
<h2 id="session-ii">SESSION II</h2>
<p>11:00 AM</p>
<p>Akamai: From Theory to Practice<br>
Tom Leighton, Akamai Technologies</p>
<p>Everyday Life in a Data-Rich World<br>
Jon Kleinberg, Cornell University</p>
<p>The Evolution of Proofs in Computer Science<br>
Yael Tauman Kalai, Microsoft Research</p>
<p>Quantum Computing and Fundamental Physics<br>
Scott Aaronson, MIT CSAIL</p>
<p>12:25 PM - LUNCH</p>
<h2 id="session-iii">SESSION III</h2>
<p>2:00 PM<br>
Towards a Theory of Trust in Networks of Humans and Computers<br>
Jeannette Wing, Microsoft Research</p>
<p>Harmonizing Technology with Society<br>
Latanya Sweeney, Harvard University</p>
<p>On the Benefits of Coordination – Before, During, and Even After the Fact!<br>
– in Differential Privacy<br>
Cynthia Dwork, Microsoft Research</p>
<p>The Scalable Commutativity Rule: Designing Scalable Software for Multicore<br>
Processors<br>
Nickolai Zeldovich, MIT CSAIL</p>
<p>3:25 PM - BREAK</p>
<h2 id="session-iv">SESSION IV</h2>
<p>4:00 PM<br>
Time Sharing vs Personal Computing<br>
Ivan Sutherland, Portland State University</p>
<p>The End of Moore’s Law and the Future of Computing<br>
Bill Dally, Stanford University</p>
<p>How I invented Ethernet at MIT Project MAC 1969-1972<br>
Bob Metcalfe, The University of Texas at Austin</p>
<p>5:20 PM – ADJOURN</p>
<p>Banquet Dinner – Cambridge Marriott Hotel - Grand Ballroom<br>
7:00-9:00 PM<br>
Recognition of Bob Fano<br>
Entertainment by ImprovBoston</p>
<p>Thursday, May 29, 2014<br>
Location: MIT Stata Center, 32-123 Kirsch Auditorium</p>
<p>8:00 AM Continental Breakfast/Registration</p>
<h2 id="session-v">SESSION V</h2>
<p>9:00 AM<br>
Turtles All the Way Down<br>
Greg Papadopoulos, New Enterprise Associates</p>
<p>Graduate Education and Research in the Information Age<br>
Daniel Huttenlocher, Cornell Tech NYC</p>
<p>Some Surprising Lessons Learned while Creating a Real MOOC-based Masters of<br>
Science<br>
Charles Isbell, Georgia Institute of Technology</p>
<p>10:20 AM - BREAK</p>
<h2 id="session-vi">SESSION VI</h2>
<p>10:50 AM<br>
Small, n=me, data<br>
Deborah Estrin, Cornell Tech NYC</p>
<p>The Right Thing: Things We Hit, Things We Missed, Things Still Left To Do<br>
Tom Knight, Ginko Bioworks</p>
<p>Teaching Computers to See<br>
Antonio Torralba, MIT CSAIL</p>
<p>Modeling Brain Connectivity from Functional MRI<br>
Polina Golland, MIT CSAIL</p>
<p>Reflections of an Entrepreneur on Experiences at MIT Then and Now<br>
Ray Stata, Analog Devices, Inc</p>
<hr>
<p>End of File</p>
</div>
</div>
</body>
</html>