Reading List, 2013
Table of Contents
1 Table
| No. | Paper | Team | Date | Slot |
|---|---|---|---|---|
| 1 | Power from Random Strings | Rajiv, Anshul | ||
| 2 | Adaptive Huffman Coding | Manav, Parth | ||
| 3 | Data Compression and String Algorithms | |||
| 4 | Network Coding | |||
| 5 | Slepyan Wolf Coding | Ashudeep, Chandra | ||
| 6 | Common Information | Harsh, Mohit | ||
| 7 | Lower bound for average case of Shellshort | Nitesh,Abhimanyu | 07/11 | 1 |
| 8 | Are random axioms useful? | Pavan | ||
| 9 | Chaitin's Ω | Nimisha | 11/11 | 1 |
| 10 | Levin's incompleteness | Dheeraj | ||
| 11 | Google Similarity distance | Akshay, Pankaj | 07/11 | 3 |
| 12 | A simple proof of the Miller-Yu theorem | Aman, Shivam | 07/11 | 4 |
| 13 | Kelly criterion | Sagar, Nidhi | 09/11 | 1 |
| 14 | Entropy compression and the Lovasz Local Lemma | Chandana, Triya | 14/11 | 1 |
| 15 | Burrows-Wheeler Transform | Richa, Kratika | 09/11 | 2 |
| 16 | Coin balance problem | Shubhdeep, Ashwini | ||
| 17 | Levin's Optimal Search | Dhruv, Pratik | ||
| 18 | Lempel-Ziv compression | Pooja, Kamna |