QuickHeapsort: Modifications and Improved Analysis

Volker Diekert, A. Weiss

Type: Article

Publication Date: 2015-09-15

Citations: 5

DOI: https://doi.org/10.1007/s00224-015-9656-y

View Publication

Download PDF

Locations

Theory of Computing Systems - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+ PDF Chat	QuickHeapsort: Modifications and Improved Analysis	2013	Volker Diekert A. Weiss
+ PDF Chat	Quicksort with Unreliable Comparisons: A Probabilistic Analysis	2004	Laurent Alonso Philippe Chassaing Florent Gillet Svante Janson Edward M. Reingold René Schott
+	Swift 4.2 Essentials	2018	Mark Hoath
+	Analyzing variants of Shellsort	2001	Broňa Brejová
+	Implementations, algorithms, and more	1987	John R. Anderson
+	Quicksort with unreliable comparisons: a probabilistic analysis	2003	Laurent Alonso Philippe Chassaing Florent Gillet Svante Janson Edward M. Reingold René Schott
+	Running from Features: Optimized Evaluation of Inationary	2015	Hayato Motohashi Wayne Hu
+ PDF Chat	Scalable Typestate Analysis for Low-Latency Environments	2022	Alen Arslanagić Pavle Subotić Jorge A. Pérez
+	Optimizations of the subresultant algorithm	2000	Lionel Ducos
+	Warm-up techniques	1990	L Kravitz C J Cisar
+ PDF Chat	QuickXsort: A Fast Sorting Scheme in Theory and Practice	2019	Stefan Edelkamp A. Weiss Sebastian Wild
+	Extras: Rungetheorie und Anwendungen	2018	Jürgen Müller
+ PDF Chat	FeynCalc 9.3: New features and improvements	2020	Vladyslav Shtabovenko R. Mertig F. Orellana
+ PDF Chat	Thrackles: An Improved Upper Bound	2018	Radoslav Fulek János Pach
+	Thrackles: An improved upper bound	2019	Radoslav Fulek János Pach
+	MathsCasts: Cramer's Rule for 2 Variables	2011	V. Weiß
+	KATS-Universal Solver: Preliminary Results	2016	Haoyue Weng Alexandre Martin
+ PDF Chat	Accelerated Data-Flow Analysis	2007	Jérôme Leroux Grégoire Sutre
+	pyemir v0.8.1	2015	S. Pascual
+	Réf. : Re: [NV-L] Problems with snmpwalk andstatus polling	2006	Denis Piarotas

Works That Cite This (2)

Action	Title	Year	Authors
+ PDF Chat	QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average	2014	Stefan Edelkamp A. Weiss
+ PDF Chat	QuickXsort: A Fast Sorting Scheme in Theory and Practice	2019	Stefan Edelkamp A. Weiss Sebastian Wild

Works Cited by This (1)

Action	Title	Year	Authors
+	Introduction to Algorithms, third edition	2009	Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein