English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Average-case Complexity of Shortest-paths Problems

Priebe, V. (2001). Average-case Complexity of Shortest-paths Problems. PhD Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Files

show Files

Locators

show
hide
Description:
-
Locator:
http://scidok.sulb.uni-saarland.de/doku/urheberrecht.php?la=de (Copyright transfer agreement)
Description:
-

Creators

show
hide
 Creators:
Priebe, Volker1, 2, Author              
Mehlhorn, Kurt1, Advisor              
Frieze, Alan3, Referee
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551              
3External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-022001-06-012007-07-062001
 Publication Status: Published in print
 Pages: -
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518214
Other: Local-ID: C1256428004B93B8-4647E47D64FE6793C1256B81004BB015-PriebeDiss01
URN: urn:nbn:de:bsz:291-scidok-11807
 Degree: PhD

Event

show

Legal Case

show

Project information

show

Source

show