| 1992 |
|---|
| 7 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney:
A Distributed Selection Algorithm and its Expected Communication Complexity.
Theor. Comput. Sci. 100(1): 185-204 (1992) |
| 1989 |
|---|
| 6 | | Imre Bárány,
James H. Schmerl,
Stuart J. Sidney,
Jorge Urrutia:
A Combinatorial Result About Points and Balls in Euclidean Space.
Discrete & Computational Geometry 4: 259-262 (1989) |
| 5 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment and Partial Orders.
SIAM J. Discrete Math. 2(2): 245-254 (1989) |
| 1988 |
|---|
| 4 | | Nicola Santoro,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment, Common Roots of Polynomials and Partial Orders.
STACS 1988: 292-300 |
| 1987 |
|---|
| 3 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney:
On the Expected Complexity of Distributed Selection.
STACS 1987: 456-467 |
| 2 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment and Vector Dominance.
Theor. Comput. Sci. 53: 345-352 (1987) |
| 1985 |
|---|
| 1 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment is not Reducible to Pareto Dominance.
STACS 1985: 322-327 |
