![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Saul Schleimer 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 Abhiram G. Ranade , Saul Schleimer, Daniel Shawcross Wilkerson : Nearly Tight Bounds for Wormhole Routing FOCS 1994 : 347-355 1 [ 3 ] 2 [ 2 ] 3 [ 2 ] 4 [ 1 ] 5 [ 1 ] [ 2 ] [ 3 ] ![]() ©2004 Association for Computing Machinery |