The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Johannes Fischer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johannes Fischer, Volker Heun
    Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:36-48 [Conf]
  2. Johannes Fischer, Simon W. Ginzinger
    A 2-Approximation Algorithm for Sorting by Prefix Reversals. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:415-425 [Conf]
  3. Johannes Fischer, Volker Heun, Stefan Kramer
    Fast Frequent String Mining Using Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    ICDM, 2005, pp:609-612 [Conf]
  4. Johannes Fischer, Luc De Raedt
    Towards Optimizing Conjunctive Inductive Queries. [Citation Graph (0, 0)][DBLP]
    KDID, 2003, pp:44-59 [Conf]
  5. Johannes Fischer, Luc De Raedt
    Towards Optimizing Conjunctive Inductive Queries. [Citation Graph (0, 0)][DBLP]
    PAKDD, 2004, pp:625-637 [Conf]
  6. Johannes Fischer, Volker Heun, Stefan Kramer
    Optimal String Mining Under Frequency Constraints. [Citation Graph (0, 0)][DBLP]
    PKDD, 2006, pp:139-150 [Conf]
  7. Jan Mark Pohlmann, Johannes Fischer, Andreas Jaeschke
    Wissensbasiertes Hypermedia-System zur Erkennung von Ackerpflanzen und Beurteilung von Standorten. [Citation Graph (0, 0)][DBLP]
    Informatik für den Umweltschutz, 1990, pp:257-266 [Conf]
  8. Simon W. Ginzinger, Johannes Fischer
    SimShift: Identifying structural similarities from NMR chemical shifts. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:4, pp:460-465 [Journal]
  9. Amihood Amir, Johannes Fischer, Moshe Lewenstein
    Two-Dimensional Range Minimum Queries. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:286-294 [Conf]
  10. Paolo Ferragina, Johannes Fischer
    Suffix Arrays on Words. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:328-339 [Conf]
  11. Johannes Fischer, Volker Heun
    A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:459-470 [Conf]

  12. An(other) Entropy-Bounded Compressed Suffix Tree. [Citation Graph (, )][DBLP]


  13. Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries. [Citation Graph (, )][DBLP]


  14. Advantages of Shared Data Structures for Sequences of Balanced Parentheses. [Citation Graph (, )][DBLP]


  15. Short Labels for Lowest Common Ancestors in Trees. [Citation Graph (, )][DBLP]


  16. Space Efficient String Mining under Frequency Constraints. [Citation Graph (, )][DBLP]


  17. Optimal Succinctness for Range Minimum Queries. [Citation Graph (, )][DBLP]


  18. Optimal Succinctness for Range Minimum Queries [Citation Graph (, )][DBLP]


  19. Wee LCP [Citation Graph (, )][DBLP]


Search in 0.138secs, Finished in 0.139secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002