Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
The average number of linear extensions of a partial order
Journal of Combinatorial Theory Series A
Faster random generation of linear extensions
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A Modular Calculus for the Average Cost of Data Structuring
A Modular Calculus for the Average Cost of Data Structuring
| Hi-index | 0.00 |
MOQA is a new programming language with the unique property that the average running time of its programs can be (semi-)automatically deduced in a modular way by a static analysis of the program code. This is based on the fact that to each MOQA action there corresponds an operation on partial orders, which associates with each partial order a sequence of partial orders. All programs in MOQA use a special data structure and an associated suite of operations. This data structure consists of a pair ((X,@?),@?), where (X,@?) is a finite poset and @?:X@?L is a bijection from X to a totally ordered set of labels L, satisfying the condition x@?y@?@?(x)=