The Dyadic Stream Merging Algorithm

DOI10.1006/JAGM.2002.1220MaRDI QIDQ3150278zbMATH OpenOpenAlexFDO

Authors

Publication date 30 September 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2002.1220

zbMATH Keywords

dyadic stream merging algorithmmedia-on-demand serversstream merging

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract)
• Competitive on-line stream merging algorithms for media-on-demand
• scientific article; zbMATH DE number 1929937
• Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
• On-line stream merging in a general setting.

Cited in

(9)

• On-line stream merging in a general setting.
• Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
• Competitive on-line stream merging algorithms for media-on-demand
• Efficient Algorithms for Optimal Stream Merging for Media-on-Demand
• scientific article; zbMATH DE number 1929937 (Why is no real title available?)
• Efficient atomic broadcast using deterministic merge
• Stream fusion, to completeness
• How to mingle streams
• On-line stream merging with max span and min coverage

This page was built for publication: The Dyadic Stream Merging Algorithm

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