5 citations · 12 across the 6 of their papers we have counts for
10 papers
Still Simpler Static Level Ancestors
Torben Hagerup
A level-ancestor or LA query about a rooted tree takes as arguments a node in , of depth , say, and an integer with and returns the ancestor of…
Fast Breadth-First Search in Still Less Space
Torben Hagerup
It is shown that a breadth-first search in a directed or undirected graph with vertices and edges can be carried out in time with bits of…
Small Uncolored and Colored Choice Dictionaries
Torben Hagerup
A choice dictionary can be initialized with a parameter and subsequently maintains an initially empty subset of under insertion, deletion, mem…
Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model
Torben Hagerup
A new algorithm, Guidesort, for sorting in the uniprocessor variant of the parallel disk model (PDM) of Vitter and Shriver is presented. The algorithm is deterministic and executes…
Space-Efficient DFS and Applications: Simpler, Leaner, Faster
Torben Hagerup
The problem of space-efficient depth-first search (DFS) is reconsidered. A particularly simple and fast algorithm is presented that, on a directed or undirected input graph $G=(V,E…
An Optimal Choice Dictionary
Torben Hagerup
A choice dictionary is a data structure that can be initialized with a parameter and subsequently maintains an initially empty subset of u…