On the size of DeRemer's analyzers
Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time
Bounds for on-line selection
Pebbling dynamic graphs in minimal space
On the conjecture relating minimax and minimean complexity norms
Using counterexample it has been shown that an algorithm which is minimax optimal and over all minimax optimal algorithms is minimean optimal and has a uniform behaviour need not to be minimean optimal.
On the lower bound for minimum comparison selection
Page 1