The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

William L. Steiger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jeffrey S. Salowe, William L. Steiger
    Stable Unmerging in Linear Time and Constant Space. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:5, pp:285-294 [Journal]
  2. Larry Shafer, William L. Steiger
    Randomizing Optimal Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:133-138 [Conf]
  3. William L. Steiger
    Algorithms for Ham Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:48-48 [Conf]
  4. William L. Steiger, Ileana Streinu
    A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:7-11 [Conf]
  5. William L. Steiger, Ileana Streinu
    Positive and Negative Results on the Floodlight Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:87-92 [Conf]
  6. William L. Steiger, Rephael Wenger
    Hyperplane depth and nested simplices. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  7. József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
    Long monotone paths in line arrangements. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:124-128 [Conf]
  8. János Pach, William L. Steiger, Endre Szemerédi
    An Upper Bound on the Number of Planar k-Sets [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:72-79 [Conf]
  9. Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
    Optimal Slope Selection. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:133-146 [Conf]
  10. Larry Rudolph, William L. Steiger
    Subset Selection in Parallel. [Citation Graph (0, 0)][DBLP]
    ICPP, 1985, pp:11-13 [Conf]
  11. Hank Chien, William L. Steiger
    Some Geometric Lower Bounds. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:72-81 [Conf]
  12. Mordecai J. Golin, Stefan Langerman, William L. Steiger
    The Convex Hull for Random Lines in the Plane. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:172-175 [Conf]
  13. Stefan Langerman, William L. Steiger
    An optimal algorithm for hyperplane depth in the plane. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:54-59 [Conf]
  14. Stefan Langerman, William L. Steiger
    Optimization in Arrangements. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:50-61 [Conf]
  15. Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
    Deterministic Selection in O(log log N) Parallel Time [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:188-195 [Conf]
  16. Chi-Yuan Lo, Jirí Matousek, William L. Steiger
    Ham-Sandwich Cuts in R^d [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:539-545 [Conf]
  17. Janos Pintz, William L. Steiger, Endre Szemerédi
    Two Infinite Sets of Primes with Fast Primality Tests [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:504-509 [Conf]
  18. William L. Steiger, Ileana Streinu
    Illumination by floodlights. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:1, pp:57-70 [Journal]
  19. József Balogh, Oded Regev, Clifford D. Smyth, William L. Steiger, Mario Szegedy
    Long Monotone Paths in Line Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:2, pp:167-176 [Journal]
  20. Imre Bárány, Günter Rote, William L. Steiger, C.-H. Zhang
    A Central Limit Theorem for Convex Chains in the Square. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:1, pp:35-50 [Journal]
  21. Imre Bárány, William L. Steiger
    On the Expected Number of k-Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:243-263 [Journal]
  22. Luc Devroye, Philippe Flajolet, Ferran Hurtado, Marc Noy, William L. Steiger
    Properties of Random Triangulations and Trees. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:1, pp:105-117 [Journal]
  23. Stefan Langerman, William L. Steiger
    The Complexity of Hyperplane Depth in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:2, pp:299-309 [Journal]
  24. Chi-Yuan Lo, Jirí Matousek, William L. Steiger
    Algorithms for Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:433-452 [Journal]
  25. János Pach, William L. Steiger, Endre Szemerédi
    An Upper Bound on the Number of Planar K-Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:109-123 [Journal]
  26. Adrian Dumitrescu, William L. Steiger
    On a matching problem in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:211, n:, pp:183-195 [Journal]
  27. Adrian Dumitrescu, William L. Steiger
    Space-time trade-offs for some ranking and searching queries. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:79, n:5, pp:237-241 [Journal]
  28. William L. Steiger, Ileana Streinu
    A Pseudo-Algorithmic Separation of Lines from Pseudo-Lines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:5, pp:295-299 [Journal]
  29. Jeffrey S. Salowe, William L. Steiger
    Simplified Stable Merging Tasks. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:4, pp:557-571 [Journal]
  30. Miklós Ajtai, János Komlós, William L. Steiger, Endre Szemerédi
    Optimal Parallel Selection has Complexity O(Log Log n). [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:125-133 [Journal]
  31. Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerédi
    An Optimal-Time Algorithm for Slope Selection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:792-810 [Journal]
  32. Prabhakar Ragde, William L. Steiger, Endre Szemerédi, Avi Wigderson
    The Parallel Complexity of Element Distinctness is Omega (sqrt(log n)). [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1988, v:1, n:3, pp:399-410 [Journal]
  33. Joseph Gil, William L. Steiger, Avi Wigderson
    Geometric medians. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:37-51 [Journal]

  34. On the variance of random polygons. [Citation Graph (, )][DBLP]


Search in 0.388secs, Finished in 0.391secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002