Auf dieser Seite finden Sie Informationen über Vorträge folgender Seminare:
Vorträge in chronologischer Reihenfolge
Stochastisches Kolloquium
711 groß
Abstract: We aim to represent a combinatorial object, drawn according to a probability distribution, using close to the minimal number of bits of space, while supporting efficient queries directly on the compressed representation. For many distributions over binary trees, we obtain asymptotically instance-optimal space using a single “universal” data structure, “hypersuccinct trees”. For graphs, we show instance-optimal data structures for preferential attachment graphs generated by the Barabási-Albert model.