The SCEAS System
Navigation Menu

Search the dblp DataBase


Daniel Shawcross Wilkerson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson
    Nearly Tight Bounds for Wormhole Routing [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:347-355 [Conf]
  2. Rafail Ostrovsky, Daniel Shawcross Wilkerson
    Faster Computation On Directed Networks of Automata (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:38-46 [Conf]
  3. Saul Schleimer, Daniel Shawcross Wilkerson, Alexander Aiken
    Winnowing: Local Algorithms for Document Fingerprinting. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2003, pp:76-85 [Conf]
  4. Brent N. Chun, Alan M. Mainwaring, Saul Schleimer, Daniel Shawcross Wilkerson
    System Area Network Mapping. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:116-126 [Conf]
  5. Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilkerson
    Measuring empirical computational complexity. [Citation Graph (0, 0)][DBLP]
    ESEC/SIGSOFT FSE, 2007, pp:395-404 [Conf]

  6. A Proposal for Proquints: Identifiers that are Readable, Spellable, and Pronounceable [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs
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