Your search returned the following 30 documents:

30. Efficient Index-Based Snippet Generation
    Marjan Celikik, Holger Bast, and Gabriel Manolache
    . Note: unpublished
    
    
29. Fast Error-Tolerant Search on Very Large Texts
    Marjan Celikik and Holger Bast
    In: The 24th Annual ACM Symposium on Applied Computing, Honolulu, Hawaii, USA, 2009, 1724-1731
    [PDF: Download: spelling-variants.pdf]
    
28. Ultrafast shortest-path queries via transit nodes
    Holger Bast, Stefan Funke, and Domagoj Matijevic
    In: The shortest path problem : ninth DIMACS implemenation challenge, 2009, 175-192
    
27. Efficient interactive query expansion with CompleteSearch
    Holger Bast, Debapriyo Majumdar, and Ingmar Weber
    In: 16th Conference on Information and Knowledge Management (CIKM'07), Lisboa, Portugal, 2007, 857-860
    
26. ESTER: Efficient Search in Text, Entities, and Relations
    Holger Bast, Alexandru Chitea, Fabian Suchanek, and Ingmar Weber
    In: 30th International Conference on Research and Development in Information Retrieval (SIGIR'07), Amsterdam, Netherlands, 2007, 671-678
    
25. Fast Routing in Road Networks using Transit Nodes
    Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes
    Science 316 (5824): 566 p., 2007
    
24. In Transit to Constant Time Shortest-Path Queries in Road Networks
    Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, and Dominik Schultes
    In: 9th Workshop on Algorithm Enginneering and Experiments (ALENEX'07), New Orleans, USA, 2007, 46-59
    
23. Managing Helpdesk Tasks with CompleteSearch: A Case Study
    Holger Bast and Ingmar Weber
    In: 4th Conference on Professional Knowledge Management (WM'07), Potsdam, Germany, 2007, 101-108
    
22. The CompleteSearch Engine: Interactive, Efficient, and Towards IR & DB integration
    Holger Bast and Ingmar Weber
    In: CIDR 2007 : 3rd Biennial Conference on Innovative Data Systems Research, Asilomar, CA, USA, 2007, 88-95
    [PDF: Download: bastweber07cidr.pdf]
    
21. Towards Peer-to-Peer Web Search
    Gerhard Weikum, Holger Bast, Geoffrey Canright, David Hales, Christian Schindelhauer, and Peter Triantafillou
    In: 1st European Conference on Complex Systems, ECCS'05, Paris, France, 2007
    
20. Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis
    Holger Bast, Georges Dupret, Debapriyo Majumdar, and Benjamin Piwowarski
    In: Semantics, web and mining : Joint International Workshops, EWMF 2005 and KDO 2005, Porto, Portugal, 2006, 103-120
    
19. Intelligente Suche mit garantiert schnellen Antwortzeiten
    Holger Bast
    MPG Jahrbuch , 2006
    
18. IO-Top-k at TREC 2006: Terabyte Track
    Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, and Gerhard Weikum
    In: The Fifteenth Text Retrieval Conference Proceedings, TREC 2006, Gaithersburg, Maryland, USA, 2006, 1-5, paper no. 47.
    
17. Matching Algorithms are Fast in Sparse Random Graphs
    Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
    Theory of Computing Systems 39 (1): 3-14, 2006
    
    
16. Output-Sensitive Autocompletion Search
    Holger Bast, Christian Worm Mortensen, and Ingmar Weber
    In: String Processing and Information Retrieval : 13th International Conference, SPIRE 2006, Glasgow, GB, 2006, 150-162
    
    
15. TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing
    Holger Bast, Stefan Funke, and Domagoj Matijevic
    In: 9th DIMACS Implementation Challenge --- Shortest Path, Piscataway, New Jersey, 2006
    
14. Type Less, Find More: Fast Autocompletion Search with a Succinct Index
    Holger Bast and Ingmar Weber
    In: SIGIR 2006: Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, USA, 2006, 364-371
    
    
13. When You're Lost For Words: Faceted Search With Autocompletion
    Holger Bast and Ingmar Weber
    In: SIGIR'06 Workshop on Faceted Search, Seattle, USA, 2006, 31-35
    
12. IO-Top-k: Index-Access Optimized Top-k Query Processing
    Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, and Gerhard Weikum
    Max-Planck-Institut for Informatics, Saarbrücken, MPI–I–2006–5-002, Research Report
    [PDF: Download: iotopk_tr.pdf]
    
11. IO-Top-k: Index-Access Optimized Top-k Query Processing
    Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, and Gerhard Weikum
    In: Proceedings of the 32nd International Conference on Very Large Data Bases, VLDB 2006, Seoul, Korea, 2006, 475-486
    
    
10. Don't Compare Averages
    Holger Bast and Ingmar Weber
    In: 4th International Workshop on Efficient and Experimental Algorithms (WEA'05), Santorini Island, Greece, 2005, 67-76
    
9. Insights from Viewing Ranked Retrieval as Rank Aggregation
   Holger Bast and Ingmar Weber
   In: Workshop on Challenges in Web Information Retrieval and Integration (WIRI'05), Tokyo, Japan, 2005, 243-248
   
8. Präzisionssuche im homöopathischen Netz
   Holger Bast
   Homöopathie-Zeitschrift I/05: 119-122, 2005
   
   
7. Towards Self-Organizing Query Routing and Processing for Peer-to-Peer Web Search
   Gerhard Weikum, Holger Bast, Geoffrey Canright, David Hales, Christian Schindelhauer, and Peter Triantafillou
   In: Workshop on Peer-to-peer Data Management in the Complex Systems Perspective, Paris, France, 2005, 7-24
   
6. Why Spectral Retrieval Works
   Holger Bast and Debapriyo Majumdar
   In: 28th Annual International Conference on Research and Development in Information Retrieval (SIGIR'05), Salvador, Brazil, 2005, 11-18
   [PDF: Download: lsiexplained.pdf]
   
5. Dimension Reduction: A Powerful Principle for Automatically Finding Concepts in Unstructured Data
   Holger Bast
   In: International Workshop on Self-* Properties in Complex Information Systems (SELF-STAR 2004), Bertinoro, Italy, 2004, 113-116
   
4. Matching Algorithms Are Fast in Sparse Random Graphs
   Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
   In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 81-92
   
   
3. A Heuristic for Dijkstra's Algorithm With Many Targets and its Use in Weighted Matching Algorithms
   Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
   Algorithmica 36 (1): 75-88, 2003
   
   
2. Fast and Reliable Parallel Hashing
   Holger Bast and Torben Hagerup
   In: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91), Hilton Head Island, South Carolina, USA, 1991, 50-61
   
1. A Perfect Parallel Dictionary
   Holger Bast, Martin Dietzfelbinger, and Torben Hagerup
   In: 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), Prague, Czechoslovakia, 1992, 133-141