DSzoo

Introduction
Welcome to the DataStructures Zoo. This project was inspired by the success of the Complexity Zoo and the need to systematize data-structure knowledge.

Mission Statement

 * spelling of lower-bounds and data-structures
 * we study problems, not implementations (eg predecessor vs van Emde Boas)

Concepts

 * models (cell-probe, RAM, pointer machine, comparison, algebraic)
 * what is a problem? (static vs dynamic, language membership)
 * lowerbounds (inc. communication complexity)
 * rank space

Problems

 * exact search
 * problems in one-dimension:
 * search problems:
 * predecessor
 * segment stabbing
 * exact searching (dictionaries, membership)


 * problems in rank space:
 * partial sums (rank and select, list-indexing)
 * range-minimum query, RMQ (priority range search, $$1 \frac{1}{2}$$-dimensional searching)


 * priority queues


 * 1) low-dimensional geometry:


 * 1) high-dimensional geometry: