|
121 |
Efficient randomized generation of optimal algorithms for multiplication in certain finite fields
Shokrollahi, Mohammad Amin. - Bonn : Inst. für Informatik, 1991
|
|
|
|
122 |
Randomized algorithms
Saarbrücken : Geschäftsstelle Schloss Dagstuhl, 1991
|
|
|
123 |
Randomized Algorithms (Dagstuhl Seminar 9124)
Karpinski, Marek. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 1991
|
|
|
|
124 |
Tail estimates for the space complexity of randomized incremental algorithms
Mehlhorn, Kurt. - Saarbrücken : MPI Informatik, 1991
|
|
|
|
125 |
Tail estimates for the space complexity of randomized incremental algorithms
Mehlhorn, Kurt. - Berlin : Freie Univ., Fachbereich Mathematik, 1991
|
|
|
|
126 |
Dealing with hard problems
Chvátal, Vašek. - Bonn : Sonderforschungsbereich 303, 1990
|
|
|
|
127 |
Dealing with hard problems
Chvátal, Vašek. - Bonn : Forschungsinst. für Diskrete Mathematik, 1990
|
|
|
128 |
Characterizations of semantic domains for randomized algorithms
Enthalten in Japan journal of applied mathematics Bd. 6, Nr. 1, date:2.1989: 111-146
|
|
|
|
129 |
Randomized rounding: A technique for provably good algorithms and algorithmic proofs
Enthalten in Combinatorica Bd. 7, Nr. 4, date:12.1987: 365-374
|
|
|
|
130 |
Randomized algorithms: An annotated bibliography
Enthalten in Annals of operations research Bd. 1, Nr. 3, date:10.1984: 331-345
|
|
Administration
