|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 8 keywords
|
|
|
|
|
Results
Found 8 publication records. Showing 8 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Daniel Shawcross Wilkerson |
Harmony Explained: Progress Towards A Scientific Theory of Music  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Daniel Shawcross Wilkerson, Simon Fredrick Vicente Goldsmith, Ryan Barrett, Erick Armbrust, Robert Johnson, Alfred Fuller |
Distributed Transactions for Google App Engine: Optimistic Distributed Transactions built upon Local Multi-Version Concurrency Control  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Daniel Shawcross Wilkerson |
A Proposal for Proquints: Identifiers that are Readable, Spellable, and Pronounceable  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilkerson |
Measuring empirical computational complexity.  |
ESEC/SIGSOFT FSE  |
2007 |
DBLP DOI BibTeX RDF |
empirical computational complexity, trend-prof |
| 1 | Saul Schleimer, Daniel Shawcross Wilkerson, Alexander Aiken |
Winnowing: Local Algorithms for Document Fingerprinting.  |
SIGMOD Conference  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Brent N. Chun, Alan M. Mainwaring, Saul Schleimer, Daniel Shawcross Wilkerson |
System Area Network Mapping.  |
SPAA  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rafail Ostrovsky, Daniel Shawcross Wilkerson |
Faster Computation On Directed Networks of Automata (Extended Abstract).  |
PODC  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson |
Nearly Tight Bounds for Wormhole Routing  |
FOCS  |
1994 |
DBLP DOI BibTeX RDF |
nearly tight bounds, high probability, lower bound, trees, routing algorithm, wormhole routing, optimal algorithms, two-dimensional mesh, Butterfly networks, multidimensional meshes |
Displaying result #1 - #8 of 8 (100 per page; Change: )
|
|