PaperOptimal bounds for finding maximum on array of processors with K global busesAlok AggarwalIEEE TC
PaperOn computing the closest boundary point on the convex hullAlok Aggarwal, Michael HawrylyczInformation Processing Letters
PaperEquivalence of free boolean graphs can be decided probabilistically in polynomial timeManuel Blum, Ashok K. Chandra, et al.Information Processing Letters
