![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Daniel Shawcross Wilkerson Saul Schleimer , Daniel Shawcross Wilkerson, Alexander Aiken : Winnowing: Local Algorithms for Document Fingerprinting. SIGMOD Conference 2003 : 76-85 Brent N. Chun , Alan M. Mainwaring , Saul Schleimer , Daniel Shawcross Wilkerson: System Area Network Mapping. SPAA 1997 : 116-126 Rafail Ostrovsky , Daniel Shawcross Wilkerson: Faster Computation On Directed Networks of Automata (Extended Abstract). PODC 1995 : 38-46 Abhiram G. Ranade , Saul Schleimer , Daniel Shawcross Wilkerson: Nearly Tight Bounds for Wormhole Routing FOCS 1994 : 347-355 1 [ 4 ] 2 [ 3 ] 3 [ 3 ] 4 [ 2 ] 5 [ 1 ] 6 [ 1 ] [ 3 ] [ 4 ] ![]() ©2004 Association for Computing Machinery |