default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHannah Bast
Person information
- affiliation: University of Freiburg, Department of Computer Science, Germany
- affiliation (former): Max-Planck-Institute for Informatics, Saarbrücken, Germany
- affiliation (PhD 2000): Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[e3]Harrie Oosterhuis, Hannah Bast, Chenyan Xiong:
Proceedings of the 2024 ACM SIGIR International Conference on Theory of Information Retrieval, ICTIR 2024, Washington, DC, USA, 13 July 2024. ACM 2024, ISBN 979-8-4007-0681-3 [contents]- 2023
- [c61]Hannah Bast, Matthias Hertel
, Sebastian Walter:
Fast Whitespace Correction with Encoder-Only Transformers. ACL (demo) 2023: 389-399 - [c60]Laura Dietz, Hannah Bast, Shubham Chatterjee, Jeff Dalton, Edgar Meij, Arjen P. de Vries:
ECIR 23 Tutorial: Neuro-Symbolic Approaches for Information Retrieval. ECIR (3) 2023: 324-330 - [c59]Hannah Bast, Matthias Hertel, Natalie Prange:
A Fair and In-Depth Evaluation of Existing End-to-End Entity Linking Systems. EMNLP 2023: 6659-6672 - [c58]Hannah Bast, Patrick Brosi, Johannes Kalmbach, Axel Lehmann:
Efficient Interactive Visualization of Large Geospatial Query Results. SIGSPATIAL/GIS 2023: 51:1-51:4 - [c57]Laura Dietz, Hannah Bast, Shubham Chatterjee, Jeffrey Dalton, Jian-Yun Nie, Rodrigo Frassetto Nogueira:
Neuro-Symbolic Representations for Information Retrieval. SIGIR 2023: 3436-3439 - [i10]Hannah Bast, Matthias Hertel, Natalie Prange:
A Fair and In-Depth Evaluation of Existing End-to-End Entity Linking Systems. CoRR abs/2305.14937 (2023) - 2022
- [c56]Hannah Bast, Johannes Kalmbach, Theresa Klumpp, Florian Kramer, Niklas Schnelle:
Efficient and Effective SPARQL Autocompletion on Very Large Knowledge Graphs. CIKM 2022: 2893-2902 - [c55]Hannah Bast, Matthias Hertel, Natalie Prange:
ELEVANT: A Fully Automatic Fine-Grained Entity Linking Evaluation and Analysis Tool. EMNLP (Demos) 2022: 72-79 - [e2]Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck:
Algorithms for Big Data - DFG Priority Program 1736. Lecture Notes in Computer Science 13201, Springer 2022, ISBN 978-3-031-21533-9 [contents] - [i9]Hannah Bast, Matthias Hertel, Natalie Prange:
ELEVANT: A Fully Automatic Fine-Grained Entity Linking Evaluation and Analysis Tool. CoRR abs/2208.07193 (2022) - 2021
- [j16]Nazli Goharian, Hannah Bast:
Report on women in IR (WIR 2021) at SIGIR 2021. SIGIR Forum 55(2): 9:1-9:3 (2021) - [c54]Hannah Bast, Matthias Hertel, Mostafa M. Mohamed:
Tokenization Repair in the Presence of Spelling Errors. CoNLL 2021: 279-289 - [c53]Hannah Bast, Patrick Brosi, Johannes Kalmbach, Axel Lehmann:
An Efficient RDF Converter and SPARQL Endpoint for the Complete OpenStreetMap Data. SIGSPATIAL/GIS 2021: 536-539 - [c52]Hannah Bast, Patrick Brosi, Sabine Storandt:
Metro Maps on Flexible Base Grids. SSTD 2021: 12-22 - [i8]Hannah Bast, Johannes Kalmbach, Theresa Klumpp, Florian Kramer, Niklas Schnelle:
Efficient SPARQL Autocompletion via SPARQL. CoRR abs/2104.14595 (2021) - 2020
- [j15]Hannah Bast, Patrick Brosi, Sabine Storandt:
Metro Maps on Octilinear Grid Graphs. Comput. Graph. Forum 39(3): 357-367 (2020) - [c51]Hannah Bast, Patrick Brosi, Markus Näther:
staty: Quality Assurance for Public Transit Stations in OpenStreetMap. SIGSPATIAL/GIS 2020: 207-210 - [i7]Hannah Bast, Matthias Hertel, Mostafa M. Mohamed:
Tokenization Repair in the Presence of Spelling Errors. CoRR abs/2010.07878 (2020) - [i6]Hannah Bast, Patrick Brosi, Markus Näther:
Similarity Classification of Public Transit Stations. CoRR abs/2012.15267 (2020)
2010 – 2019
- 2019
- [j14]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient Generation of Geographically Accurate Transit Maps. ACM Trans. Spatial Algorithms Syst. 5(4): 25:1-25:36 (2019) - 2018
- [j13]Hannah Bast, Björn Buchhold, Elmar Haussmann:
A Quality Evaluation of Combined Search on a Knowledge Base and Text. Künstliche Intell. 32(1): 19-26 (2018) - [c50]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient generation of geographically accurate transit maps. SIGSPATIAL/GIS 2018: 13-22 - [c49]Hannah Bast, Patrick Brosi:
Sparse map-matching in public transit networks with turn restrictions. SIGSPATIAL/GIS 2018: 480-483 - [c48]Hannah Bast, Niklas Schnelle:
Efficient and Convenient SPARQL+Text Search: A Quick Survey. RW 2018: 26-34 - [e1]Yossi Azar, Hannah Bast, Grzegorz Herman:
26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland. LIPIcs 112, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-081-1 [contents] - 2017
- [c47]Hannah Bast, Björn Buchhold:
QLever: A Query Engine for Efficient SPARQL+Text Search. CIKM 2017: 647-656 - [c46]Hannah Bast, Claudius Korzen:
A Benchmark and Evaluation for Text Extraction from PDF. JCDL 2017: 99-108 - [c45]Stefan Heindorf, Martin Potthast, Hannah Bast, Björn Buchhold, Elmar Haussmann:
WSDM Cup 2017: Vandalism Detection and Triple Scoring. WSDM 2017: 827-828 - [i5]Hannah Bast, Patrick Brosi, Sabine Storandt:
Efficient Generation of Geographically Accurate Transit Maps. CoRR abs/1710.02226 (2017) - [i4]Hannah Bast, Björn Buchhold, Elmar Haussmann:
Overview of the Triple Scoring Task at the WSDM Cup 2017. CoRR abs/1712.08081 (2017) - [i3]Martin Potthast, Stefan Heindorf, Hannah Bast:
Proceedings of the WSDM Cup 2017: Vandalism Detection and Triple Scoring. CoRR abs/1712.09528 (2017) - 2016
- [j12]Hannah Bast, Björn Buchhold, Elmar Haussmann:
Semantic Search on Text and Knowledge Bases. Found. Trends Inf. Retr. 10(2-3): 119-271 (2016) - [c44]Hannah Bast, Matthias Hertel, Sabine Storandt:
Scalable Transfer Patterns. ALENEX 2016: 15-29 - [p1]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. Algorithm Engineering 2016: 19-80 - 2015
- [c43]Hannah Bast, Elmar Haussmann:
More Accurate Question Answering on Freebase. CIKM 2015: 1431-1440 - [c42]Hannah Bast, Sabine Storandt, Simon Weidner:
Fine-grained population estimation. SIGSPATIAL/GIS 2015: 17:1-17:10 - [c41]Hannah Bast, Björn Buchhold, Elmar Haussmann:
Relevance Scores for Triples from Type-Like Relations. SIGIR 2015: 243-252 - [i2]Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias Müller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, Renato F. Werneck:
Route Planning in Transportation Networks. CoRR abs/1504.05140 (2015) - 2014
- [j11]Hannah Bast, Marjan Celikik:
Efficient Index-Based Snippet Generation. ACM Trans. Inf. Syst. 32(2): 6:1-6:24 (2014) - [c40]Hannah Bast, Sabine Storandt:
Flow-Based Guidebook Routing. ALENEX 2014: 155-165 - [c39]Hannah Bast, Elmar Haussmann:
More Informative Open Information Extraction via Simple Inference. ECIR 2014: 585-590 - [c38]Hannah Bast, Sabine Storandt:
Frequency-based search for public transit. SIGSPATIAL/GIS 2014: 13-22 - [c37]Hannah Bast, Patrick Brosi, Sabine Storandt:
Real-time movement visualization of public transit data. SIGSPATIAL/GIS 2014: 331-340 - [c36]Hannah Bast, Patrick Brosi, Sabine Storandt:
TRAVIC: a visualization client for public transit data. SIGSPATIAL/GIS 2014: 561-564 - [c35]Hannah Bast, Florian Bäurle, Björn Buchhold, Elmar Haußmann:
Semantic full-text search with broccoli. SIGIR 2014: 1265-1266 - [c34]Hannah Bast, Jonas Sternisko, Sabine Storandt:
ForestMaps: A Computational Model and Visualization for Forest Utilization. W2GIS 2014: 115-133 - [c33]Hannah Bast, Florian Bäurle, Björn Buchhold, Elmar Haußmann:
Easy access to the freebase dataset. WWW (Companion Volume) 2014: 95-98 - 2013
- [j10]Hannah Bast:
Semantische Suche. Inform. Spektrum 36(2): 136-143 (2013) - [j9]Hannah Bast, Marjan Celikik:
Efficient fuzzy search in large text collections. ACM Trans. Inf. Syst. 31(2): 10 (2013) - [c32]Hannah Bast, Jonas Sternisko, Sabine Storandt:
Delay-Robustness of Transfer Patterns in Public Transportation Route Planning. ATMOS 2013: 42-54 - [c31]Hannah Bast, Mirko Brodesser, Sabine Storandt:
Result Diversity for Multi-Modal Route Planning. ATMOS 2013: 123-136 - [c30]Hannah Bast, Björn Buchhold:
An index for efficient semantic full-text search. CIKM 2013: 369-378 - [c29]Hannah Bast, Elmar Haussmann:
Open Information Extraction via Contextual Sentence Decomposition. ICSC 2013: 154-159 - [c28]Hannah Bast, Sabine Storandt:
Frequency Data Compression for Public Transportation Network Algorithms (Extended Abstract). SOCS 2013: 205-206 - [c27]Hannah Bast, Claudius Korzen:
The Icecite Research Paper Management System. WISE (2) 2013: 396-409 - 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:1-16:33 (2011) - 2010
- [c26]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@Eurographics 2010: 63-69 - [c25]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 - [c24]Hannah Bast, Marjan Celikik:
Efficient two-sided error-tolerant search. KEYS 2010: 3
2000 – 2009
- 2009
- [c23]Hannah Bast:
Car or Public Transport - Two Worlds. Efficient Algorithms 2009: 355-367 - [c22]Marjan Celikik, Hannah Bast:
Fast error-tolerant search on very large texts. SAC 2009: 1724-1731 - [c21]Marjan Celikik, Hannah Bast:
Fast Single-Pass Construction of a Half-Inverted Index. SPIRE 2009: 194-205 - 2008
- [j7]Hannah Bast, Christian Worm Mortensen, Ingmar Weber:
Output-sensitive autocompletion search. Inf. Retr. 11(4): 269-286 (2008) - [j6]Hannah Bast, Ingmar Weber:
Effiziente und Proaktive Suche. Künstliche Intell. 22(2): 58-61 (2008) - [j5]Martin Theobald, Hannah 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) - [c20]Hannah Bast, Fabian M. Suchanek, Ingmar Weber:
Semantic Full-Text Search with ESTER: Scalable, Easy, Fast. ICDM Workshops 2008: 959-962 - 2007
- [c19]Hannah Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes:
In Transit to Constant Time Shortest-Path Queries in Road Networks. ALENEX 2007 - [c18]Hannah Bast, Ingmar Weber:
The CompleteSearch Engine: Interactive, Efficient, and Towards IR& DB Integration. CIDR 2007: 88-95 - [c17]Hannah Bast, Debapriyo Majumdar, Ingmar Weber:
Efficient interactive query expansion with complete search. CIKM 2007: 857-860 - [c16]Hannah Bast, Alexandru Chitea, Fabian M. Suchanek, Ingmar Weber:
ESTER: efficient search on text, entities, and relations. SIGIR 2007: 671-678 - 2006
- [j4]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. Theory Comput. Syst. 39(1): 3-14 (2006) - [c15]Hannah Bast, Stefan Funke, Domagoj Matijevic:
Ultrafast Shortest-Path Queries via Transit Nodes. The Shortest Path Problem 2006: 175-192 - [c14]Hannah Bast, Ingmar Weber:
Type less, find more: fast autocompletion search with a succinct index. SIGIR 2006: 364-371 - [c13]Hannah Bast, Christian Worm Mortensen, Ingmar Weber:
Output-Sensitive Autocompletion Search. SPIRE 2006: 150-162 - [c12]Hannah Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum:
IO-Top-k at TREC 2006: Terabyte Track. TREC 2006 - [c11]Hannah 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]Hannah Bast, Georges Dupret, Debapriyo Majumdar, Benjamin Piwowarski:
Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis. EWMF/KDO 2005: 103-120 - [c9]Hannah Bast, Debapriyo Majumdar:
Why spectral retrieval works. SIGIR 2005: 11-18 - [c8]Hannah Bast, Ingmar Weber:
Don't Compare Averages. WEA 2005: 67-76 - [c7]Hannah Bast, Ingmar Weber:
Insights from Viewing Ranked Retrieval as Rank Aggregation. WIRI 2005: 232-239 - 2004
- [c6]Hannah Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki:
Matching Algorithms Are Fast in Sparse Random Graphs. STACS 2004: 81-92 - 2003
- [j3]Hannah 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
- [b1]Hannah Bast:
Provably optimal scheduling of similar tasks. Saarland University, Saarbrücken, Germany, 2000, pp. 1-135 - [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
1990 – 1999
- 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]Hannah Bast, Martin Dietzfelbinger, Torben Hagerup:
A Perfect Parallel Dictionary. MFCS 1992: 133-141 - 1991
- [c1]Hannah Bast, Torben Hagerup:
Fast and Reliable Parallel Hashing. SPAA 1991: 50-61
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
