Algorithms and complexity

write the paper in one of the following:
— Coalesced Hashing
— Cuckoo Hashing
— Hopscotch Hashing
— Perfect Hashing
— Robin Hood Hashing

WHAT TO INCLUDE
You can think the topic you select is a problem, and you want to present
its solution. The topic should be presented in a manner so that anyone
with an undergraduate level background in data structures and algorithms
can understand it. If your paper is on a topic in hashing, please
directly present your selected topic; general information on hashing
and hash function should be avoided.

Your paper may include a general description of the problem and its
importance, solution to the problem with small easy to understand
examples, any special cases, limitations, applications, summary of
complexity analysis, important results and findings in that particular
area, anything you feel important and especially interesting, a list of
references, etc.

PAPER FORMAT
The paper should be at least three pages in length when list of references
is excluded. There should be at least two pages equivalent area for text
and the rest can be used for figures, graphs, diagrams, etc. Format of
the paper: two-column, 5/16″ separation between columns, 1/2″ margin,
single spaced lines, 10 point times roman font. In-text citation
is required. Although MLA citation style is perfectly acceptable,
the course encourages the use of IEEE citation style which is used in
numerous technical literature in computing discipline.