NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 3
  • 2
  • 1
  • Tagged with
  • 6
  • 6
  • 6
  • 3
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Search results

Showing 1 to 6 of 6 (0.057 seconds)
1

Eine Grundlegung der Average-Case Komlexitätstheorie

Biehl, Ingrid. January 1993 (has links)
Saarbrücken, Univ., Diss., 1993.
Average-case-Komplexität.
2

Eine Grundlegung der Average-case-Komplexitätstheorie

Biehl, Ingrid. January 1900 (has links) (PDF)
Saarbrücken, Univ., Diss., 1993. / Computerdatei im Fernzugriff.
Average-case-Komplexität
3

Eine Grundlegung der Average-case-Komplexitätstheorie

Biehl, Ingrid. Unknown Date (has links) (PDF)
Universiẗat, Diss., 1993--Saarbrücken.
Average-case-Komplexität.
4

Design and analysis of sequential and parallel single-source shortest paths algorithms

Meyer, Ulrich. Unknown Date (has links) (PDF)
University, Diss., 2002--Saarbrücken.
5

Average case approximability of optimisation problems

Schelm, Birgit. Unknown Date (has links) (PDF)
Techn. University, Diss., 2004--Berlin.
6

Worst case instances are fragile average case and smoothed competitive analysis of algorithms /

Schäfer, Guido. Unknown Date (has links) (PDF)
University, Diss., 2004--Saarbrücken.

Page generated in 0.0719 seconds