The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Kenneth L. Clarkson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kenneth L. Clarkson
    Fast Algorithms for the All Nearest Neighbors Problem [Citation Graph (1, 0)][DBLP]
    FOCS, 1983, pp:226-232 [Conf]
  2. Kenneth L. Clarkson
    A Las Vegas Algorithm for Linear Programming When the Dimension Is Small [Citation Graph (1, 0)][DBLP]
    FOCS, 1988, pp:452-456 [Conf]
  3. Kenneth L. Clarkson
    Applications of Random Sampling in Computational Geometry, II. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:1-11 [Conf]
  4. Kenneth L. Clarkson
    An Algorithm for Approximate Closest-Point Queries. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:160-164 [Conf]
  5. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
    Randomized Parallel Algorithms for Trapezoidal Diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:152-161 [Conf]
  6. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
    Approximating Center Points with Iterated Radon Points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:91-98 [Conf]
  7. Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya
    Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:251-257 [Conf]
  8. Kenneth L. Clarkson, Peter W. Shor
    Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:12-17 [Conf]
  9. Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
    A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:18-22 [Conf]
  10. Kenneth L. Clarkson, Kasturi R. Varadarajan
    Improved approximation algorithms for geometric set cover. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:135-141 [Conf]
  11. Kenneth L. Clarkson
    Safe and Effective Determinant Evaluation [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:387-395 [Conf]
  12. Kenneth L. Clarkson
    More Output-Sensitive Geometric Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:695-702 [Conf]
  13. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:568-579 [Conf]
  14. Mihai Badoiu, Kenneth L. Clarkson
    Smaller core-sets for balls. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:801-802 [Conf]
  15. Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
    Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:179-187 [Conf]
  16. Kenneth L. Clarkson
    Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:17-23 [Conf]
  17. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
    Four Results on Randomized Incremental Constructions. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:463-474 [Conf]
  18. Kenneth L. Clarkson
    Building triangulations using epsilon-nets. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:326-335 [Conf]
  19. Kenneth L. Clarkson
    Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:342-348 [Conf]
  20. Kenneth L. Clarkson
    A Probabilistic Algorithm for the Post Office Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:175-184 [Conf]
  21. Kenneth L. Clarkson
    Further Applications of Random Sampling to Computational Geometry [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:414-423 [Conf]
  22. Kenneth L. Clarkson
    Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:56-65 [Conf]
  23. Kenneth L. Clarkson
    Nearest Neighbor Queries in Metric Spaces. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:609-617 [Conf]
  24. Kenneth L. Clarkson
    Algorithms for Polytope Covering and Approximation. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:246-252 [Conf]
  25. Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine
    Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:2, pp:168-183 [Journal]
  26. Kenneth L. Clarkson
    An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:461-469 [Journal]
  27. Simon C. Borst, Kenneth L. Clarkson, John M. Graybeal, Harish Viswanathan, Philip A. Whiting
    User-level QoS and traffic engineering for 3G wireless 1xEV-DO systems. [Citation Graph (0, 0)][DBLP]
    Bell Labs Technical Journal, 2003, v:8, n:2, pp:33-47 [Journal]
  28. Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel
    Four Results on Randomized Incremental Constructions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:185-212 [Journal]
  29. Kenneth L. Clarkson
    New Applications of random Sampling in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:195-222 [Journal]
  30. Kenneth L. Clarkson
    A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:10, n:, pp:427-433 [Journal]
  31. Kenneth L. Clarkson
    Nearest Neighbor Queries in Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:1, pp:63-93 [Journal]
  32. Kenneth L. Clarkson
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:4, pp:479-480 [Journal]
  33. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:99-160 [Journal]
  34. Kenneth L. Clarkson, Peter W. Shor
    Application of Random Sampling in Computational Geometry, II. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:387-421 [Journal]
  35. Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk
    A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:423-432 [Journal]
  36. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
    Randomized parallel algorithms for trapezoidal diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:2, pp:117-133 [Journal]
  37. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
    Erratum: Randomized parallel algorithms for trapezoidal diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:341-343 [Journal]
  38. Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng
    Approximating center points with iterative Radon points. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:357-377 [Journal]
  39. Kenneth L. Clarkson
    A Modification of the Greedy Algorithm for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:23-25 [Journal]
  40. Kenneth L. Clarkson
    Linear Programming in O(n * (3_d)_2) Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:1, pp:21-24 [Journal]
  41. Kenneth L. Clarkson
    Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:2, pp:488-499 [Journal]
  42. Kenneth L. Clarkson
    SODA '95 Papers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:203- [Journal]
  43. Kenneth L. Clarkson
    A Randomized Algorithm for Closest-Point Queries. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:830-847 [Journal]
  44. Leonidas J. Guibas, Jorge Stolfi, Kenneth L. Clarkson
    Solving Related Two-and Three-Dimensional Linear Programming Problems in Logarithmic Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:49, n:, pp:81-84 [Journal]
  45. Kenneth L. Clarkson, Kasturi Varadarajan
    Improved Approximation Algorithms for Geometric Set Cover [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  46. Kenneth L. Clarkson, Kasturi Varadarajan
    Improved Approximation Algorithms for Geometric Set Cover. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:1, pp:43-58 [Journal]

  47. Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures. [Citation Graph (, )][DBLP]


  48. Tighter bounds for random projections of manifolds. [Citation Graph (, )][DBLP]


  49. Self-improving algorithms for delaunay triangulations. [Citation Graph (, )][DBLP]


  50. On the set multi-cover problem in geometric settings. [Citation Graph (, )][DBLP]


  51. Schema covering: a step towards enabling reuse in information integration. [Citation Graph (, )][DBLP]


  52. Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. [Citation Graph (, )][DBLP]


  53. Self-improving Algorithms for Convex Hulls. [Citation Graph (, )][DBLP]


  54. Numerical linear algebra in the streaming model. [Citation Graph (, )][DBLP]


  55. Modeling UpLink Power Control with Outage Probabilities. [Citation Graph (, )][DBLP]


  56. Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits. [Citation Graph (, )][DBLP]


  57. Optimal core-sets for balls. [Citation Graph (, )][DBLP]


  58. Self-Improving Algorithms [Citation Graph (, )][DBLP]


  59. On the Set Multi-Cover Problem in Geometric Settings [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.307secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002