Average-Case Time of Basic MOQA Operations

Joint with D. Early

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.


Partial Order Product Operation Average Running Time Combinatorial Identity Element Subset 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Personalised recommendations