Katalog der Deutschen Nationalbibliothek

Neuigkeiten Donnerstag, 11. September 2025: Die Deutsche Nationalbibliothek öffnet wegen eines Beschäftigtentreffens an beiden Standorten erst um 15 Uhr. // Thursday, 11 September 2025: The German National Library will not open until 15:00 due to a staff meeting at both locations.
 
Neuigkeiten Vom 10. September 2025, 13 Uhr, bis 11. September 2025, 22 Uhr, kann es zu Einschränkungen bei der Bereitstellung von Medienwerken kommen. Wir informieren Sie per E-Mail über den aktuellen Stand Ihrer Bestellungen. // From 13:00 on 10 September 2025 until 22:00 on 11 September 2025, there may be restrictions on the provision of media works. We will inform you by email about the current status of your orders.
 
 
 


Ergebnis der Suche nach: tit all "Analysis of Sorting Algorithms"
im Bestand: Gesamter Bestand

1 - 8 von 8
<< < > >>


Artikel 1 Analysis of Overall Assignment and Sorting of Tasks in Heterogeneous Computing Systems Based on Mathematical Programming Algorithms
Enthalten in Wireless personal communications 6.9.2021: 1-19
Online Ressource
Online Ressourcen 2 A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
Clément, Julien. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2013
Online Ressource
Artikel 3 The Analysis of Evolutionary Algorithms on Sorting and Shortest Paths Problems
Enthalten in Journal of mathematical modelling and algorithms Bd. 3, Nr. 4, date:12.2004: 349-366
Online Ressource
Artikel 4 The analysis of evolutionary algorithms on sorting and shortest paths problems
Enthalten in Journal of mathematical modelling and algorithms Bd. 3, Nr. 4, date:1.2005: 349-366
Online Ressource
Artikel 5 An Experimental Analysis of Parallel Sorting Algorithms
Enthalten in Theory of computing systems Bd. 31, Nr. 2, date:4.1998: 135-167
Online Ressource
Artikel 6 Design and analysis of predictive sorting algorithms
Enthalten in Korean journal of computational & applied mathematics Bd. 3, Nr. 1, date:3.1996: 11-24
Online Ressource
Artikel 7 Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
Enthalten in BIT Bd. 29, Nr. 2, date:6.1989: 239-250
Online Ressource
Artikel 8 Continuous models that are equivalent to randomness for the analysis of many sorting algorithms
Enthalten in Computing Bd. 31, Nr. 1, date:3.1983: 11-31
Online Ressource


1 - 8 von 8
<< < > >>


E-Mail-IconAdministration