Katalog der Deutschen Nationalbibliothek

Expertensuche ?

Servicezeiten in Frankfurt am Main ab 1. Dezember 2025: Montag bis Freitag 9–18 Uhr und Samstag 10–16 Uhr
Service hours in Frankfurt am Main from 1 December 2025: Monday to Friday 9:00-18:00 and Saturday 10:00-16:00

Leichte Bedienung, intuitive Suche: Die Betaversion unseres neuen Katalogs ist online! → Zur Betaversion des neuen DNB-Katalogs

24. Dezember 2025 bis 1. Januar 2026: Die Deutsche Nationalbibliothek bleibt an beiden Standorten geschlossen. Bestellte Medien werden am 2. Januar 2026 bereitgestellt. // 24 December 2025 to 1 January 2026: The German National Library will be closed at both locations. Ordered media will be made available on 2 January 2026.

Ergebnis der Suche nach: tit all "Randomized algorithms"
im Bestand: Gesamter Bestand

91 - 100 von 133

	91	A method for obtaining randomized algorithms with small tail probabilities Enthalten in Algorithmica Bd. 16, Nr. 4-5, date:10.1996: 543-547
	92	Randomized geometric algorithms and pseudorandom generators Enthalten in Algorithmica Bd. 16, Nr. 4-5, date:10.1996: 450-463
	93	Introduction to special issue on randomized and derandomized algorithms Enthalten in Algorithmica Bd. 16, Nr. 4-5, date:10.1996: 359-366
	94	Efficient randomized algorithms for some geometric optimization problems Enthalten in Discrete & computational geometry Bd. 16, Nr. 4, date:4.1996: 317-337
	95	Randomized algorithms for the separation of point sets and for solving quadratic programs Enthalten in Applied mathematics & optimization Bd. 32, Nr. 2, date:9.1995: 195-210
	96	Competitive randomized algorithms for nonuniform problems Enthalten in Algorithmica Bd. 11, Nr. 6, date:6.1994: 542-571
	97	Randomized competitive algorithms for the list update problem Enthalten in Algorithmica Bd. 11, Nr. 1, date:1.1994: 15-32
	98	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
	99	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
	100	Randomized Algorithms (Dagstuhl Seminar 9124) Karpinski, Marek. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 1991