|
61 |
Improved space bounds for strongly competitive randomized paging algorithms
Moruz, Gabriel. - Frankfurt am Main : Univ.-Bibliothek Frankfurt am Main, 2013
|
|
|
|
62 |
Randomized Algorithms for Analysis and Control of Uncertain Systems
Tempo, Roberto. - London : Springer London, 2013, 2nd ed. 2013
|
|
|
63 |
Randomized approximation for the matching and vertex cover problem in hypergraphs
Ouali, Mourad el, 2013
|
|
|
|
64 |
Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
Ouali, Mourad el. - Kiel : Universitätsbibliothek Kiel, 2013
|
|
|
|
65 |
Randomized Algorithms for Analysis and Control of Uncertain Systems
Tempo, Roberto. - Guildford, Surrey : Springer London, 2012, 2., nd ed. 2013
|
Verlagsinformation
|
|
|
66 |
Randomized Algorithms for Analysis and Control of Uncertain Systems
Tempo, Roberto. - Guildford, Surrey : Springer London, 2012, 2., nd ed.
|
Verlagsinformation
|
|
67 |
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
Enthalten in Schloss Dagstuhl, Leibniz-Zentrum für Informatik: Dagstuhl Reports 2011, Volume 1, Issue 6, page 24-53
|
|
|
|
68 |
Randomized Algorithms for Analysis and Control of Uncertain Systems
Tempo, Roberto. - Guildford, Surrey : Springer London, 2010, 1., st Edition. Softcover version of original hardcover edition 2005
|
Verlagsinformation
|
|
|
69 |
On the Optimum Communication Cost Problem in Interconnection Networks
Al-Zamil, Khalid. - Saarbrücken : VDM Verlag Dr. Müller, 2009
|
|
|
|
70 |
Randomized Routing Algorithms in Mobile Ad Hoc Networks
Haque, Israat Tanzeena. - Saarbrücken : VDM Verlag Dr. Müller, 2009
|
|
Administration
