Kinetic heap-ordered trees: Tight analysis and improved algorithms

DOI10.1016/S0020-0190(02)00366-6MaRDI QIDQ1853697zbMATH OpenOpenAlexFDO

Authors Guilherme D. Da Fonseca, Celina M. H. de Figueiredo

Publication date 22 January 2003

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0190(02)00366-6

zbMATH Keywords

computational geometrydata structuresheapskinetic data structures

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract)
• scientific article; zbMATH DE number 1947377
• Out-of-Order Event Processing in Kinetic Data Structures
• Soft kinetic data structures
• Kinetic and dynamic data structures for convex hulls and upper envelopes

Cites work

• Data Structures for Mobile Data

Cited in

(3)

• Faster kinetic heaps and their use in broadcast scheduling. (Extended abstract)
• The derivation of a tighter bound for top-down skew heaps
• Kinetic hanger

This page was built for publication: Kinetic heap-ordered trees: Tight analysis and improved algorithms

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