Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Kinetic heap-ordered trees: Tight analysis and improved algorithms

From MaRDI portal
Publication:1853697
Jump to:navigation, search

DOI10.1016/S0020-0190(02)00366-6zbMath1011.68024OpenAlexW2161273472MaRDI QIDQ1853697

Celina M. Herrera de Figueiredo, Guilherme Dias da Fonseca

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

data structurescomputational geometrykinetic data structuresheaps


Mathematics Subject Classification ID

Data structures (68P05)


Related Items (1)

Kinetic hanger



Cites Work

  • Data Structures for Mobile Data


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1853697&oldid=14239130"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:12.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki