Nearly Tight Bounds for Wormhole Routing - Abhiram G. Ranade; Saul Schleimer; Daniel Shawcross Wilkerson (FOCS, 1994)

Faster Computation On Directed Networks of Automata (Extended Abstract). - Rafail Ostrovsky; Daniel Shawcross Wilkerson (PODC, 1995)

System Area Network Mapping. - Brent N. Chun; Alan M. Mainwaring; Saul Schleimer; Daniel Shawcross Wilkerson (SPAA, 1997)

Winnowing: Local Algorithms for Document Fingerprinting. - Saul Schleimer; Daniel Shawcross Wilkerson; Alex Aiken (SIGMOD Conference, 2003)

Measuring empirical computational complexity. - Simon Goldsmith; Alex Aiken; Daniel Shawcross Wilkerson (ESEC/SIGSOFT FSE, 2007)

A Proposal for Proquints: Identifiers that are Readable, Spellable, and Pronounceable - Daniel Shawcross Wilkerson (CoRR, 2009)

Distributed Transactions for Google App Engine: Optimistic Distributed Transactions built upon Local Multi-Version Concurrency Control - Daniel Shawcross Wilkerson; Simon Fredrick Vicente Goldsmith; Ryan Barrett; Erick Armbrust; Robert Johnson; Alfred Fuller (CoRR, 2011)

Harmony Explained: Progress Towards A Scientific Theory of Music - Daniel Shawcross Wilkerson (CoRR, 2012)