default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam L. Steiger
Person information
- affiliation: Rutgers University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j22]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
2000 – 2009
- 2004
- [j21]József Balogh, Oded Regev, Clifford D. Smyth
, William L. Steiger, Mario Szegedy:
Long Monotone Paths in Line Arrangements. Discret. Comput. Geom. 32(2): 167-176 (2004) - 2003
- [j20]Stefan Langerman, William L. Steiger:
The Complexity of Hyperplane Depth in the Plane. Discret. Comput. Geom. 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. SCG 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
- [j19]Adrian Dumitrescu, William L. Steiger:
Space-time trade-offs for some ranking and searching queries. Inf. Process. Lett. 79(5): 237-241 (2001) - 2000
- [j18]Imre Bárány, Günter Rote, William L. Steiger, Cun-Hui Zhang:
A Central Limit Theorem for Convex Chains in the Square. Discret. Comput. Geom. 23(1): 35-50 (2000) - [j17]Adrian Dumitrescu, William L. Steiger:
On a matching problem in the plane. Discret. Math. 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
- [j16]Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger:
Properties of Random Triangulations and Trees. Discret. Comput. Geom. 22(1): 105-117 (1999) - 1998
- [j15]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
- [j14]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
- [j13]Imre Bárány, William L. Steiger:
On the Expected Number of k-Sets. Discret. Comput. Geom. 11: 243-263 (1994) - [j12]Chi-Yuan Lo, Jirí Matousek, William L. Steiger:
Algorithms for Ham-Sandwich Cuts. Discret. Comput. Geom. 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
- [j11]János Pach, William L. Steiger, Endre Szemerédi:
An Upper Bound on the Number of Planar K-Sets. Discret. Comput. Geom. 7: 109-123 (1992) - [j10]Joseph Gil, William L. Steiger, Avi Wigderson:
Geometric medians. Discret. Math. 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
1980 – 1989
- 1989
- [j9]Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi:
Almost Sorting in one Round. Adv. Comput. Res. 5: 117-125 (1989) - [j8]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) - [j7]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
- [j6]Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson:
The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). SIAM J. Discret. 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
- [j5]Jeffrey S. Salowe, William L. Steiger:
Stable Unmerging in Linear Time and Constant Space. Inf. Process. Lett. 25(5): 285-294 (1987) - [j4]Jeffrey S. Salowe, William L. Steiger:
Simplified Stable Merging Tasks. J. Algorithms 8(4): 557-571 (1987) - 1986
- [j3]J. Michael Steele, William L. Steiger:
Algorithms and complexity for least median of squares regression. Discret. Appl. Math. 14(1): 93-100 (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 - 1984
- [j2]Eugene Seneta, William L. Steiger:
A new lad curve-fitting algorithm: Slightly overdetermined equation systems in L1. Discret. Appl. Math. 7(1): 79-91 (1984)
1970 – 1979
- 1977
- [j1]Gerard R. Richter, William L. Steiger:
Polynomial least squares approximations with Ill-conditioned bases. Computing 19(1): 85-88 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
