Maximum Likelihood Analysis of Heapsort
Laube U, E. Nebel M (2009)
In: Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009. Society for Industrial and Applied Mathematics: 41--50.
Konferenzbeitrag | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Laube, Ulrich;
E. Nebel, Markus
Einrichtung
Erscheinungsjahr
2009
Titel des Konferenzbandes
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009
Seite(n)
41--50
ISBN
9780898719321
Page URI
https://pub.uni-bielefeld.de/record/2910029
Zitieren
Laube U, E. Nebel M. Maximum Likelihood Analysis of Heapsort. In: Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009. Society for Industrial and Applied Mathematics; 2009: 41--50.
Laube, U., & E. Nebel, M. (2009). Maximum Likelihood Analysis of Heapsort. Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009, 41--50. Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611972993.7
Laube, Ulrich, and E. Nebel, Markus. 2009. “Maximum Likelihood Analysis of Heapsort”. In Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009, 41--50. Society for Industrial and Applied Mathematics.
Laube, U., and E. Nebel, M. (2009). “Maximum Likelihood Analysis of Heapsort” in Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009 (Society for Industrial and Applied Mathematics), 41--50.
Laube, U., & E. Nebel, M., 2009. Maximum Likelihood Analysis of Heapsort. In Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009. Society for Industrial and Applied Mathematics, pp. 41--50.
U. Laube and M. E. Nebel, “Maximum Likelihood Analysis of Heapsort”, Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009, Society for Industrial and Applied Mathematics, 2009, pp.41--50.
Laube, U., E. Nebel, M.: Maximum Likelihood Analysis of Heapsort. Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009. p. 41--50. Society for Industrial and Applied Mathematics (2009).
Laube, Ulrich, and E. Nebel, Markus. “Maximum Likelihood Analysis of Heapsort”. Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009, New York, New York, USA, January 03, 2009. Society for Industrial and Applied Mathematics, 2009. 41--50.
Google Scholar
ISBN Suche