David Liben-Nowell Papers on DiSC'04 The link prediction problem for social networks Publications Note: Links lead to the DBLP on the Web. David Liben-Nowell David Liben-Nowell, Jon M. Kleinberg : The link prediction problem for social networks. CIKM 2003 : 556-559 Erik D. Demaine , Susan Hohenberger , David Liben-Nowell: Tetris is Hard, Even to Approximate. COCOON 2003 : 351-363 Ion Stoica , Robert Morris , David Liben-Nowell, David R. Karger , M. Frans Kaashoek , Frank Dabek , Hari Balakrishnan : Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11 (1): 17-32 (2003) David Liben-Nowell, Hari Balakrishnan , David R. Karger : Observations on the Dynamic Evolution of Peer-to-Peer Networks. IPTPS 2002 : 22-33 David Liben-Nowell, Hari Balakrishnan , David R. Karger : Analysis of the evolution of peer-to-peer systems. PODC 2002 : 233-242 David Liben-Nowell: Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. J. Algorithms 43 (2): 264-283 (2002) David Liben-Nowell: Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance. SODA 2001 : 177-185 David Liben-Nowell: On the Structure of Syntenic Distance. Journal of Computational Biology 8 (1): 53-67 (2001) David Liben-Nowell, Jon M. Kleinberg : Structural Properties and Tractability Results for Linear Synteny. CPM 2000 : 248-263 David Liben-Nowell: On the Structure of Syntenic Distance. CPM 1999 : 50-65 1 [ 6 ] [ 7 ] [ 8 ] 2 [ 8 ] 3 [ 9 ] 4 [ 9 ] 5 [ 8 ] 6 [ 6 ] [ 7 ] [ 8 ] 7 [ 2 ] [ 10 ] 8 [ 8 ] 9 [ 8 ] ©2004 Association for Computing Machinery