William L. Steiger

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2013
j18		Imre Bárány, William L. Steiger: On the variance of random polygons. Comput. Geom. 46(2): 173-180 (2013)
	2010
c17		William L. Steiger, Imre Bárány: On the variance of random polygons. CCCG 2010: 211-214
	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		Stefan Langerman, William L. Steiger: Optimization in Arrangements. STACS 2003: 50-61
	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
	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		William L. Steiger, Ileana Streinu: Illumination by floodlights. Comput. Geom. 10(1): 57-70 (1998)
c12		William L. Steiger, Rephael Wenger: Hyperplane depth and nested simplices. CCCG 1998
	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		Hank Chien, William L. Steiger: Some Geometric Lower Bounds. ISAAC 1995: 72-81
	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		William L. Steiger: Algorithms for Ham Sandwich Cuts. CCCG 1993: 48-48
c7		Larry Shafer, William L. Steiger: Randomizing Optimal Geometric Algorithms. CCCG 1993: 133-138
	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		Chi-Yuan Lo, Jirí Matousek, William L. Steiger: Ham-Sandwich Cuts in R^d. STOC 1992: 539-545
	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		Larry Rudolph, William L. Steiger: Subset Selection in Parallel. ICPP 1985: 11-13

Coauthor Index

1	Miklós Ajtai	[j5] [c2]
2	József Balogh	[j17] [c16]
3	Imre Bárány	[j18] [c17] [j14] [j9]
4	Hank Chien	[c11]
5	Richard Cole	[j4] [c4]
6	Luc Devroye	[j12]
7	Adrian Dumitrescu	[j15] [j13]
8	Philippe Flajolet	[j12]
9	Joseph Gil (Yossi Gil)	[j6]
10	Mordecai J. Golin	[c14]
11	Ferran Hurtado	[j12]
12	János Komlós	[j5] [c2]
13	Stefan Langerman	[j16] [c15] [c14] [c13]
14	Chi-Yuan Lo	[j8] [c6]
15	Jirí Matousek	[j8] [c6]
16	Marc Noy	[j12]
17	János Pach	[j7] [c5]
18	Janos Pintz	[c3]
19	Prabhakar Ragde	[j3]
20	Oded Regev	[j17] [c16]
21	Günter Rote	[j14]
22	Larry Rudolph	[c1]
23	Jeffrey S. Salowe	[j4] [c4] [j2] [j1]
24	Larry Shafer	[c7]
25	Clifford D. Smyth	[j17] [c16]
26	Ileana Streinu	[j11] [j10] [c10] [c9]
27	Mario Szegedy	[j17] [c16]
28	Endre Szemerédi	[j7] [j5] [j4] [c5] [j3] [c4] [c3] [c2]
29	Rephael Wenger	[c12]
30	Avi Wigderson	[j6] [j3]
31	C.-H. Zhang	[j14]

Last update Sun May 19 20:58:29 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page