One-sided interval trees

MaRDI QIDQ2834332zbMATH OpenFDO

Authors Svante Janson

Publication date 28 November 2016

Published in Journal of the Iranian Statistical Society JIRSS (Search for Journal in Brave)

Full work available at URL http://jirss.irstat.ir/browse.php?a_id=109&slc_lang=en&sid=1&ftxt=1

zbMATH Keywords

car parkinginterval treesrenewal theory

Mathematics Subject Classification ID

Trees (05C05) Applications of renewal theory (reliability, demand theory, etc.) (60K10)

Recommendations

• One-sided variations on interval trees
• One-sided variations on binary search trees
• scientific article; zbMATH DE number 5606397
• scientific article; zbMATH DE number 2127736
• The maximal gap in division of one-sided interval trees
• Directed one-trees
• scientific article; zbMATH DE number 2085442
• The interval B-tree
• A one-to-one correspondence between a class of leftist trees and binary trees

Cited in

(9)

• Normal limiting distribution of the size of binary interval trees
• Fragment size distributions in random fragmentations with cutoff
• Paths in \(m\)-ary interval trees
• One-stage tree: end-to-end tree builder and pruner
• scientific article; zbMATH DE number 5606397 (Why is no real title available?)
• One-sided variations on interval trees
• The maximal gap in division of one-sided interval trees
• Renewal theory in the analysis of tries and strings
• The size of random fragmentation trees

This page was built for publication: One-sided interval trees

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