Efficient point location in a convex spatial cell-complex. Qingzhou Wang and Kam Hoi Cheng . A heuristic of scheduling parallel tasks and its analysis. Pang C. Chen . A method for predicting the performance of tree searching programs.
Counting classes are at least as hard as the polynomial-time hierarchy.
Yossi Azar . Lower bounds for threshold and symmetric functions in parallel computation. Convex decomposition of polyhedra and robustness. Fast gossiping for the hypercube. Beverly Jamison and Stephan Olariu .