BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Canada
1 × Denmark
1 × Germany
1 × Hungary
1 × Spain
1 × Sweden
1 × Switzerland
2 × Italy
2 × USA
Collaborated with:
∅ K.Mehlhorn H.L.Bodlaender A.Andersson M.Nowak J.I.Munro J.Cheriyan M.Chrobak K.Diks S.Nilsson R.Raman J.Håstad O.Petersson
Talks about:
parallel (6) sort (4) algorithm (3) optim (3) time (3) treewidth (2) string (2) comput (2) integ (2) graph (2)

Person: Torben Hagerup

DBLP DBLP: Hagerup:Torben

Contributed to:

ICALP 20002000
ICALP 19981998
ICALP 19971997
ICALP 19951995
STOC 19951995
STOC 19941994
ICALP 19931993
ICALP 19921992
ICALP 19911991
STOC 19911991
ICALP 19901990
ICALP 19891989
ICALP 19871987

Wrote 14 papers:

ICALP-2000-Hagerup #ram #word
Improved Shortest Paths on the Word RAM (TH), pp. 61–72.
ICALP-1998-Hagerup #performance #ram
Simpler and Faster Dictionaries on the AC0 RAM (TH), pp. 79–90.
ICALP-1997-Hagerup #algorithm #bound #graph
Dynamic Algorithms for Graphs of Bounded Treewidth (TH), pp. 292–302.
ICALP-1995-BodlaenderH #algorithm #bound #parallel
Parallel Algorithms with Optimal Speedup for Bounded Treewidth (HLB, TH), pp. 268–279.
STOC-1995-AnderssonHNR #linear #question #sorting
Sorting in linear time? (AA, TH, SN, RR), pp. 427–436.
STOC-1994-AnderssonHHP #array #complexity #string
The complexity of searching a sorted array of strings (AA, TH, JH, OP), pp. 317–325.
STOC-1994-Hagerup #algorithm #parallel #sorting #string
Optimal parallel string algorithms: sorting, merging and computing the minimum (TH), pp. 382–391.
ICALP-1993-HagerupMM #maintenance #probability
Maintaining Discrete Probability Distributions Optimally (TH, KM, JIM), pp. 253–264.
ICALP-1992-Hagerup #integer #performance
Fast Integer Merging on the EREW PRAM (TH), pp. 318–329.
ICALP-1991-Hagerup #generative #parallel #performance #permutation #random
Fast Parallel Generation of Random Permutations (TH), pp. 405–416.
STOC-1991-Hagerup #integer #parallel #sorting
Constant-Time Parallel Integer Sorting (TH), pp. 299–306.
ICALP-1990-CheriyanHM #question
Can A Maximum Flow be Computed on o(nm) Time? (JC, TH, KM), pp. 235–248.
ICALP-1989-HagerupN #parallel #retrieval
Parallel Retrieval of Scattered Information (TH, MN), pp. 439–450.
ICALP-1987-HagerupCD #graph #parallel
Parallel 5-Colouring of Planar Graphs (TH, MC, KD), pp. 304–313.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.