| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Holger Bast Holger Bast, Debapriyo Majumdar : Why spectral retrieval works. SIGIR 2005 : 11-18 Holger Bast, Ingmar Weber : Don't Compare Averages. WEA 2005 : 67-76 Holger Bast, Ingmar Weber : Insights from Viewing Ranked Retrieval as Rank Aggregation. WIRI 2005 : 232-239 Holger Bast, Kurt Mehlhorn , Guido Schäfer , Hisao Tamaki : Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004 : 81-92 Holger Bast, Kurt Mehlhorn , Guido Schäfer : A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. Algorithmica 36 (1): 75-88 (2003) Hannah Bast: Scheduling at Twilight the Easy Way. STACS 2002 : 166-178 Hannah Bast, Susan Hert : The Area Partitioning Problem. CCCG 2000 Hannah Bast: On Scheduling Parallel Tasks at Twilight. Theory Comput. Syst. 33 (5/6): 489-563 (2000) Hannah Bast: Dynamic Scheduling With Incomplete Information. SPAA 1998 : 182-191 Hannah Bast, Torben Hagerup : Fast Parallel Space Allocation, Estimation and Integer Sorting. Inf. Comput. 123 (1): 72-110 (1995) Holger Bast, Martin Dietzfelbinger , Torben Hagerup : A Perfect Parallel Dictionary. MFCS 1992 : 133-141 Holger Bast, Torben Hagerup : Fast and Reliable Parallel Hashing. SPAA 1991 : 50-61 1 [ 2 ] 2 [ 1 ] [ 2 ] [ 3 ] 3 [ 6 ] 4 [ 12 ] 5 [ 8 ] [ 9 ] 6 [ 8 ] [ 9 ] 7 [ 9 ] 8 [ 10 ] [ 11 ]  ©2006 Association for Computing Machinery |
