Polynomial least squares approximations with Ill-conditioned bases. - Gerard R. Richter; William L. Steiger (Computing, 1977)

A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L1. - Eugene Seneta; William L. Steiger (Discret. Appl. Math., 1984)

Subset Selection in Parallel. - Larry Rudolph; William L. Steiger (ICPP, 1985)

Deterministic Selection in O(log log N) Parallel Time - Miklós Ajtai; János Komlós; William L. Steiger; Endre Szemerédi (STOC, 1986)

Algorithms and complexity for least median of squares regression. - J. Michael Steele; William L. Steiger (Discret. Appl. Math., 1986)

Stable Unmerging in Linear Time and Constant Space. - Jeffrey S. Salowe; William L. Steiger (Inf. Process. Lett., 1987)

Simplified Stable Merging Tasks. - Jeffrey S. Salowe; William L. Steiger (J. Algorithms, 1987)

Optimal Slope Selection. - Richard Cole 001; Jeffrey S. Salowe; William L. Steiger; Endre Szemerédi (ICALP, 1988)

Two Infinite Sets of Primes with Fast Primality Tests - Janos Pintz; William L. Steiger; Endre Szemerédi (STOC, 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)

Almost Sorting in one Round. - Miklós Ajtai; János Komlós; William L. Steiger; Endre Szemerédi (Adv. Comput. Res., 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)

An Optimal-Time Algorithm for Slope Selection. - Richard Cole 001; Jeffrey S. Salowe; William L. Steiger; Endre Szemerédi (SIAM J. Comput., 1989)

Ham-Sandwich Cuts in R^d - Chi-Yuan Lo; Jirí Matousek 001; William L. Steiger (STOC, 1992)

An Upper Bound on the Number of Planar K-Sets. - János Pach; William L. Steiger; Endre Szemerédi (Discret. Comput. Geom., 1992)

Geometric medians. - Joseph Gil; William L. Steiger; Avi Wigderson (Discret. Math., 1992)

Randomizing Optimal Geometric Algorithms. - Larry Shafer; William L. Steiger (CCCG, 1993)

Algorithms for Ham Sandwich Cuts. - William L. Steiger (CCCG, 1993)

Positive and Negative Results on the Floodlight Problem. - William L. Steiger; Ileana Streinu (CCCG, 1994)

On the Expected Number of k-Sets. - Imre Bárány; William L. Steiger (Discret. Comput. Geom., 1994)

Algorithms for Ham-Sandwich Cuts. - Chi-Yuan Lo; Jirí Matousek 001; William L. Steiger (Discret. Comput. Geom., 1994)

Some Geometric Lower Bounds. - Hank Chien; William L. Steiger (ISAAC, 1995)

A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. - William L. Steiger; Ileana Streinu (Inf. Process. Lett., 1995)

Hyperplane depth and nested simplices. - William L. Steiger; Rephael Wenger (CCCG, 1998)

Illumination by floodlights. - William L. Steiger; Ileana Streinu (Comput. Geom., 1998)

Properties of Random Triangulations and Trees. - Luc Devroye; Philippe Flajolet; Ferran Hurtado; Marc Noy; William L. Steiger (Discret. Comput. Geom., 1999)

An optimal algorithm for hyperplane depth in the plane. - Stefan Langerman; William L. Steiger (SODA, 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)

On a matching problem in the plane. - Adrian Dumitrescu; William L. Steiger (Discret. Math., 2000)

Space-time trade-offs for some ranking and searching queries. - Adrian Dumitrescu; William L. Steiger (Inf. Process. Lett., 2001)

The Convex Hull for Random Lines in the Plane. - Mordecai J. Golin; Stefan Langerman; William L. Steiger (JCDCG, 2002)

Optimization in Arrangements. - Stefan Langerman; William L. Steiger (STACS, 2003)

The Complexity of Hyperplane Depth in the Plane. - Stefan Langerman; William L. Steiger (Discret. Comput. Geom., 2003)

Long Monotone Paths in Line Arrangements. - József Balogh; Oded Regev 001; Clifford D. Smyth; William L. Steiger; Mario Szegedy (Discret. Comput. Geom., 2004)

On the variance of random polygons. - Imre Bárány; William L. Steiger (Comput. Geom., 2013)