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. // 24 December 2025 to 1 January 2026: The German National Library will be closed at both locations.

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

21 - 30 von 133

	21	On the Composition of Randomized Query Complexity and Approximate Degree Chakraborty, Sourav. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
	22	Pass-efficient randomized LU algorithms for computing low-rank matrix approximation Enthalten in Monte Carlo methods and applications Bd. 29, 2023, Nr. 3: 181-202. 22 S.
	23	Randomized block Krylov subspace algorithms for low-rank quaternion matrix approximations Enthalten in Numerical algorithms 25.9.2023: 1-31
	24	Formalization of Randomized Approximation Algorithms for Frequency Moments Karayel, Emin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
	25	On the efficiency of using correlative randomized algorithms for solving problems of gamma radiation transfer in stochastic medium Enthalten in Russian journal of numerical analysis and mathematical modelling Bd. 37, 2022, Nr. 4: 231-240. 10 S.
	26	Randomized Monte Carlo algorithms for matrix iterations and solving large systems of linear equations Enthalten in Monte Carlo methods and applications Bd. 28, 2022, Nr. 2: 125-133. 9 S.
	27	Comparing algorithms for characterizing treatment effect heterogeneity in randomized trials Enthalten in Biometrical journal 27.11.2022. 27 S.
	28	Randomized algorithms for the computation of multilinear rank- $$(\mu _1,\mu _2,\mu _3)$$ ( μ 1 , μ 2 , μ 3 ) approximations Enthalten in Journal of global optimization 26.5.2022: 1-31
	29	Field Geometry and the Spatial and Temporal Generalization of Crop Classification Algorithms - A randomized Approach to compare Pixel based and Convolution based Methods Gilcher, Mario. - Trier : Universität Trier, 2021
	30	The Randomized Competitive Ratio of Weighted k-Server Is at Least Exponential Ayyadevara, Nikhil. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021