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

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

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

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

Characterizations of k-terminal flow networks and computing..:

, In: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms,
Hagerup, Torben ; Katajainen, Jyrki ; Nishimura, Naomi. - p. 641-649 , 1995
Link: https://dl.acm.org/doi/1..
 
?
6

Sorting in linear time?:

, In: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing,
Andersson, Arne ; Hagerup, Torben ; Nilsson, Stefan. - p. 427-436 , 1995
Link: https://dl.acm.org/doi/1..
 
?
7

Optimal parallel string algorithms : sorting, merging an..:

, In: Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing,
Hagerup, Torben - p. 382-391 , 1994
Link: https://dl.acm.org/doi/1..
 
?
8

The complexity of searching a sorted array of strings:

, In: Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing,
Andersson, Arne ; Hagerup, Torben ; Håstad, Johan. - p. 317-325 , 1994
Link: https://dl.acm.org/doi/1..
 
?
9

Fast deterministic processor allocation:

, In: Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms,
Hagerup, Torben - p. 1-10 , 1993
Link: https://dl.acm.org/doi/1..
 
?
10

Fast deterministic approximate and exact parallel sorting:

, In: Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures,
Hagerup, Torben ; Raman, Rajeev - p. 346-355 , 1993
Link: https://dl.acm.org/doi/1..
 
?
11

Improved parallel integer sorting without concurrent writin:

, In: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms,
Albers, Susanne ; Hagerup, Torben - p. 463-472 , 1992
Link: https://dl.acm.org/doi/1..
 
?
12

Fast and reliable parallel hashing:

, In: Proceedings of the third annual ACM symposium on Parallel algorithms and architectures,
Bast, Holger ; Hagerup, Torben - p. 50-61 , 1991
Link: https://dl.acm.org/doi/1..
 
?
13

Constant-time parallel integer sorting:

, In: Proceedings of the twenty-third annual ACM symposium on Theory of Computing,
Hagerup, Torben - p. 299-306 , 1991
Link: https://dl.acm.org/doi/1..
 
?
14

Every robust CRCW PRAM can efficiently simulate a PRIORITY ..:

, In: Proceedings of the second annual ACM symposium on Parallel algorithms and architectures,
Hagerup, Torben ; Radzik, T. - p. 117-124 , 1990
Link: https://dl.acm.org/doi/1..
 
?
15

Neue Algorithmen für das Maximum-Flow-Problem:

, In: GI — 20. Jahrestagung II; Informatik-Fachberichte,
Hagerup, Torben - p. 507-516 , 1990
Link: https://doi.org/10.1007/..
 
1-15