William L. Steiger

2004
33	EE	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
32	EE	Stefan Langerman, William L. Steiger: Optimization in Arrangements. STACS 2003: 50-61
31	EE	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
30	EE	Stefan Langerman, William L. Steiger: The Complexity of Hyperplane Depth in the Plane. Discrete & Computational Geometry 30(2): 299-309 (2003)
2002
29	EE	Mordecai J. Golin, Stefan Langerman, William L. Steiger: The Convex Hull for Random Lines in the Plane. JCDCG 2002: 172-175
2001
28	EE	Adrian Dumitrescu, William L. Steiger: Space-time trade-offs for some ranking and searching queries. Inf. Process. Lett. 79(5): 237-241 (2001)
2000
27	EE	Stefan Langerman, William L. Steiger: An optimal algorithm for hyperplane depth in the plane. SODA 2000: 54-59
26	EE	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)
25	EE	Adrian Dumitrescu, William L. Steiger: On a matching problem in the plane. Discrete Mathematics 211: 183-195 (2000)
1999
24	EE	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
23	EE	William L. Steiger, Rephael Wenger: Hyperplane depth and nested simplices. CCCG 1998
22		William L. Steiger, Ileana Streinu: Illumination by floodlights. Comput. Geom. 10(1): 57-70 (1998)
1995
21		Hank Chien, William L. Steiger: Some Geometric Lower Bounds. ISAAC 1995: 72-81
20	EE	William L. Steiger, Ileana Streinu: A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. Inf. Process. Lett. 53(5): 295-299 (1995)
1994
19		William L. Steiger, Ileana Streinu: A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. CCCG 1994: 7-11
18		William L. Steiger, Ileana Streinu: Positive and Negative Results on the Floodlight Problem. CCCG 1994: 87-92
17		Imre Bárány, William L. Steiger: On the Expected Number of k-Sets. Discrete & Computational Geometry 11: 243-263 (1994)
16		Chi-Yuan Lo, Jirí Matousek, William L. Steiger: Algorithms for Ham-Sandwich Cuts. Discrete & Computational Geometry 11: 433-452 (1994)
1993
15		Larry Shafer, William L. Steiger: Randomizing Optimal Geometric Algorithms. CCCG 1993: 133-138
14		William L. Steiger: Algorithms for Ham Sandwich Cuts. CCCG 1993: 48-48
1992
13		Chi-Yuan Lo, Jirí Matousek, William L. Steiger: Ham-Sandwich Cuts in R^d STOC 1992: 539-545
12		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)
11	EE	Joseph Gil, William L. Steiger, Avi Wigderson: Geometric medians. Discrete Mathematics 108(1-3): 37-51 (1992)
1989
10		János Pach, William L. Steiger, Endre Szemerédi: An Upper Bound on the Number of Planar k-Sets FOCS 1989: 72-79
9		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)
8		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)
1988
7		Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi: Optimal Slope Selection. ICALP 1988: 133-146
6		Janos Pintz, William L. Steiger, Endre Szemerédi: Two Infinite Sets of Primes with Fast Primality Tests STOC 1988: 504-509
5		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)
1987
4		Jeffrey S. Salowe, William L. Steiger: Stable Unmerging in Linear Time and Constant Space. Inf. Process. Lett. 25(5): 285-294 (1987)
3		Jeffrey S. Salowe, William L. Steiger: Simplified Stable Merging Tasks. J. Algorithms 8(4): 557-571 (1987)
1986
2		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
1		Larry Rudolph, William L. Steiger: Subset Selection in Parallel. ICPP 1985: 11-13

Coauthor Index

1	Miklós Ajtai	[2] [9]
2	József Balogh	[31] [33]
3	Imre Bárány	[17] [26]
4	Hank Chien	[21]
5	Richard Cole	[7] [8]
6	Luc Devroye	[24]
7	Adrian Dumitrescu	[25] [28]
8	Philippe Flajolet	[24]
9	Joseph Gil (Yossi Gil)	[11]
10	Mordecai J. Golin	[29]
11	Ferran Hurtado	[24]
12	János Komlós	[2] [9]
13	Stefan Langerman	[27] [29] [30] [32]
14	Chi-Yuan Lo	[13] [16]
15	Jirí Matousek	[13] [16]
16	Marc Noy	[24]
17	János Pach	[10] [12]
18	Janos Pintz	[6]
19	Prabhakar Ragde	[5]
20	Oded Regev	[31] [33]
21	Günter Rote	[26]
22	Larry Rudolph	[1]
23	Jeffrey S. Salowe	[3] [4] [7] [8]
24	Larry Shafer	[15]
25	Clifford D. Smyth	[31] [33]
26	Ileana Streinu	[18] [19] [20] [22]
27	Mario Szegedy	[31] [33]
28	Endre Szemerédi	[2] [5] [6] [7] [8] [9] [10] [12]
29	Rephael Wenger	[23]
30	Avi Wigderson	[5] [11]
31	C.-H. Zhang	[26]

Colors in the list of coauthors