The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hans Rohnert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
    Dynamic Perfect Hashing: Upper and Lower Bounds [Citation Graph (4, 0)][DBLP]
    FOCS, 1988, pp:524-531 [Conf]
  2. Rudolf Fleischer, Otfried Fries, Kurt Mehlhorn, Stefan Meiser, Stefan Näher, Hans Rohnert, Stefan Schirra, Klaus Simon, Athanasios K. Tsakalidis, Christian Uhrig
    Selected Topics from Computational Geometry, Data Structures and Motion Planning. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:25-43 [Conf]
  3. Hans Rohnert
    Moving Discs Between Polygons. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:502-515 [Conf]
  4. Hans Rohnert
    A Dynamization of the All Pairs Least Cost Path Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:279-286 [Conf]
  5. Martin Dietzfelbinger, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert
    Upper and Lower Bounds for the Dictionary Problem (Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:214-215 [Conf]
  6. Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
    On-line Graph Algorithms for Incremental Compilation. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:70-86 [Conf]
  7. Hans Rohnert
    Moving a Disc Between Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:2, pp:182-191 [Journal]
  8. Michael Becker, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter
    A Probabilistic Algorithm for Vertex Connectivity of Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:15, n:3, pp:135-136 [Journal]
  9. Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert
    Maintaining a Topological Order Under Edge Insertions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:1, pp:53-58 [Journal]
  10. Hans Rohnert
    Shortest Paths in the Plane with Convex Polygonal Obstacles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:2, pp:71-76 [Journal]
  11. Hans Rohnert
    Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:4, pp:175-179 [Journal]
  12. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
    Dynamic Perfect Hashing: Upper and Lower Bounds. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:738-761 [Journal]

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