Geometric Containment is not Reducible to Pareto Dominance. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (STACS, 1985)

On the Expected Complexity of Distributed Selection. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney (STACS, 1987)

Geometric Containment and Vector Dominance. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (Theor. Comput. Sci., 1987)

Geometric Containment, Common Roots of Polynomials and Partial Orders. - Nicola Santoro; Stuart J. Sidney; Jorge Urrutia (STACS, 1988)

A Combinatorial Result About Points and Balls in Euclidean Space. - Imre Bárány; James H. Schmerl; Stuart J. Sidney; Jorge Urrutia (Discret. Comput. Geom., 1989)

Geometric Containment and Partial Orders. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney; Jorge Urrutia (SIAM J. Discret. Math., 1989)

A Distributed Batching System for Parallel Processing. - Robert D. Silverman; Stuart J. Sidney (Softw. Pract. Exp., 1989)

Average properties of two-dimensional partial orders. - Jeffrey B. Sidney; Stuart J. Sidney; Art Warburton (Networks, 1991)

A Distributed Selection Algorithm and its Expected Communication Complexity. - Nicola Santoro; Jeffrey B. Sidney; Stuart J. Sidney (Theor. Comput. Sci., 1992)