William L. Steiger

According to our database, William L. Steiger authored at least 35 papers between 1977 and 2013.

Collaborative distances:

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

2013

On the variance of random polygons.

Imre Bárány, William L. Steiger

Comput. Geom., 2013

2004

Long Monotone Paths in Line Arrangements.

József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy

Discret. Comput. Geom., 2004

2003

The Complexity of Hyperplane Depth in the Plane.

Stefan Langerman, William L. Steiger

Discret. Comput. Geom., 2003

Optimization in Arrangements.

Stefan Langerman, William L. Steiger

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

The Convex Hull for Random Lines in the Plane.

Mordecai J. Golin, Stefan Langerman, William L. Steiger

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001

Space-time trade-offs for some ranking and searching queries.

Adrian Dumitrescu, William L. Steiger

Inf. Process. Lett., 2001

2000

On a matching problem in the plane.

Adrian Dumitrescu, William L. Steiger

Discret. Math., 2000

A Central Limit Theorem for Convex Chains in the Square.

Imre Bárány, Günter Rote, William L. Steiger, Cun-Hui Zhang

Discret. Comput. Geom., 2000

An optimal algorithm for hyperplane depth in the plane.

Stefan Langerman, William L. Steiger

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Properties of Random Triangulations and Trees.

Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger

Discret. Comput. Geom., 1999

1998

Illumination by floodlights.

William L. Steiger, Ileana Streinu

Comput. Geom., 1998

Hyperplane depth and nested simplices.

William L. Steiger, Rephael Wenger

Proceedings of the 10th Canadian Conference on Computational Geometry, 1998

1995

A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines.

William L. Steiger, Ileana Streinu

Inf. Process. Lett., 1995

Some Geometric Lower Bounds.

Hank Chien, William L. Steiger

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

1994

Algorithms for Ham-Sandwich Cuts.

Chi-Yuan Lo, Jirí Matousek, William L. Steiger

Discret. Comput. Geom., 1994

On the Expected Number of k-Sets.

Imre Bárány, William L. Steiger

Discret. Comput. Geom., 1994

Positive and Negative Results on the Floodlight Problem.

William L. Steiger, Ileana Streinu

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Algorithms for Ham Sandwich Cuts.

William L. Steiger

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Randomizing Optimal Geometric Algorithms.

Larry Shafer, William L. Steiger

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Geometric medians.

Joseph Gil, William L. Steiger, Avi Wigderson

Discret. Math., 1992

An Upper Bound on the Number of Planar K-Sets.

János Pach, William L. Steiger, Endre Szemerédi

Discret. Comput. Geom., 1992

Ham-Sandwich Cuts in R^d

Chi-Yuan Lo, Jirí Matousek, William L. Steiger

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1989

An Optimal-Time Algorithm for Slope Selection.

Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi

SIAM J. Comput., 1989

Optimal Parallel Selection has Complexity O(Log Log n).

Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi

J. Comput. Syst. Sci., 1989

Almost Sorting in one Round.

Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi

Adv. Comput. Res., 1989

1988

The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).

Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson

SIAM J. Discret. Math., 1988

Two Infinite Sets of Primes with Fast Primality Tests

Janos Pintz, William L. Steiger, Endre Szemerédi

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Optimal Slope Selection.

Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987

Simplified Stable Merging Tasks.

Jeffrey S. Salowe, William L. Steiger

J. Algorithms, 1987

Stable Unmerging in Linear Time and Constant Space.

Jeffrey S. Salowe, William L. Steiger

Inf. Process. Lett., 1987

1986

Algorithms and complexity for least median of squares regression.

J. Michael Steele, William L. Steiger

Discret. Appl. Math., 1986

Deterministic Selection in O(log log N) Parallel Time

Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

Subset Selection in Parallel.

Larry Rudolph, William L. Steiger

Proceedings of the International Conference on Parallel Processing, 1985

1984

A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L₁.

Eugene Seneta, William L. Steiger

Discret. Appl. Math., 1984

1977

Polynomial least squares approximations with Ill-conditioned bases.

Gerard R. Richter, William L. Steiger

Computing, 1977