11 7 as a byproduct we obtain an time lower bound for the problem of selecting the kth smallest item in a monotone matrix thus extending the best previously known lower bound for selection on the reconfigurable mesh 
