Log-logarithmic selection resolution protocols in a multiple access channel. Efficient algorithms for geometric graph search problems. Planar multicommodity flows, maximum matchings and negative cycles. Relativizations of unambiguous and random polynomial time classes. Probabilities related to father-son distances in binary search trees.
Negation is powerless for Boolean slice functions.
On the Lagarias-Odlyzko algorithm for the subset sum problem. Robert Alan Wright , Bruce Richmond , Andrew Odlyzko , and Brendan D. McKay . Constant time generation of free trees. Allan Borodin , Danny Dolev , Faith E. Fich , and Wolfgang Paul . Bounds for width two branching programs.