A Modular Calculus for the Average Cost of Data Structuring
- Author
- Michel Schellekens
- Publication Year
- 2008
- Publisher
- Springer
- Language
- English
- Document Type
- Book
- Faculty / Subject Heading
- Computer Science
- Download Book Read book
This volume, with forewords by Greg Bollella and Dana Scott, presents novel programs based on the new advances in this area, including the first randomness-preserving version of Heapsort. Programs are provided, along with derivations of their average-case time, to illustrate the radically different approach to average-case timing. The automated static timing tool applies the Modular Calculus to extract the average-case running time of programs directly from their MOQA code.
Keywords: Computer science / algorithm / Algorithms / Complexity / Computer science / Data structures / Programming / Programming language / Random structures/ real-time / Real-time languages / Semantics / Series-parallel data structures / Software timing/power analysis / Sorting and search algorithms / Static analysis / Algorithm analysis and problem complexity
