Papers

• Sorting Networks and Their Applications
• Ten Quick Tips for Effective Dimensionality Reduction
• The Unreasonable Effectiveness of Data
• A Behavioral Notion of Subtyping
• A Case of Redundant Array of Inexpensive Disks
• A Method for the Construction of Minimum Redundancy Codes
• A Universal Algorithm for Sequential Data Compression
• Reflections on Trusting Trust
• The Smalltalk 76 Programming Environment
• A Practical Multi Word Compare and Swap Operation
• Probabilistic Encryption
• Concurrent Tries With Efficient Non Blocking Snapshots
• Dont Thrash How to Cache Your Hash on Flash
• Ideal Hash Trees
• Rrb Trees
• The Chubby Lock Service
• The Rsync Algorithm
• End to End Arguments in System Design
• Solution of a Problem in Concurrent Programming Control
• The Akamai Network
• The Slab Allocator
• A Protocol for Packet Network Intercommunication
• Reflections on Trusting Trust
• The Unix Time Sharing System
• The Two Cultures
• The Unreasonable Effectiveness of Mathematics in the Natural Sciences
• Why Most Published Research Findings Are False
• Counting Large Numbers of Events in Small Registers