|
91 |
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
|
|
|
|
92 |
Randomized algorithms
Bubley, Russ. - London : Springer, 2001
|
|
|
93 |
Randomized Algorithms: Approximation, Generation and Counting
London : Springer London, 2001
|
|
|
|
94 |
Randomized external memory algorithms for some geometric problems
Saarbrücken : MPI Informatik, Bibliothek & Dokumentation, 1998
|
|
|
95 |
Efficient Randomized Algorithms for the Repeated Median Line Estimator
Enthalten in Algorithmica Bd. 20, Nr. 2, date:2.1998: 136-150
|
|
|
|
96 |
Randomized Simplex Algorithms on Klee-Minty Cubes
Enthalten in Combinatorica Bd. 18, Nr. 3, date:3.1998: 349-372
|
|
|
|
97 |
Worst-case properties of the uniform distribution and randomized algorithms for robustness analysis
Enthalten in Mathematics of control, signals, and systems Bd. 11, Nr. 3, date:9.1998: 183-196
|
|
|
|
98 |
Fast randomized and parallel algorithms for cycle problems on graphs
Dorgerloh, Carsten F., 1997
|
|
|
|
99 |
Ultrafast randomized parallel construction and approximation algorithms for spanning forests in dense graphs
Bonn : Inst. für Informatik, 1997
|
|
|
|
100 |
Discovering all most specific sentences by randomized algorithms
Gunopulos, Dimitris. - Saarbrücken : Max-Planck-Inst. für Informatik, Bibliothek & Dokumentation, 1996
|
|
Administration
