Hannah Bast

Holger Bast

University of Freiburg, Germany

other persons with the same name:

• Holger Bast
• Holger Bast 0002 - Bundesamt für Sicherheit in der Informationstechnik, Germany

	2013
j9		Hannah Bast: Semantische Suche. Informatik Spektrum 36(2): 136-143 (2013)
	2012
i1		Hannah Bast, Florian Bäurle, Björn Buchhold, Elmar Haussmann: Broccoli: Semantic Full-Text Search at your Fingertips. CoRR abs/1207.2615 (2012)
	2011
j8		Hannah Bast, Marjan Celikik: Fast construction of the HYB index. ACM Trans. Inf. Syst. 29(3): 16 (2011)
	2010
c25		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
c24		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
c23		Hannah Bast, Marjan Celikik: Efficient two-sided error-tolerant search. KEYS 2010: 3
	2009
c22		Hannah Bast: Car or Public Transport - Two Worlds. Efficient Algorithms 2009: 355-367
c21		Marjan Celikik, Holger Bast: Fast error-tolerant search on very large texts. SAC 2009: 1724-1731
c20		Marjan Celikik, Hannah Bast: Fast Single-Pass Construction of a Half-Inverted Index. SPIRE 2009: 194-205
	2008
j7		Holger Bast, Christian Worm Mortensen, Ingmar Weber: Output-sensitive autocompletion search. Inf. Retr. 11(4): 269-286 (2008)
j6		Holger Bast, Ingmar Weber: Effiziente und Proaktive Suche. KI 22(2): 58-61 (2008)
j5		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)
c19		Holger Bast, Fabian M. Suchanek, Ingmar Weber: Semantic Full-Text Search with ESTER: Scalable, Easy, Fast. ICDM Workshops 2008: 959-962
	2007
c18		Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes: In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007
c17		Holger Bast, Ingmar Weber: The CompleteSearch Engine: Interactive, Efficient, and Towards IR& DB Integration. CIDR 2007: 88-95
c16		Holger Bast, Debapriyo Majumdar, Ingmar Weber: Efficient interactive query expansion with complete search. CIKM 2007: 857-860
c15		Holger Bast, Alexandru Chitea, Fabian M. Suchanek, Ingmar Weber: ESTER: efficient search on text, entities, and relations. SIGIR 2007: 671-678
	2006
j4		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)
c14		Holger Bast, Ingmar Weber: Type less, find more: fast autocompletion search with a succinct index. SIGIR 2006: 364-371
c13		Holger Bast, Christian Worm Mortensen, Ingmar Weber: Output-Sensitive Autocompletion Search. SPIRE 2006: 150-162
c12		Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum: IO-Top-k at TREC 2006: Terabyte Track. TREC 2006
c11		Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum: IO-Top-k: Index-access Optimized Top-k Query Processing. VLDB 2006: 475-486
	2005
c10		Holger Bast, Georges Dupret, Debapriyo Majumdar, Benjamin Piwowarski: Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis. EWMF/KDO 2005: 103-120
c9		Holger Bast, Debapriyo Majumdar: Why spectral retrieval works. SIGIR 2005: 11-18
c8		Holger Bast, Ingmar Weber: Don't Compare Averages. WEA 2005: 67-76
c7		Holger Bast, Ingmar Weber: Insights from Viewing Ranked Retrieval as Rank Aggregation. WIRI 2005: 232-239
	2004
b1		Hannah Bast: Provably optimal scheduling of similar tasks. Saarland University 2004
c6		Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki: Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92
	2003
j3		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
c5		Hannah Bast: Scheduling at Twilight the Easy Way. STACS 2002: 166-178
	2000
j2		Hannah Bast: On Scheduling Parallel Tasks at Twilight. Theory Comput. Syst. 33(5/6): 489-563 (2000)
c4		Hannah Bast, Susan Hert: The Area Partitioning Problem. CCCG 2000
	1998
c3		Hannah Bast: Dynamic Scheduling With Incomplete Information. SPAA 1998: 182-191
	1995
j1		Hannah Bast, Torben Hagerup: Fast Parallel Space Allocation, Estimation and Integer Sorting. Inf. Comput. 123(1): 72-110 (1995)
	1992
c2		Holger Bast, Martin Dietzfelbinger, Torben Hagerup: A Perfect Parallel Dictionary. MFCS 1992: 133-141
	1991
c1		Holger Bast, Torben Hagerup: Fast and Reliable Parallel Hashing. SPAA 1991: 50-61

Coauthor Index

Colors in the list of coauthors

Last update Sun May 26 04:28:57 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page