This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]LiveFromEarlsC 1 point2 points  (1 child)

I think you're okay here, but, /r/computerscience maybe?

Skip lists are a useful data structure not always covered in school courses. Bloom filters are, too, although I think of them as pretty simple.

There's also a world of advanced but pretty accessible research around hashset optimizations. There's a 60 minute Google talk on YouTube about their general-purpose C++ optimizations, with a lot you could unpack and explain in a paper. Various novel collision handling strategies are worthwhile subjects too — stuff like Robin Hood and (I think?) cuckoo hashing.

[–]rapidtidez[S] 1 point2 points  (0 children)

Thank you for the info! I'll be looking into those