Select a publication 
Show 
Title 
Venue 
Rating 
Date 

Conference paper
Imre Bárány, William L. Steiger.
On the variance of random polygons.

Comput. Geom. 2013, Volume 46 
(0)

2013 

Conference paper
William L. Steiger, Imre Bárány.
On the variance of random polygons.

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 911, 2010 2010 
(0)

2010 

Conference paper
József Balogh, Oded Regev 0001, Clifford D. Smyth, William L. Steiger, Mario Szegedy.
Long Monotone Paths in Line Arrangements.

Discrete Computational Geometry 2004, Volume 32 
(0)

2004 

Conference paper
József Balogh, Oded Regev 0001, Clifford D. Smyth, William L. Steiger, Mario Szegedy.
Long monotone paths in line arrangements.

Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 810, 2003 2003 
(0)

2003 

Conference paper
Stefan Langerman, William L. Steiger.
Optimization in Arrangements.

STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27  March 1, 2003, Proceedings 2003 
(0)

2003 

Conference paper
Stefan Langerman, William L. Steiger.
The Complexity of Hyperplane Depth in the Plane.

Discrete Computational Geometry 2003, Volume 30 
(0)

2003 

Conference paper
Mordecai J. Golin, Stefan Langerman, William L. Steiger.
The Convex Hull for Random Lines in the Plane.

Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 69, 2002, Revised Papers 2003 
(0)

2002 

Conference paper
Adrian Dumitrescu, William L. Steiger.
Spacetime tradeoffs for some ranking and searching queries.

Inf. Process. Lett. 2001, Volume 79 
(0)

2001 

Conference paper
Stefan Langerman, William L. Steiger.
An optimal algorithm for hyperplane depth in the plane.

SODA 2000 
(0)

2000 

Conference paper
Imre Bárány, Günter Rote, William L. Steiger, C.H. Zhang.
A Central Limit Theorem for Convex Chains in the Square.

Discrete Computational Geometry 2000, Volume 23 
(0)

2000 

Conference paper
Adrian Dumitrescu, William L. Steiger.
On a matching problem in the plane.

Discrete Mathematics 2000, Volume 211 
(0)

2000 

Conference paper
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger.
Properties of Random Triangulations and Trees.

Discrete Computational Geometry 1999, Volume 22 
(0)

1999 

Conference paper
William L. Steiger, Rephael Wenger.
Hyperplane depth and nested simplices.

CCCG 1998 
(0)

1998 

Conference paper
William L. Steiger, Ileana Streinu.
Illumination by floodlights.

Comput. Geom. 1998, Volume 10 
(0)

1998 

Conference paper
Hank Chien, William L. Steiger.
Some Geometric Lower Bounds.

Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 46, 1995, Proceedings 1995 
(0)

1995 

Conference paper
William L. Steiger, Ileana Streinu.
A PseudoAlgorithmic Separation of Lines from PseudoLines.

Inf. Process. Lett. 1995, Volume 53 
(0)

1995 

Conference paper
William L. Steiger, Ileana Streinu.
A PseudoAlgorithmic Separation of Lines from PseudoLines.

CCCG 1994 
(0)

1994 

Conference paper
William L. Steiger, Ileana Streinu.
Positive and Negative Results on the Floodlight Problem.

CCCG 1994 
(0)

1994 

Conference paper
Imre Bárány, William L. Steiger.
On the Expected Number of kSets.

Discrete Computational Geometry 1994, Volume 11 
(0)

1994 

Conference paper
ChiYuan Lo, Jirí Matousek, William L. Steiger.
Algorithms for HamSandwich Cuts.

Discrete Computational Geometry 1994, Volume 11 
(0)

1994 

Conference paper
Larry Shafer, William L. Steiger.
Randomizing Optimal Geometric Algorithms.

CCCG 1993 
(0)

1993 

Conference paper
William L. Steiger.
Algorithms for Ham Sandwich Cuts.

CCCG 1993 
(0)

1993 

Conference paper
ChiYuan Lo, Jirí Matousek, William L. Steiger.
HamSandwich Cuts in R^d

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 46, 1992, Victoria, British Columbia, Canada 1992 
(0)

1992 

Conference paper
János Pach, William L. Steiger, Endre Szemerédi.
An Upper Bound on the Number of Planar KSets.

Discrete Computational Geometry 1992, Volume 7 
(0)

1992 

Conference paper
Joseph Gil, William L. Steiger, Avi Wigderson.
Geometric medians.

Discrete Mathematics 1992, Volume 108 
(0)

1992 

Journal article
Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi.
Almost Sorting in one Round.

Advances in Computing Research 1989, Volume 5 
(0)

1989 

Conference paper
János Pach, William L. Steiger, Endre Szemerédi.
An Upper Bound on the Number of Planar kSets

30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October  1 November 1989 1989 
(0)

1989 

Conference paper
Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi.
Optimal Parallel Selection has Complexity O(Log Log n).

J. Comput. Syst. Sci. 1989, Volume 38 
(0)

1989 

Conference paper
Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi.
An OptimalTime Algorithm for Slope Selection.

SIAM J. Comput. 1989, Volume 18 
(0)

1989 

Conference paper
Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi.
Optimal Slope Selection.

Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 1115, 1988, Proceedings 1988 
(0)

1988 

Conference paper
Janos Pintz, William L. Steiger, Endre Szemerédi.
Two Infinite Sets of Primes with Fast Primality Tests

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 24, 1988, Chicago, Illinois, USA 1988 
(0)

1988 

Conference paper
Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson.
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)).

SIAM J. Discrete Math. 1988, Volume 1 
(0)

1988 

Conference paper
Jeffrey S. Salowe, William L. Steiger.
Stable Unmerging in Linear Time and Constant Space.

Inf. Process. Lett. 1987, Volume 25 
(0)

1987 

Conference paper
Jeffrey S. Salowe, William L. Steiger.
Simplified Stable Merging Tasks.

J. Algorithms 1987, Volume 8 
(0)

1987 

Journal article
J. Michael Steele, William L. Steiger.
Algorithms and complexity for least median of squares regression.

Discrete Applied Mathematics 1986, Volume 14 
(0)

1986 

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

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, May 2830, 1986, Berkeley, California, USA 1986 
(0)

1986 

Conference paper
Larry Rudolph, William L. Steiger.
Subset Selection in Parallel.

ICPP 1985 
(0)

1985 

Conference paper
Eugene Seneta, William L. Steiger.
A new lad curvefitting algorithm: Slightly overdetermined equation systems in L

Discrete Applied Mathematics 1984, Volume 7 
(0)

1984 

Journal article
Gerard R. Richter, William L. Steiger.
Polynomial least squares approximations with Illconditioned bases.

Computing 1978, Volume 19 
(0)

1977 