scientific article; zbMATH DE number 3990870

zbMATH Open0612.68043MaRDI QIDQ3753488FDOQ3753488

Authors: Ľubor Kollár 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• Average-case analysis of the merging algorithm of Hwang and Lin
• The Average Complexity of Parallel Comparison Merging
• Optimal expected-time algorithms for merging
• Publication:4888166
• Computing the number of mergings with constraints
• Stochastic analysis of the Merge-Sort algorithm
• On the distribution of comparisons in sorting algorithms

zbMATH Keywords

efficiency of merging algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cited In (3)

• Optimal expected-time algorithms for merging
• Computing the number of mergings with constraints
• Expected time analysis of interpolation merge -- a simple new merging algorithm

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753488)