The SCEAS System
Navigation Menu

Search the dblp DataBase


Robert L. Scot Drysdale: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Robert L. Scot Drysdale, Clifford Stein, David P. Wagner
    An O(n5/2log n) Algorithm for the Rectilinear Minimum Link-Distance Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:97-100 [Conf]
  2. Gill Barequet, Robert L. Scot Drysdale, Matthew Dickerson, David S. Guertin
    2-point site Voronoi diagrams. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:323-324 [Conf]
  3. Robert L. Scot Drysdale, Judith Hromcik, David Reed, Reg Hahne
    The year in review: changes and lessons learned in the design and implementation of the AP CS exam in Java. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2005, pp:323-324 [Conf]
  4. Robert L. Scot Drysdale, Judith Hromcik, Mark Allen Weiss, Reg Hahne
    Java in the morning...Java in the evening...Java in 2004. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2003, pp:271-272 [Conf]
  5. Robert L. Scot Drysdale
    Phenotypic Data in FlyBase. [Citation Graph (0, 0)][DBLP]
    Briefings in Bioinformatics, 2001, v:2, n:1, pp:68-80 [Journal]
  6. Kim B. Bruce, Robert L. Scot Drysdale, Charles Kelemen, Allen B. Tucker
    Why math? [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2003, v:46, n:9, pp:40-44 [Journal]
  7. Shawn P. Austin, Robert B. Jerard, Robert L. Scot Drysdale
    Comparison of discretization algorithms for surfaces with application to numerically controlled machining. [Citation Graph (0, 0)][DBLP]
    Computer-Aided Design, 1997, v:29, n:1, pp:71-83 [Journal]
  8. Robert L. Scot Drysdale
    What Should We Teach? [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:96- [Journal]
  9. Asish Mukhopadhyay, Robert L. Scot Drysdale
    An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]

  10. Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs. [Citation Graph (, )][DBLP]

  11. An O(n5/2logn) algorithm for the Rectilinear Minimum Link-Distance Problem in three dimensions. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002