ynamic order statistics OS-SELECT(i, S): returns the i th smallest element in the dynamic set S. OS-RANK(, S): returns the rank ofx E S in the sorted order of s s elements IDEA: Use a red-black tree for the set S, but keep subtree sizes in the nodes
a weakness of hashing Problem: For any hash function h, a set of keys exists that can cause the average access time of a hash table to skyrocket An adversary can pick all keys from tkeU: h(k)=i for some slot i IDEA Choose the hash function at random independently of the keys
I. Writing and Presentation 1. Typo and grammar mistake 2. Sentence and convention 3. Exercise and discussion II. Research Formulation 1. Definition before use 2. Research problem 3. Inadequacy of related work 4. Insight of your proposal 5. Exercise and discussion III. Experimentation 1. Questions and subjects 2. Experimental design 3. Threats to validity 4. Exercise and discussion