Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Hagerup, Torben
76  Ergebnisse:
Personensuche X
?
1

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/..
 
?
2

Highly Succinct Dynamic Data Structures:

, In: Fundamentals of Computation Theory; Lecture Notes in Computer Science,
Hagerup, Torben - p. 29-45 , 2019
Link: https://doi.org/10.1007/..
 
?
3

Fast Breadth-First Search in Still Less Space:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Hagerup, Torben - p. 93-105 , 2019
Link: https://doi.org/10.1007/..
 
?
4

Rank-Select Indices Without Tears:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Baumann, Tim ; Hagerup, Torben - p. 85-98 , 2019
Link: https://doi.org/10.1007/..
 
?
5

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

Hagerup, Torben
Algorithmica.  82 (2019)  4 - p. 1033-1056 , 2019
Link: https://doi.org/10.1007/..
 
?
6

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/..
 
?
7

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/..
 
?
8

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/..
 
?
9

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/..
 
?
10

Algorithm Theory - SWAT 2004 

9th Scandinavian Workshop on Algorithm Theory, Humlebæk, De...  Lecture Notes in Computer Science ; 3111
Hagerup, Torben ; Katajainen, Jyrki , 2004
Link: https://doi.org/10.1007/..
 
?
11

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/..
 
?
12

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/..
 
?
13

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/..
 
?
14

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/..
 
?
15

Fast deterministic construction of static dictionaries:

, In: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms,
Hagerup, Torben - p. 414-418 , 1999
Link: https://dl.acm.org/doi/1..
 
1-15