Hannah Bast

Holger Bast

	2011
35		Hannah Bast, Marjan Celikik: Fast construction of the HYB index. ACM Trans. Inf. Syst. 29(3): 16 (2011)
34		Dennis Laupichler, Stefan Vollmer, Holger Bast, Matthias Intemann: Das BSI-Schutzprofil: Anforderungen an den Datenschutz und die Datensicherheit für Smart Metering Systeme - Neue Sicherheitsstandards in der Versorgungsinfrastruktur. Datenschutz und Datensicherheit 35(8): 542-546 (2011)
	2010
33		Remco C. Veltkamp, Geert-Jan Giezeman, Hannah Bast, Thomas Baumbach, Takahiko Furuya, Joachim Giesen, Afzal Godil, Zhouhui Lian, Ryutarou Ohbuchi, Waqar Saleem: SHREC'10 Track: Large Scale Retrieval. 3DOR 2010: 63-69
32		Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robert Geisberger, Chris Harrelson, Veselin Raychev, Fabien Viger: Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns. ESA (1) 2010: 290-301
31		Hannah Bast, Marjan Celikik: Efficient two-sided error-tolerant search. KEYS 2010: 3
	2009
30		Hannah Bast: Car or Public Transport - Two Worlds. Efficient Algorithms 2009: 355-367
29		Marjan Celikik, Holger Bast: Fast error-tolerant search on very large texts. SAC 2009: 1724-1731
28		Marjan Celikik, Hannah Bast: Fast Single-Pass Construction of a Half-Inverted Index. SPIRE 2009: 194-205
	2008
27		Holger Bast, Fabian M. Suchanek, Ingmar Weber: Semantic Full-Text Search with ESTER: Scalable, Easy, Fast. ICDM Workshops 2008: 959-962
26		Holger Bast, Christian Worm Mortensen, Ingmar Weber: Output-sensitive autocompletion search. Inf. Retr. 11(4): 269-286 (2008)
25		Holger Bast, Ingmar Weber: Effiziente und Proaktive Suche. KI 22(2): 58-61 (2008)
24		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
23		Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes: In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007
22		Holger Bast, Ingmar Weber: The CompleteSearch Engine: Interactive, Efficient, and Towards IR& DB Integration. CIDR 2007: 88-95
21		Holger Bast, Debapriyo Majumdar, Ingmar Weber: Efficient interactive query expansion with complete search. CIKM 2007: 857-860
20		Holger Bast, Alexandru Chitea, Fabian M. Suchanek, Ingmar Weber: ESTER: efficient search on text, entities, and relations. SIGIR 2007: 671-678
	2006
19		Holger Bast, Ingmar Weber: Type less, find more: fast autocompletion search with a succinct index. SIGIR 2006: 364-371
18		Holger Bast, Christian Worm Mortensen, Ingmar Weber: Output-Sensitive Autocompletion Search. SPIRE 2006: 150-162
17		Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum: IO-Top-k at TREC 2006: Terabyte Track. TREC 2006
16		Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum: IO-Top-k: Index-access Optimized Top-k Query Processing. VLDB 2006: 475-486
15		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
14		Holger Bast, Georges Dupret, Debapriyo Majumdar, Benjamin Piwowarski: Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis. EWMF/KDO 2005: 103-120
13		Holger Bast, Debapriyo Majumdar: Why spectral retrieval works. SIGIR 2005: 11-18
12		Holger Bast, Ingmar Weber: Don't Compare Averages. WEA 2005: 67-76
11		Holger Bast, Ingmar Weber: Insights from Viewing Ranked Retrieval as Rank Aggregation. WIRI 2005: 232-239
	2004
10		Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92
9		Hannah Bast: Provably optimal scheduling of similar tasks. Saarland University 2004
	2003
8		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		Hannah Bast: Scheduling at Twilight the Easy Way. STACS 2002: 166-178
	2000
6		Hannah Bast, Susan Hert: The Area Partitioning Problem. CCCG 2000
5		Hannah Bast: On Scheduling Parallel Tasks at Twilight. Theory Comput. Syst. 33(5/6): 489-563 (2000)
	1998
4		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		Holger Bast, Torben Hagerup: Fast and Reliable Parallel Hashing. SPAA 1991: 50-61

Coauthor Index

1	Thomas Baumbach	[33]
2	Erik Carlsson	[32]
3	Marjan Celikik	[28] [29] [31] [35]
4	Alexandru Chitea	[20]
5	Martin Dietzfelbinger	[2]
6	Georges Dupret	[14]
7	Arno Eigenwillig	[32]
8	Stefan Funke	[23]
9	Takahiko Furuya	[33]
10	Robert Geisberger	[32]
11	Joachim Giesen	[33]
12	Geert-Jan Giezeman	[33]
13	Afzal Godil	[33]
14	Torben Hagerup	[1] [2] [3]
15	Chris Harrelson	[32]
16	Susan Hert	[6]
17	Matthias Intemann	[34]
18	Dennis Laupichler	[34]
19	Zhouhui Lian	[33]
20	Debapriyo Majumdar	[13] [14] [16] [17] [21] [24]
21	Domagoj Matijevic	[23]
22	Kurt Mehlhorn	[8] [10] [15]
23	Christian Worm Mortensen	[18] [26]
24	Ryutarou Ohbuchi	[33]
25	Benjamin Piwowarski	[14]
26	Veselin Raychev	[32]
27	Waqar Saleem	[33]
28	Peter Sanders	[23]
29	Guido Schäfer	[8] [10] [15]
30	Ralf Schenkel	[16] [17] [24]
31	Dominik Schultes	[23]
32	Fabian M. Suchanek	[20] [27]
33	Hisao Tamaki	[10] [15]
34	Martin Theobald	[16] [17] [24]
35	Remco C. Veltkamp	[33]
36	Fabien Viger	[32]
37	Stefan Vollmer	[34]
38	Ingmar Weber	[11] [12] [18] [19] [20] [21] [22] [25] [26] [27]
39	Gerhard Weikum	[16] [17] [24]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page