|
81 |
Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms
Enthalten in Journal of scheduling Bd. 6, Nr. 2, date:3.2003: 113-129
|
|
|
82 |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231)
Dyer, Martin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2002
|
|
|
|
83 |
Randomized pivot algorithms for P-matrix linear complementarity problems
Enthalten in Mathematical programming Bd. 92, Nr. 2, date:4.2002: 285-296
|
|
|
|
84 |
Randomized Algorithms for Stochastic Approximation under Arbitrary Disturbances
Enthalten in Automation and remote control Bd. 63, Nr. 2, date:2.2002: 209-219
|
|
|
|
85 |
Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane
Enthalten in Algorithmica Bd. 33, Nr. 4, date:08.2002: 436-460
|
|
|
86 |
Optimal summation and integration by deterministic, randomized and quantum algorithms
Heinrich, Stefan. - Kaiserslautern : Fachbereich Informatik, Univ., 2001
|
|
|
|
87 |
RAND APX Workshop on Approximation Intractability joint with the Workshop Design and Analysis of Randomized and Approximation Algorithms
RAND APX Workshop on Approximation Intractability (2001 : Dagstuhl). - Bonn : Inst. für Informatik, 2001
|
|
|
|
88 |
Randomized algorithms
Bubley, Russ. - London : Springer, 2001
|
|
|
|
89 |
Randomized Algorithms: Approximation, Generation and Counting
London : Springer London, 2001
|
|
|
|
90 |
Randomized external memory algorithms for some geometric problems
Saarbrücken : MPI Informatik, Bibliothek & Dokumentation, 1998
|
|
Administration
