Two Probabilistic Results on Merging

DOI10.1137/0222019zbMath0770.68067OpenAlexW2068419198MaRDI QIDQ4032936

Sampath Kannan, Miklos Santha, Wenceslas Fernandez de la Vega

Publication date: 17 May 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222019

zbMATH Keywords

randomized algorithmlower boundinformation theorymerging

Mathematics Subject Classification ID

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

Related Items (2)

On the optimality of tape merge of two lists with similar size ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures

This page was built for publication: Two Probabilistic Results on Merging