Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
William L. Steiger
2010 – today
- 2013
[j18]Imre Bárány, William L. Steiger: On the variance of random polygons. Comput. Geom. 46(2): 173-180 (2013)- 2010
- [c17]
2000 – 2009
- 2004
- [j17]József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy: Long Monotone Paths in Line Arrangements. Discrete & Computational Geometry 32(2): 167-176 (2004)
- 2003
- [j16]Stefan Langerman, William L. Steiger: The Complexity of Hyperplane Depth in the Plane. Discrete & Computational Geometry 30(2): 299-309 (2003)
- [c16]József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy: Long monotone paths in line arrangements. Symposium on Computational Geometry 2003: 124-128
- [c15]
- 2002
- [c14]Mordecai J. Golin, Stefan Langerman, William L. Steiger: The Convex Hull for Random Lines in the Plane. JCDCG 2002: 172-175
- 2001
- [j15]Adrian Dumitrescu, William L. Steiger: Space-time trade-offs for some ranking and searching queries. Inf. Process. Lett. 79(5): 237-241 (2001)
- 2000
- [j14]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 23(1): 35-50 (2000)
- [j13]Adrian Dumitrescu, William L. Steiger: On a matching problem in the plane. Discrete Mathematics 211: 183-195 (2000)
- [c13]Stefan Langerman, William L. Steiger: An optimal algorithm for hyperplane depth in the plane. SODA 2000: 54-59
1990 – 1999
- 1999
- [j12]Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger: Properties of Random Triangulations and Trees. Discrete & Computational Geometry 22(1): 105-117 (1999)
- 1998
- [j11]
- [c12]
- 1995
- [j10]William L. Steiger, Ileana Streinu: A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. Inf. Process. Lett. 53(5): 295-299 (1995)
- [c11]
- 1994
- [j9]Imre Bárány, William L. Steiger: On the Expected Number of k-Sets. Discrete & Computational Geometry 11: 243-263 (1994)
- [j8]Chi-Yuan Lo, Jirí Matousek, William L. Steiger: Algorithms for Ham-Sandwich Cuts. Discrete & Computational Geometry 11: 433-452 (1994)
- [c10]William L. Steiger, Ileana Streinu: A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. CCCG 1994: 7-11
- [c9]William L. Steiger, Ileana Streinu: Positive and Negative Results on the Floodlight Problem. CCCG 1994: 87-92
- 1993
- [c8]
- [c7]
- 1992
- [j7]János Pach, William L. Steiger, Endre Szemerédi: An Upper Bound on the Number of Planar K-Sets. Discrete & Computational Geometry 7: 109-123 (1992)
- [j6]Joseph Gil, William L. Steiger, Avi Wigderson: Geometric medians. Discrete Mathematics 108(1-3): 37-51 (1992)
- [c6]
1980 – 1989
- 1989
- [j5]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. 38(1): 125-133 (1989)
- [j4]Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi: An Optimal-Time Algorithm for Slope Selection. SIAM J. Comput. 18(4): 792-810 (1989)
- [c5]János Pach, William L. Steiger, Endre Szemerédi: An Upper Bound on the Number of Planar k-Sets. FOCS 1989: 72-79
- 1988
- [j3]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. 1(3): 399-410 (1988)
- [c4]Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi: Optimal Slope Selection. ICALP 1988: 133-146
- [c3]Janos Pintz, William L. Steiger, Endre Szemerédi: Two Infinite Sets of Primes with Fast Primality Tests. STOC 1988: 504-509
- 1987
- [j2]Jeffrey S. Salowe, William L. Steiger: Stable Unmerging in Linear Time and Constant Space. Inf. Process. Lett. 25(5): 285-294 (1987)
- [j1]Jeffrey S. Salowe, William L. Steiger: Simplified Stable Merging Tasks. J. Algorithms 8(4): 557-571 (1987)
- 1986
- [c2]Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi: Deterministic Selection in O(log log N) Parallel Time. STOC 1986: 188-195
- 1985
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:02 CET by the dblp team