Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme

Nebel M, Wild S (2014)
In: Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. Bousquet-Mélou M, Soria M (Eds); DMTCS-HAL Proceedings Series. 325-338.

Download
No fulltext has been uploaded. References only!
Conference Paper | Published | English

No fulltext has been uploaded

Author
;
Editor
Bousquet-Mélou, Mireille ; Soria, Michèle
Publishing Year
Conference
25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2014)
Location
Paris, France
Conference Date
2014-06-16 – 2014-06-20
PUB-ID

Cite this

Nebel M, Wild S. Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme. In: Bousquet-Mélou M, Soria M, eds. Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. DMTCS-HAL Proceedings Series. 2014: 325-338.
Nebel, M., & Wild, S. (2014). Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme. In M. Bousquet-Mélou & M. Soria (Eds.), DMTCS-HAL Proceedings Series. Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (pp. 325-338).
Nebel, M., and Wild, S. (2014). “Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme” in Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Bousquet-Mélou, M., and Soria, M. eds. DMTCS-HAL Proceedings Series 325-338.
Nebel, M., & Wild, S., 2014. Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme. In M. Bousquet-Mélou & M. Soria, eds. Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. DMTCS-HAL Proceedings Series. pp. 325-338.
M. Nebel and S. Wild, “Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme”, Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, M. Bousquet-Mélou and M. Soria, eds., DMTCS-HAL Proceedings Series, 2014, pp.325-338.
Nebel, M., Wild, S.: Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme. In: Bousquet-Mélou, M. and Soria, M. (eds.) Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. DMTCS-HAL Proceedings Series. p. 325-338. (2014).
Nebel, Markus, and Wild, Sebastian. “Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme”. Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. Ed. Mireille Bousquet-Mélou and Michèle Soria. 2014. DMTCS-HAL Proceedings Series. 325-338.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Sources

arXiv 1403.6602

Search this title in

Google Scholar