The SCEAS System
Navigation Menu

Search the dblp DataBase


Thomas M. Fischer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas M. Fischer
    On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities. [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:284-291 [Conf]
  2. Thomas M. Fischer
    Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:308-314 [Conf]
  3. Thomas M. Fischer, K. Wolfrum
    On the Inherent Combinatorial Complexity of Geometric Problems in D-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:315-324 [Conf]

Search in 0.001secs, Finished in 0.001secs
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