Main BLOGGER
Google
WWW THIS BLOG
Sunday, November 20, 2005
 
Reading List
http://theory.stanford.edu/~Erajeev/cs361.html#Readings

Lectures 1 and 2 - Should tables be sorted?
Should tables be sorted

Table Should be sorted (on random access machines)

Lectures 3 and 4 - Hashing: Universal and Perfect
Denial of Service via Algorithm Complexity Attack

Store a Sparse Table with O(1) Worst Case Access Time

Lecture 5 - Amortization and List Update Problem
Amortized Efficiency of List Update and Paging Rules

Lecture 6 - Disjoint Sets and Union-Find
Lectures 7 and 8 - Competitive Analysis and Paging
Amortized Efficiency of List Update and Paging Rules


Lectures 9 and 10 - Randomized Online Algorithms
Lecture 11 - Self-Adjusting Search Trees
Lecture 12 - Treaps: Randomized Search Trees
Lecture 13 - Skip Lists
Lecture 14 (part 1) - Caching Queues
Lecture 14 (part 2) - Self-Adjusting and Fibonacci Heaps
Lecture 15 -- Hashing for Massive/Streaming Data
Distinct Sampling for Highly-Accurate Answers to Distinct Value Queries and Event Reports. P. Gibbons. VLDB 2001.
STREAM http://www-db.stanford.edu/stream/demohelp/



<< Home

Powered by Blogger

Google
WWW THIS BLOG