Minimum cuts in near-linear time. From Algol to polymorphic linear lambda-calculus. The fault span of crash failures. An axiomatic treatment of three qualitative decision criteria. Learning functions represented as multiplicity automata.
Speed is as powerful as clairvoyance.
Relational queries over interpreted structures. A needed narrowing strategy. A neuroidal architecture for cognitive computation. A lower bound on the average-case complexity of shellsort. Tight bounds for k -set agreement.