Average Case Analysis of Marking Algorithms

DOI10.1137/0215076MaRDI QIDQ3756521zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore, Daniel S. Hirschberg

Publication date 1986

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

Full work available at URL https://escholarship.org/uc/item/42w979xb

zbMATH Keywords

garbage collectionaverage case time complexityaverage sizeLindstrom marking algorithmWegbreit bit stack

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• Average case analysis of bounded space bin packing algorithms
• Average-case analysis of algorithms using Kolmogorov complexity
• scientific article; zbMATH DE number 1008511
• scientific article; zbMATH DE number 3883604
• Average-case analysis of the merging algorithm of Hwang and Lin

Cited in

(2)

• A bounded-space tree traversal algorithm
• Worst-case data structures for the priority queue with attrition

This page was built for publication: Average Case Analysis of Marking Algorithms

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