Search the dblp DataBase
Volker Priebe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Kurt Mehlhorn, Volker Priebe
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. [Citation Graph (0, 0)][DBLP]
ESA, 1995, pp:185-198 [Conf] - Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. [Citation Graph (0, 0)][DBLP]
RANDOM, 1997, pp:15-26 [Conf] - Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan
All-pairs shortest-paths computation in the presence of negative cycles. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2002, v:81, n:6, pp:341-343 [Journal] - Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe
Average-case complexity of shortest-paths problems in the vertex-potential model. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 2000, v:16, n:1, pp:33-46 [Journal] - Kurt Mehlhorn, Volker Priebe
On the all-pairs shortest-path algorithm of Moffat and Takaoka. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 1997, v:10, n:1-2, pp:205-220 [Journal]
Search in 0.001secs, Finished in 0.001secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002