Algorithm and complexity

SELECTION OF A TOPIC You can select a topic to write the paper in one of the following — Coalesced Hashing — Cuckoo Hashing — Hopscotch Hashing — Perfect Hashing — Robin Hood Hashing FINDING INFORMATION For most topics, google and google scholar searches will result in sufficient amount of original information. Adding ‘PDF’ or ‘+PDF” to the searches might be helpful. Electronic databases such as IEEE Xplore and ACM Digital Library when accessed through OU Kresge Library will provide additional information if necessary. Sometime PDF books, lecture slides, Wikipedia entries, and youtube videos might be helpful but please be selective. 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.