William L. Steiger

发表

Properties of Random Triangulations and Trees

Philippe Flajolet, Marc Noy, Luc Devroye, 1999, Discret. Comput. Geom..

A Central Limit Theorem for Convex Chains in the Square

Günter Rote, Imre Bárány, William L. Steiger, 2000, Discret. Comput. Geom..

Optimal Slope Selection

Endre Szemerédi, Richard Cole, Jeffrey S. Salowe, 1988, ICALP.

Deterministic selection in O(loglog N) parallel time

János Komlós, Endre Szemerédi, Miklós Ajtai, 1986, STOC '86.

Optimization in Arrangements

Stefan Langerman, William L. Steiger, W. Steiger, 2003, STACS.

Geometric medians

Avi Wigderson, Joseph Gil, William L. Steiger, 1992, Discret. Math..

Long monotone paths in line arrangements

József Balogh, Mario Szegedy, Oded Regev, 2003, SCG '03.

Algorithms for ham-sandwich cuts

William L. Steiger, W. Steiger, 1994, CCCG.

Randomizing Optimal Geometric Algorithms

William L. Steiger, Larry Shafer, 1993, CCCG.

An optimal algorithm for hyperplane depth in the plane

Stefan Langerman, William L. Steiger, 2000, SODA '00.

Stable Unmerging in Linear Time and Constant Space

Jeffrey S. Salowe, William L. Steiger, 1987, Inf. Process. Lett..

Polynomial least squares approximations with Ill-conditioned bases

William L. Steiger, Gerard R. Richter, 2005, Computing.

Algorithms for LAD

William L. Steiger, Peter Bloomfield, W. Steiger, 1983 .

Long Monotone Paths in Line Arrangements

József Balogh, Mario Szegedy, Oded Regev, 2004, Discret. Comput. Geom..

Hyperplane depth and nested simplices

Rephael Wenger, William L. Steiger, W. Steiger, 1998, CCCG.

Two infinite sets of primes with fast primality tests

Endre Szemerédi, William L. Steiger, Janos Pintz, 1988, STOC '88.

Positive and Negative Results on the Floodlight Problem

Ileana Streinu, William L. Steiger, 1994, CCCG.

Optimal Parallel Selection has Complexity O(Log Log n)

János Komlós, Endre Szemerédi, Miklós Ajtai, 1989, J. Comput. Syst. Sci..

Simplified Stable Merging Tasks

Jeffrey S. Salowe, William L. Steiger, W. Steiger, 1987, J. Algorithms.

Illumination by floodlights

Ileana Streinu, William L. Steiger, W. Steiger, 1998, Comput. Geom..

The Convex Hull for Random Lines in the Plane

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

A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L1

Eugene Seneta, William L. Steiger, 1984, Discret. Appl. Math..

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

Endre Szemerédi, Avi Wigderson, Prabhakar Ragde, 1988, SIAM J. Discret. Math..

The Complexity of Hyperplane Depth in the Plane

Stefan Langerman, William L. Steiger, 2003, Discret. Comput. Geom..

On the expected number of k-sets

Imre Bárány, William L. Steiger, 1994, Discret. Comput. Geom..

Ham-sandwich cuts in Rd

Jirí Matousek, Chi-Yuan Lo, William L. Steiger, 1992, STOC '92.

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

Adrian Dumitrescu, William L. Steiger, 2001, Inf. Process. Lett..

Almost Sorting in one Round

János Komlós, Endre Szemerédi, Miklós Ajtai, 1989, Adv. Comput. Res..

An Optimal-Time Algorithm for Slope Selection

Endre Szemerédi, Richard Cole, Jeffrey S. Salowe, 1989, SIAM J. Comput..

On a matching problem in the plane

Adrian Dumitrescu, William L. Steiger, W. Steiger, 2000, Discret. Math..

Subset Selection in Parallel

Larry Rudolph, William L. Steiger, 1985, ICPP.

An upper bound on the number of planarK-sets

Endre Szemerédi, János Pach, William L. Steiger, 1992, Discret. Comput. Geom..

A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines

Ileana Streinu, William L. Steiger, 1995, Inf. Process. Lett..

Some Geometric Lower Bounds

William L. Steiger, Hank Chien, 1995, ISAAC.

A Note On Unmerging

Jeffrey S. Salowe, William L. Steiger, Bruce Reed, 1985 .

On sets of natural numbers whose difference set contains no squares

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