and process data efficiently using sophisticated data structures and algorithms Design algorithms and analyze their complexity in terms of running time and space usage Create applications that are ...

data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search trees, hash tables, priority queues, graphs, shortest paths, ...

The student is also exposed to the notion of a faster algorithm and asymptotic complexity ... useful data structure that allows for efficient search and retrieval from large amounts of data. We will ...

Yuanzhao Zhang, an SFI Complexity Postdoctoral ... and his collaborators describe a novel algorithm that can infer the structure of a hypergraph using only the observed dynamics. Their algorithm uses ...