Holger Bast

Hannah Bast

2009
26	EE	Marjan Celikik, Holger Bast: Fast error-tolerant search on very large texts. SAC 2009: 1724-1731
2008
25	EE	Holger Bast, Fabian M. Suchanek, Ingmar Weber: Semantic Full-Text Search with ESTER: Scalable, Easy, Fast. ICDM Workshops 2008: 959-962
24	EE	Holger Bast, Christian Worm Mortensen, Ingmar Weber: Output-sensitive autocompletion search. Inf. Retr. 11(4): 269-286 (2008)
23	EE	Martin Theobald, Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Gerhard Weikum: TopX: efficient and versatile top- k query processing for semistructured data. VLDB J. 17(1): 81-115 (2008)
2007
22	EE	Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes: In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007
21	EE	Holger Bast, Ingmar Weber: The CompleteSearch Engine: Interactive, Efficient, and Towards IR& DB Integration. CIDR 2007: 88-95
20	EE	Holger Bast, Debapriyo Majumdar, Ingmar Weber: Efficient interactive query expansion with complete search. CIKM 2007: 857-860
19	EE	Holger Bast, Alexandru Chitea, Fabian M. Suchanek, Ingmar Weber: ESTER: efficient search on text, entities, and relations. SIGIR 2007: 671-678
2006
18	EE	Holger Bast, Ingmar Weber: Type less, find more: fast autocompletion search with a succinct index. SIGIR 2006: 364-371
17	EE	Holger Bast, Christian Worm Mortensen, Ingmar Weber: Output-Sensitive Autocompletion Search. SPIRE 2006: 150-162
16	EE	Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum: IO-Top-k at TREC 2006: Terabyte Track. TREC 2006
15	EE	Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum: IO-Top-k: Index-access Optimized Top-k Query Processing. VLDB 2006: 475-486
14	EE	Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006)
2005
13	EE	Holger Bast, Georges Dupret, Debapriyo Majumdar, Benjamin Piwowarski: Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis. EWMF/KDO 2005: 103-120
12	EE	Holger Bast, Debapriyo Majumdar: Why spectral retrieval works. SIGIR 2005: 11-18
11	EE	Holger Bast, Ingmar Weber: Don't Compare Averages. WEA 2005: 67-76
10	EE	Holger Bast, Ingmar Weber: Insights from Viewing Ranked Retrieval as Rank Aggregation. WIRI 2005: 232-239
2004
9	EE	Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92
2003
8	EE	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)
2002
7	EE	Hannah Bast: Scheduling at Twilight the Easy Way. STACS 2002: 166-178
2000
6	EE	Hannah Bast, Susan Hert: The Area Partitioning Problem. CCCG 2000
5	EE	Hannah Bast: On Scheduling Parallel Tasks at Twilight. Theory Comput. Syst. 33(5/6): 489-563 (2000)
1998
4	EE	Hannah Bast: Dynamic Scheduling With Incomplete Information. SPAA 1998: 182-191
1995
3		Hannah Bast, Torben Hagerup: Fast Parallel Space Allocation, Estimation and Integer Sorting. Inf. Comput. 123(1): 72-110 (1995)
1992
2		Holger Bast, Martin Dietzfelbinger, Torben Hagerup: A Perfect Parallel Dictionary. MFCS 1992: 133-141
1991
1	EE	Holger Bast, Torben Hagerup: Fast and Reliable Parallel Hashing. SPAA 1991: 50-61

Coauthor Index

1	Marjan Celikik	[26]
2	Alexandru Chitea	[19]
3	Martin Dietzfelbinger	[2]
4	Georges Dupret	[13]
5	Stefan Funke	[22]
6	Torben Hagerup	[1] [2] [3]
7	Susan Hert	[6]
8	Debapriyo Majumdar	[12] [13] [15] [16] [20] [23]
9	Domagoj Matijevic	[22]
10	Kurt Mehlhorn	[8] [9] [14]
11	Christian Worm Mortensen	[17] [24]
12	Benjamin Piwowarski	[13]
13	Peter Sanders	[22]
14	Guido Schäfer	[8] [9] [14]
15	Ralf Schenkel	[15] [16] [23]
16	Dominik Schultes	[22]
17	Fabian M. Suchanek	[19] [25]
18	Hisao Tamaki	[9] [14]
19	Martin Theobald	[15] [16] [23]
20	Ingmar Weber	[10] [11] [17] [18] [19] [20] [21] [24] [25]
21	Gerhard Weikum	[15] [16] [23]

Colors in the list of coauthors