E-LIB Suche - Ergebnisse für: Hagerup, Torben

1

Space-Efficient DFS and Applications to Connectivity Proble..:

Hagerup, Torben
Algorithmica. 82 (2019) 4 - p. 1033-1056 , 2019

Link: https://doi.org/10.1007/..

2

Space-efficient Euler partition and bipartite edge coloring:

Hagerup, Torben ; Kammer, Frank ; Laudahn, Moritz
Theoretical Computer Science. 754 (2019) - p. 16-34 , 2019

Link: https://doi.org/10.1016/..

3

A strengthened analysis of an algorithm for Dominating Set ..:

Hagerup, Torben
Discrete Applied Mathematics. 160 (2012) 6 - p. 793-798 , 2012

Link: https://doi.org/10.1016/..

4

Finding the maximum suffix with fewer comparisons:

Franceschini, Gianni ; Hagerup, Torben
Journal of Discrete Algorithms. 9 (2011) 3 - p. 279-286 , 2011

Link: https://doi.org/10.1016/..

5

Trimming of Graphs, with Application to Point Labeling:

Erlebach, Thomas ; Hagerup, Torben ; Jansen, Klaus..
Theory of Computing Systems. 47 (2009) 3 - p. 613-636 , 2009

Link: https://doi.org/10.1007/..

6

Simpler Computation of Single-Source Shortest Paths in Line..:

Hagerup, Torben
Theory of Computing Systems. 39 (2005) 1 - p. 113-120 , 2005

Link: https://doi.org/10.1007/..

7

Deterministic Dictionaries:

Hagerup, Torben ; Miltersen, Peter Bro ; Pagh, Rasmus
Journal of Algorithms. 41 (2001) 1 - p. 69-85 , 2001

Link: https://doi.org/10.1006/..

8

Tight Bounds for Searching a Sorted Array of Strings:

Andersson, Arne ; Hagerup, Torben ; Håstad, Johan.
SIAM Journal on Computing. 30 (2000) 5 - p. 1552-1578 , 2000

Link: https://doi.org/10.1137/..

9

Self-Simulation for the Passive Optical Star:

Berthomé, Pascal ; Hagerup, Torben ; Newman, Ilan.
Journal of Algorithms. 34 (2000) 1 - p. 128-147 , 2000

Link: https://doi.org/10.1006/..

10

Parallel Preprocessing for Path Queries without Concurrent ..:

Hagerup, Torben
Information and Computation. 158 (2000) 1 - p. 18-28 , 2000

Link: https://doi.org/10.1006/..

11

Parallel Algorithms with Optimal Speedup for Bounded Treewi..:

Bodlaender, Hans L. ; Hagerup, Torben
SIAM Journal on Computing. 27 (1998) 6 - p. 1725-1746 , 1998

Link: https://doi.org/10.1137/..

12

Sorting in Linear Time?:

Andersson, Arne ; Hagerup, Torben ; Nilsson, Stefan.
Journal of Computer and System Sciences. 57 (1998) 1 - p. 74-93 , 1998

Link: https://doi.org/10.1006/..

13

More general parallel tree contraction: Register allocation..:

Diks, Krzysztof ; Hagerup, Torben
Theoretical Computer Science. 203 (1998) 1 - p. 3-29 , 1998

Link: https://doi.org/10.1016/..

14

Characterizing Multiterminal Flow Networks and Computing Fl..:

Hagerup, Torben ; Katajainen, Jyrki ; Nishimura, Naomi.
Journal of Computer and System Sciences. 57 (1998) 3 - p. 366-375 , 1998

Link: https://doi.org/10.1006/..

15

A Reliable Randomized Algorithm for the Closest-Pair Proble:

Dietzfelbinger, Martin ; Hagerup, Torben ; Katajainen, Jyrki.
Journal of Algorithms. 25 (1997) 1 - p. 19-51 , 1997

Link: https://doi.org/10.1006/..