The SCEAS System
Navigation Menu

Search the dblp DataBase


Holger Bast: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Holger Bast, Ingmar Weber
    The CompleteSearch Engine: Interactive, Efficient, and Towards IR& DB Integration. [Citation Graph (0, 0)][DBLP]
    CIDR, 2007, pp:88-95 [Conf]
  2. Holger Bast, Georges Dupret, Debapriyo Majumdar, Benjamin Piwowarski
    Discovering a Term Taxonomy from Term Similarities Using Principal Component Analysis. [Citation Graph (0, 0)][DBLP]
    EWMF/KDO, 2005, pp:103-120 [Conf]
  3. Holger Bast, Martin Dietzfelbinger, Torben Hagerup
    A Perfect Parallel Dictionary. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:133-141 [Conf]
  4. Holger Bast, Debapriyo Majumdar
    Why spectral retrieval works. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2005, pp:11-18 [Conf]
  5. Holger Bast, Ingmar Weber
    Type less, find more: fast autocompletion search with a succinct index. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2006, pp:364-371 [Conf]
  6. Holger Bast, Torben Hagerup
    Fast and Reliable Parallel Hashing. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:50-61 [Conf]
  7. Holger Bast, Christian Worm Mortensen, Ingmar Weber
    Output-Sensitive Autocompletion Search. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:150-162 [Conf]
  8. Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
    Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:81-92 [Conf]
  9. Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Martin Theobald, Gerhard Weikum
    IO-Top-k: Index-access Optimized Top-k Query Processing. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:475-486 [Conf]
  10. Holger Bast, Ingmar Weber
    Don't Compare Averages. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:67-76 [Conf]
  11. Holger Bast, Ingmar Weber
    Insights from Viewing Ranked Retrieval as Rank Aggregation. [Citation Graph (0, 0)][DBLP]
    WIRI, 2005, pp:232-239 [Conf]
  12. Holger Bast, Kurt Mehlhorn, Guido Schäfer
    A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:1, pp:75-88 [Journal]
  13. Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hisao Tamaki
    Matching Algorithms Are Fast in Sparse Random Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:1, pp:3-14 [Journal]
  14. Holger Bast, Stefan Funke, Domagoj Matijevic, Peter Sanders, Dominik Schultes
    In Transit to Constant Time Shortest-Path Queries in Road Networks. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  15. Holger Bast, Alexandru Chitea, Fabian M. Suchanek, Ingmar Weber
    ESTER: efficient search on text, entities, and relations. [Citation Graph (0, 0)][DBLP]
    SIGIR, 2007, pp:671-678 [Conf]
  16. Martin Theobald, Holger Bast, Debapriyo Majumdar, Ralf Schenkel, Gerhard Weikum
    TopX: efficient and versatile top- k query processing for semistructured data. [Citation Graph (0, 0)][DBLP]
    VLDB J., 2008, v:0, n:, pp:- [Journal]

  17. Efficient interactive query expansion with complete search. [Citation Graph (, )][DBLP]

  18. Semantic Full-Text Search with ESTER: Scalable, Easy, Fast. [Citation Graph (, )][DBLP]

  19. Fast error-tolerant search on very large texts. [Citation Graph (, )][DBLP]

  20. IO-Top-k at TREC 2006: Terabyte Track. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002