- Sprache
-
Englisch
- Identifier
-
1138836931
Thema
Komplexitätstheorie ; Kombinatorische Gruppentheorie ; Komplexität von Algorithmen ; Paralleler Algorithmus; Hochschulschrift
Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:54 MEZ
Objekttyp
- Monografie
Ähnliche Objekte (12)
Design and analysis of sequential and parallel single-source shortest paths algorithms
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Work efficient parallel scheduling algorithms
Toward a complexity theory for randomized search heuristics : black-box models
Algorithms for Triangles, Cones & Peaks
Parallele Genetische Algorithmen mit Anwendungen
Parallele Genetische Algorithmen
Data structures for parallel exponentiation in finite fields
The cost of being restricted by time, knowledge or fairness in scheduling and allocation problems : or: How to run an Asian restaurant as a mathematician
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
An L3-U3-quotient algorithm for finitely presented groups
A parallel algebraic multigrid method for elliptic problems with highly discontinuous coefficients
Design and analysis of sequential and parallel single-source shortest paths algorithms
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Work efficient parallel scheduling algorithms
Toward a complexity theory for randomized search heuristics : black-box models
Algorithms for Triangles, Cones & Peaks
Parallele Genetische Algorithmen mit Anwendungen
Parallele Genetische Algorithmen
Data structures for parallel exponentiation in finite fields
The cost of being restricted by time, knowledge or fairness in scheduling and allocation problems : or: How to run an Asian restaurant as a mathematician
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
An L3-U3-quotient algorithm for finitely presented groups
A parallel algebraic multigrid method for elliptic problems with highly discontinuous coefficients
Design and analysis of sequential and parallel single-source shortest paths algorithms
Streaming, Local, and MultiLevel (Hyper)Graph Decomposition
Work efficient parallel scheduling algorithms
Toward a complexity theory for randomized search heuristics : black-box models
Algorithms for Triangles, Cones & Peaks
Parallele Genetische Algorithmen mit Anwendungen
Parallele Genetische Algorithmen
Data structures for parallel exponentiation in finite fields
The cost of being restricted by time, knowledge or fairness in scheduling and allocation problems : or: How to run an Asian restaurant as a mathematician
Worst case instances are fragile : average case and smoothed competitive analysis of algorithms
An L3-U3-quotient algorithm for finitely presented groups