Data Structures

Efficient computation depends on how data is organized and maintained. We design and analyze data structures that support fast queries and updates while using memory economically. Our research explores the trade-offs between query time, update time, and storage space, including the opportunities offered by randomization. We develop methods for fundamental tasks such as hashing and maintaining ordered data, and establish lower bounds that clarify the limits of achievable performance.