The following pages link to Torben Hagerup (Q415280):
Displaying 50 items.
- A strengthened analysis of an algorithm for dominating set in planar graphs (Q415281) (← links)
- Optimal parallel algorithms on planar graphs (Q582094) (← links)
- Optimal merging and sorting on the EREW PRAM (Q582111) (← links)
- Finding the maximum suffix with fewer comparisons (Q635741) (← links)
- A guided tour of Chernoff bounds (Q915256) (← links)
- Improved nonconservative sequential and parallel integer sorting (Q917274) (← links)
- Towards optimal parallel bucket sorting (Q1098305) (← links)
- On saving space in parallel computation (Q1114403) (← links)
- Hybridsort revisited and parallelized (Q1123628) (← links)
- (Q1175942) (redirect page) (← links)
- Improved deterministic parallel integer sorting (Q1175944) (← links)
- On a compaction theorem of Ragde (Q1195502) (← links)
- More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
- Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
- Routing flow through a strongly connected graph (Q1348945) (← links)
- The parallel complexity of integer prefix summation (Q1350241) (← links)
- Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
- Dynamic algorithms for graphs of bounded treewidth (Q1578413) (← links)
- Space-efficient Euler partition and bipartite edge coloring (Q1628587) (← links)
- Parallel preprocessing for path queries without concurrent reading. (Q1854339) (← links)
- Trimming of graphs, with application to point labeling (Q1959389) (← links)
- Rank-select indices without tears (Q2285085) (← links)
- Highly succinct dynamic data structures (Q2291412) (← links)
- Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster (Q2300733) (← links)
- Fast breadth-first search in still less space (Q2301537) (← links)
- Fast integer merging on the EREW PRAM (Q2365176) (← links)
- Simpler computation of single-source shortest paths in linear average time (Q2432528) (← links)
- Fast parallel space allocation, estimation, and integer sorting (Q2508339) (← links)
- (Q2754134) (← links)
- (Q2762514) (← links)
- Deterministic Dictionaries (Q2765957) (← links)
- Optimal parallel string algorithms (Q2817630) (← links)
- Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
- Kernels for Edge Dominating Set: Simpler or Smaller (Q2912748) (← links)
- Easy Multiple-Precision Divisors and Word-RAM Constants (Q2946407) (← links)
- Space-efficient Basic Graph Algorithms (Q2955003) (← links)
- (Q3046471) (← links)
- (Q3140395) (← links)
- Drawing Graphs in the Plane with High Resolution (Q3142593) (← links)
- Planar Depth-First Search in $O(\log n)$ Parallel Time (Q3474884) (← links)
- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs (Q3508562) (← links)
- Online and Offline Access to Short Lists (Q3525612) (← links)
- Finding the Maximum Suffix with Fewer Comparisons (Q3563013) (← links)
- A Pictorial Description of Cole’s Parallel Merge Sort (Q3644720) (← links)
- (Q3727396) (← links)
- Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones (Q3774930) (← links)
- (Q3783597) (← links)
- (Q3795245) (← links)
- (Q3974857) (← links)
- (Q3975142) (← links)
