![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Kirsten Hildrum Kirsten Hildrum, Philip S. Yu : Focused Community Discovery. ICDM 2005 : 641-644 Kirsten Hildrum, John Kubiatowicz , Jeremy Stribling : Brief announcement: stretch between nearby peers. PODC 2004 : 367 Kirsten Hildrum, Sean Ma , Satish Rao : Brief announcement: randomized rumor spreading with fewer phone calls. PODC 2004 : 380 Kirsten Hildrum, John Kubiatowicz , Sean Ma , Satish Rao : A note on the nearest neighbor in growth-restricted metrics. SODA 2004 : 560-561 Kirsten Hildrum, Robert Krauthgamer , John Kubiatowicz : Object location in realistic networks. SPAA 2004 : 25-35 Kirsten Hildrum, John Kubiatowicz : Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks. DISC 2003 : 321-336 Chris Harrelson , Kirsten Hildrum, Satish Rao : A polynomial-time tree decomposition to minimize congestion. SPAA 2003 : 34-43 Ziv Bar-Yossef , Kirsten Hildrum, Felix Wu : Incentive-compatible online auctions for digital goods. SODA 2002 : 964-970 Kirsten Hildrum, John Kubiatowicz , Satish Rao , Ben Y. Zhao : Distributed object location in a dynamic network. SPAA 2002 : 41-52 Eric J. Anderson , Kirsten Hildrum, Anna R. Karlin , April Rasala , Michael E. Saks : On list update and work function algorithms. Theor. Comput. Sci. 287 (2): 393-418 (2002) Kirsten Hildrum: Security of Encrypted rlogin Connections Created With Kerberos IV. NDSS 2000 Eric J. Anderson , Kirsten Hildrum, Anna R. Karlin , April Rasala , Michael E. Saks : On List Update and Work Function Algorithms. ESA 1999 : 289-300 1 [ 1 ] [ 3 ] 2 [ 5 ] 3 [ 6 ] 4 [ 1 ] [ 3 ] 5 [ 8 ] 6 [ 4 ] [ 7 ] [ 8 ] [ 9 ] [ 11 ] 7 [ 1 ] [ 3 ] 8 [ 9 ] [ 10 ] 9 [ 4 ] [ 6 ] [ 9 ] [ 10 ] 10 [ 1 ] [ 3 ] 11 [ 11 ] 12 [ 5 ] 13 [ 12 ] 14 [ 4 ] ![]() ©2006 Association for Computing Machinery |