List Factoring and Relative Worst Order Analysis

DOI10.1007/978-3-642-18318-8_11MaRDI QIDQ3075455zbMATH OpenOpenAlexFDO

Authors Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen

Publication date 15 February 2011

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18318-8_11

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• List factoring and relative worst order analysis
• Relative Worst-Order Analysis: A Survey
• Computing longest previous factor in linear time and applications
• Faster optimal parallel prefix sums and list ranking
• Purely Functional Worst Case Constant Time Catenable Sorted Lists
• scientific article; zbMATH DE number 140457
• Analysis approximate factorization in iteration methods
• Deterministic parallel list ranking
• scientific article; zbMATH DE number 4064468
• On the complexity of list ranking in the parallel external memory model

Cited in

(5)

• List's worst-average-case or WAC ratio
• List update with probabilistic locality of reference
• Purely Functional Worst Case Constant Time Catenable Sorted Lists
• Relative Worst-Order Analysis: A Survey
• List factoring and relative worst order analysis

This page was built for publication: List Factoring and Relative Worst Order Analysis

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