0
Great Works in Computer Science
source link: https://www.cs.virginia.edu/~evans/greatworks/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
cs6501 Spring 2013
Great Works in Computer Science
Schedule
Date | Leader | Topic (handout) | Readings | Additional Background |
15 Jan | David Evans | Intro | ||
17 Jan | David Evans | Computable Numbers | Alan Turing, On Computable Numbers, with an Application to the Entscheidungsproblem (1936) | Charles Petzold, The Annotated Turing |
29 Jan | Longze Chen | Information Protection | Saltzer and Schroeder, The Protection of Information in Computer Systems (1973/1975) | |
31 Jan | Wei Wang | Out-of-order execution | Tomasulo, An Efficient Algorithm for Exploiting Multiple Arithmetic Units (1967) | James Smith and Andrew Pleszkun, Implementing Precise Interrupts in Pipelined Processors (1988) |
5 Feb | David Hall | Public-key cryptography | Whitfield Diffie, The First Ten Years of Public-Key Cryptography (1988) | Whitfield Diffie and Martin Hellman, New Directions in Cryptography (1976) |
7 Feb | Lia Besaleva | Machine learning | Arthur Samuel, Some Studies in Machine Learning Using the Game of Checkers (1967) | 1959 Paper |
12 Feb | Ivan Alagentchev | Return-Oriented Programming | Hovav Shacham, The Geometry of Innocent Flesh on the Bone: Return-into-libc without Function Calls (on the x86) (2007) | Discussion |
14 Feb | Tian Jin | Internet Protocols | David Clark, The Design Philosophy of the DARPA Internet Protocols | Discussion |
19 Feb | Yamina Shams | Digital Logic | Claude Shannon, A Symbolic Analysis of Relay and Switching Circuits (1938) | Discussion |
21 Feb | Charles Hearn | MapReduce | Jeffrey Dean and Sanjay Ghemawat, MapReduce: Simpled Data Processing on Large Clusters (2004) | Discussion |
26 Feb | Robbie Hott | MULTICS | Robert Daley and Jack Dennis, Virtual Memory, Processes, and Sharing in MULTICS (1968) | Discussion |
28 Feb | Ashwin Ganesh | Chord | Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications (2001) | Discussion |
5 Mar | Project Proposals Due | |||
7 Mar | Project Discussion, Writing | |||
12 Mar | Spring Break | |||
14 Mar | Spring Break | |||
19 Mar | Longze Chen | Secrecy Systems | Claude Shannon, Communication Theory of Secrecy Systems, 1949. | Discussion |
21 Mar | David Evans | Computable Numbers (continued) | Alan Turing, On Computable Numbers, with an Application to the Entscheidungsproblem (1936) | Charles Petzold, The Annotated Turing |
26 Mar | Ivan Alagentchev | Sketchpad | Ivan Sutherland, Sketchpad: A man-machine graphical communication system (1963) | Discussion |
28 Mar | Yamina Shams | Ethernet | Robert Metcalfe and David Boggs, Ethernet: Distributed Packet Switching for Local Computer Networks (1976) | Discussion |
2 Apr | Tian Jin | Border Gateway Protocol | Matthew Caesar and Jennifer Rexford, BGP Routing Policies in ISP Networks (2005) | Discussion |
4 Apr | Robbie Hott | The Turing Test | Alan Turing, Computing Machinery and Intelligence (1950) | Discussion |
9 Apr | Matt Hall | Software Engineering | Fred Brooks, Mythical Man (sic) Month, Chapter 2 (1975) | Discussion |
11 Apr | Wei Wang | Linear Programming | Thomas S. Ferguson, Linear Programming: A Concise Introduction (Original: Dantzig, Orden, and Wolfe) | Discussion |
16 Apr | Charles Hearn | |||
18 Apr | Ashwin Ganesh | |||
23 Apr | Lia Besaleva | |||
25 Apr | Project Presentations | |||
29 Apr | Project Presentations |
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK