Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Speckenmeyer, E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The PLB-library: Dynamic load balancing on NOWs
F. Meisgen
,
E. Speckenmeyer
Workshop Anwendungsbezogene Lastverteilung, ALV'98 (München, Germany, March 25-26, 1998) (TUM-I9806), 1998, pp. 89-99
Precomputation based load balancing
M. Böhm
,
E. Speckenmeyer
Proceedings of the 4th Workshop on Parllel Systems and Algorithms, PASA'96 (Jülich, Germany, April 10-12, 1996)
, 1996, pp. 177-194
Optimal oblivious permutation routing in small hypercubes
Th. Seifert
,
E. Speckenmeyer
Proceedings of the 4th Workshop on Parllel Systems and Algorithms, PASA'96 (Jülich, Germany, April 10-12, 1996)
, 1996, pp. 53-66
Classes of CNF-formulas with backtracking trees of exponential or linear average order for exact-satisfiability
E. Speckenmeyer
Lecture Notes in Computer Science
324
, 1988, pp. 529-538
Ramsey numbers and an approximation algorithm for the vertex cover problem
B. Monien
,
E. Speckenmeyer
Acta Informatica
22
(1), 1985, pp. 115-123
Solving satisfiability in less than
2^n
steps
B. Monien
,
E. Speckenmeyer
Discrete Applied Mathematics
10
, 1985, pp. 287-295