Page 3 - Shared Data News Today

A B-tree is a index data structure designed (like all tree data structures) for fast lookup, insert and delete of data items whose key is known. The spe...

Instructor:  Teaching Fellow: Gal Koplewitz, galkop@gmail.com. Office hours: Thursdays 3-4, Maxwell Dworkin second floor lounge. This course examines papers every computer scientist should have read, from the 1930s to the present. It is meant to be a synthesizing experience for advanced students in computer science: a way for them to see the field as a whole, not through a survey, but by reliving the experience of its creation. The idea is to create a unified view of the field of computer s...