In this chapter, we outline formulas for computing the average running time of basic MOQAoperations, obtained by D. Early. First, we outline a simplification of the average running time of the product function in terms of a more elementary function. In the second part, we show how this function can be further simplified in the special case of partial orders which can be constructed by series-parallel operations alone. We also show how the average running time for the delete operation can be simplified in these cases. Finally, we show how the simplifications derived in the second part can be applied to certain inductively defined structures.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2008). Average-Case Time of Basic MOQA Operations. In: A Modular Calculus for the Average Cost of Data Structuring. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-73384-5_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-73384-5_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-73383-8
Online ISBN: 978-0-387-73384-5
eBook Packages: Computer ScienceComputer Science (R0)