Stuart J. Sidney

According to our database, Stuart J. Sidney authored at least 9 papers between 1985 and 1992.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1992

A Distributed Selection Algorithm and its Expected Communication Complexity.

Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney

Theor. Comput. Sci., 1992

1991

Average properties of two-dimensional partial orders.

Jeffrey B. Sidney, Stuart J. Sidney, Art Warburton

Networks, 1991

1989

A Distributed Batching System for Parallel Processing.

Robert D. Silverman, Stuart J. Sidney

Softw. Pract. Exp., 1989

Geometric Containment and Partial Orders.

Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia

SIAM J. Discret. Math., 1989

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

1988

Geometric Containment, Common Roots of Polynomials and Partial Orders.

Nicola Santoro, Stuart J. Sidney, Jorge Urrutia

Proceedings of the STACS 88, 1988

1987

Geometric Containment and Vector Dominance.

Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia

Theor. Comput. Sci., 1987

On the Expected Complexity of Distributed Selection.

Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney

Proceedings of the STACS 87, 1987

1985

Geometric Containment is not Reducible to Pareto Dominance.

Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia

Proceedings of the STACS 85, 1985