×

Found 109 Documents (Results 1–100)

A survey on priority queues. (English) Zbl 1394.68091

Brodnik, Andrej (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). Lecture Notes in Computer Science 8066, 150-163 (2013).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI Link

QuickHeapsort: modifications and improved analysis. (English) Zbl 1345.68120

Bulatov, Andrei A. (ed.) et al., Computer science – theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25–29, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38535-3/pbk). Lecture Notes in Computer Science 7913, 24-35 (2013).
MSC:  68P10 68W40
PDFBibTeX XMLCite
Full Text: DOI arXiv

Two constant-factor-optimal realizations of adaptive heapsort. (English) Zbl 1314.68112

Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 22nd international workshop, IWOCA 2011, Victoria, BC, Canada, July 20–22, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-25010-1/pbk). Lecture Notes in Computer Science 7056, 195-208 (2011).
MSC:  68P10 68W40
PDFBibTeX XMLCite
Full Text: DOI

Comparator networks for binary heap construction. (English) Zbl 1502.68088

Arnborg, Stefan (ed.) et al., Algorithm theory – SWAT’98. 6th Scandinavian workshop on algorithm theory, Stockholm, Sweden, July 8–10, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1432, 158-168 (1998).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Worst-case efficient external-memory priority queues. (English) Zbl 1502.68087

Arnborg, Stefan (ed.) et al., Algorithm theory – SWAT’98. 6th Scandinavian workshop on algorithm theory, Stockholm, Sweden, July 8–10, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1432, 107-118 (1998).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

The ultimate heapsort. Repr. from Australian Computer Science Communications 20, No. 3 (1998). (English) Zbl 0951.68506

Lin, Xuemin (ed.), Computing theory ‘98. Proceedings of the 4th Australasian theory symposium - CATS ‘98, Perth, Australia, February 2-3, 1998. Singapore: Springer. 87-95 (1998).
MSC:  68P10
PDFBibTeX XMLCite

The randomized complexity of maintaining the minimum. (English) Zbl 1502.68137

Karlsson, Rolf (ed.) et al., Algorithm theory – SWAT ’96. 5th Scandinavian workshop on algorithm theory, Reykjavík, Iceland, July 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1097, 4-15 (1996).
PDFBibTeX XMLCite
Full Text: DOI

Searching rigid data structures (extended abstract). (English) Zbl 1527.68046

Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 1st international conference, COCOON ’95, Xi’an, China, August 24–26, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 959, 446-451 (1995).
PDFBibTeX XMLCite
Full Text: DOI

Heap construction: optimal in both worst and average cases? (English) Zbl 1512.68065

Staples, John (ed.) et al., Algorithms and computations. 6th international symposium, ISAAC ’95, Cairns, Australia, December 4–6, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 1004, 254-263 (1995).
MSC:  68P05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Amortization results for chromatic search trees, with an application to priority queues. (English) Zbl 1502.68085

Akl, Selim G. (ed.) et al., Algorithms and data structures. 4th international workshop, WADS ’95, Kingston, Canada, August 16–18, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 955, 270-281 (1995).
MSC:  68P05
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software