|
111 |
A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio
Enthalten in Mathematical programming Bd. 61, Nr. 1-3, date:8.1993: 39-52
|
|
|
112 |
A method for obtaining randomized algorithms with small tail probalities
Saarbrücken : MPI Informatik, 1992
|
|
|
|
113 |
Simple randomized algorithms for closest pair problems
Saarbrücken : MPI Informatik, 1992
|
|
|
|
114 |
Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
Enthalten in Computational complexity Bd. 2, Nr. 1, date:3.1992: 67-96
|
|
|
|
115 |
Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
Shokrollahi, Mohammad Amin. - Bonn : Inst. für Informatik, 1991
|
|
|
|
116 |
Randomized algorithms
Saarbrücken : Geschäftsstelle Schloss Dagstuhl, 1991
|
|
|
117 |
Randomized Algorithms (Dagstuhl Seminar 9124)
Karpinski, Marek. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 1991
|
|
|
|
118 |
Tail estimates for the space complexity of randomized incremental algorithms
Mehlhorn, Kurt. - Saarbrücken : MPI Informatik, 1991
|
|
|
|
119 |
Tail estimates for the space complexity of randomized incremental algorithms
Mehlhorn, Kurt. - Berlin : Freie Univ., Fachbereich Mathematik, 1991
|
|
|
|
120 |
Dealing with hard problems
Chvátal, Vašek. - Bonn : Sonderforschungsbereich 303, 1990
|
|
Administration
