 | 2009 |
|---|
| 6 |       | Daniel Shawcross Wilkerson:
A Proposal for Proquints: Identifiers that are Readable, Spellable, and Pronounceable
CoRR abs/0901.4016: (2009) |
| 2007 |
|---|
| 5 | | Simon Goldsmith,
Alex Aiken,
Daniel Shawcross Wilkerson:
Measuring empirical computational complexity.
ESEC/SIGSOFT FSE 2007: 395-404 |
| 2003 |
|---|
| 4 | | Saul Schleimer,
Daniel Shawcross Wilkerson,
Alexander Aiken:
Winnowing: Local Algorithms for Document Fingerprinting.
SIGMOD Conference 2003: 76-85 |
| 1997 |
|---|
| 3 | | Brent N. Chun,
Alan M. Mainwaring,
Saul Schleimer,
Daniel Shawcross Wilkerson:
System Area Network Mapping.
SPAA 1997: 116-126 |
| 1995 |
|---|
| 2 |  | Rafail Ostrovsky,
Daniel Shawcross Wilkerson:
Faster Computation On Directed Networks of Automata (Extended Abstract).
PODC 1995: 38-46 |
| 1994 |
|---|
| 1 | | Abhiram G. Ranade,
Saul Schleimer,
Daniel Shawcross Wilkerson:
Nearly Tight Bounds for Wormhole Routing
FOCS 1994: 347-355 |
