Monografie
Design and analysis of sequential and parallel single-source shortest paths algorithms
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Univ., Diss., 2002
- Identifier
-
97232271X
Thema
Kürzester-Weg-Problem ; Average-case-Komplexität ; Sequenzieller Algorithmus ; Paralleler Algorithmus ; Kürzester-Weg-Problem ; Average-case-Komplexität ; Sequentieller Algorithmus ; Paralleler Algorithmus; Hochschulschrift; Online-Publikation
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:58 MEZ
Objekttyp
- Monografie
Beteiligte
Ähnliche Objekte (12)
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Automatische Parallelisierung numerischer Programme durch Mustererkennung
Parallel evaluation of algebraic circuits
Data structures for parallel exponentiation in finite fields
Algorithms for the Steiner problem in networks
Work efficient parallel scheduling algorithms
Curve reconstruction and the traveling salesman problem
Parallel filter algorithms for data assimilation in oceanography
Effiziente parallele Ausführung irregulärer rekursiver Programme
Designing parallel algorithms for SMP clusters
New contributions to spatial partitioning and parallel global illumination algorithms
Rigorously analyzed algorithms for the discrete logarithm problem in quadratic number fields
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Automatische Parallelisierung numerischer Programme durch Mustererkennung
Parallel evaluation of algebraic circuits
Data structures for parallel exponentiation in finite fields
Algorithms for the Steiner problem in networks
Work efficient parallel scheduling algorithms
Curve reconstruction and the traveling salesman problem
Parallel filter algorithms for data assimilation in oceanography
Effiziente parallele Ausführung irregulärer rekursiver Programme
Designing parallel algorithms for SMP clusters
New contributions to spatial partitioning and parallel global illumination algorithms
Rigorously analyzed algorithms for the discrete logarithm problem in quadratic number fields
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
Automatische Parallelisierung numerischer Programme durch Mustererkennung
Parallel evaluation of algebraic circuits
Data structures for parallel exponentiation in finite fields
Algorithms for the Steiner problem in networks
Work efficient parallel scheduling algorithms
Curve reconstruction and the traveling salesman problem
Parallel filter algorithms for data assimilation in oceanography
Effiziente parallele Ausführung irregulärer rekursiver Programme
Designing parallel algorithms for SMP clusters
New contributions to spatial partitioning and parallel global illumination algorithms