| Chord: A scalable peer-to-peer lookup service for internet applications I Stoica, R Morris, D Karger, MF Kaashoek, H Balakrishnan ACM SIGCOMM computer communication review 31 (4), 149-160, 2001 | 15476 | 2001 |
| The link prediction problem for social networks D Liben-Nowell, J Kleinberg Proceedings of the twelfth international conference on Information and …, 2003 | 7214 | 2003 |
| Chord: a scalable peer-to-peer lookup protocol for internet applications I Stoica, R Morris, D Liben-Nowell, DR Karger, MF Kaashoek, F Dabek, ... IEEE/ACM Transactions on networking 11 (1), 17-32, 2003 | 4515 | 2003 |
| Information diffusion through blogspace D Gruhl, R Guha, D Liben-Nowell, A Tomkins Proceedings of the 13th international conference on World Wide Web, 491-501, 2004 | 1889 | 2004 |
| Geographic routing in social networks D Liben-Nowell, J Novak, R Kumar, P Raghavan, A Tomkins Proceedings of the National Academy of Sciences 102 (33), 11623-11628, 2005 | 1139 | 2005 |
| Analysis of the evolution of peer-to-peer systems D Liben-Nowell, H Balakrishnan, D Karger Proceedings of the twenty-first annual symposium on Principles of …, 2002 | 637 | 2002 |
| Tracing information flow on a global scale using Internet chain-letter data D Liben-Nowell, J Kleinberg Proceedings of the national academy of sciences 105 (12), 4633-4638, 2008 | 532 | 2008 |
| A scalable peer-to-peer lookup service for internet applications I Stoica, R Morris, D Karger, MF Kaashoek, H Balakrishnan, A Chord Lab. Comput. Sci., Massachusetts Inst. Technol., Tech. Rep. TR-819, 2001 | 339 | 2001 |
| Tetris is hard, even to approximate ED Demaine, S Hohenberger, D Liben-Nowell Computing and Combinatorics: 9th Annual International Conference, COCOON …, 2003 | 204 | 2003 |
| Best friends: Alliances, friend ranking, and the MySpace social network P DeScioli, R Kurzban, EN Koch, D Liben-Nowell Perspectives on Psychological Science 6 (1), 6-8, 2011 | 121 | 2011 |
| Observations on the dynamic evolution of peer-to-peer networks D Liben-Nowell, H Balakrishnan, D Karger International Workshop on Peer-to-Peer Systems, 22-33, 2002 | 110 | 2002 |
| Tetris is hard, even to approximate R Breukelaar, ED Demaine, S Hohenberger, HJ Hoogeboom, WA Kosters, ... International Journal of Computational Geometry & Applications 14 (01n02), 41-68, 2004 | 96 | 2004 |
| An algorithmic approach to social networks D Liben-Nowell Massachusetts Institute of Technology, 2005 | 80 | 2005 |
| Computing shapley value in supermodular coalitional games D Liben-Nowell, A Sharp, T Wexler, K Woods Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012 | 59 | 2012 |
| Finding longest increasing and common subsequences in streaming data D Liben-Nowell, E Vee, A Zhu Journal of Combinatorial Optimization 11, 155-175, 2006 | 37 | 2006 |
| Do diffusion protocols govern cascade growth? J Cheng, J Kleinberg, J Leskovec, D Liben-Nowell, K Subbian, L Adamic Proceedings of the International AAAI Conference on Web and Social Media 12 (1), 2018 | 32 | 2018 |
| Reconstructing patterns of information diffusion from incomplete observations F Chierichetti, D Liben-Nowell, J Kleinberg Advances in neural information processing systems 24, 2011 | 31 | 2011 |
| Gossip is synteny: Incomplete gossip and the syntenic distance between genomes D Liben-Nowell Journal of Algorithms 43 (2), 264-283, 2002 | 28 | 2002 |
| Navigating low-dimensional and hierarchical population networks R Kumar, D Liben-Nowell, A Tomkins European Symposium on Algorithms, 480-491, 2006 | 27 | 2006 |
| On threshold behavior in query incentive networks E Arcaute, A Kirsch, R Kumar, D Liben-Nowell, S Vassilvitskii Proceedings of the 8th ACM conference on Electronic commerce, 66-74, 2007 | 23 | 2007 |
