default search action

combined dblp search
author search
venue search
publication search

ask others

Volker Priebe

> Home > Persons

Person information

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2000 – 2009

see FAQ

What is the meaning of the colors in the publication lists?

2002
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/MehlhornPSS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/MehlhornPSS02
Kurt Mehlhorn, Volker Priebe, Guido Schäfer, Naveen Sivadasan:
All-pairs shortest-paths computation in the presence of negative cycles. Inf. Process. Lett. 81(6): 341-343 (2002)
2001
[b1]
- view
  authority control:
- export record
  dblp key:
  - phd/dnb/Priebe01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/dnb/Priebe01
Volker Priebe:
Average-case complexity of shortest-paths problems. Saarland University, Saarbrücken, Germany, 2001, pp. 1-78
2000
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/rsa/CooperFMP00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/CooperFMP00
Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe:
Average-case complexity of shortest-paths problems in the vertex-potential model. Random Struct. Algorithms 16(1): 33-46 (2000)

1990 – 1999

see FAQ

What is the meaning of the colors in the publication lists?

1997
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/rsa/MehlhornP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/MehlhornP97
Kurt Mehlhorn, Volker Priebe:
On the all-pairs shortest-path algorithm of Moffat and Takaoka. Random Struct. Algorithms 10(1-2): 205-220 (1997)
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/random/CooperFMP97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/random/CooperFMP97
Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe:
Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. RANDOM 1997: 15-26
1995
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/esa/MehlhornP95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/MehlhornP95
Kurt Mehlhorn, Volker Priebe:
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. ESA 1995: 185-198

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.