David Liben-Nowell
David Liben-Nowell
Bestätigte E-Mail-Adresse bei carleton.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
The link‐prediction problem for social networks
D Liben‐Nowell, J Kleinberg
Journal of the American society for information science and technology 58 (7 …, 2007
59642007
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
42292003
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
17732004
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
10402005
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
6112002
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
5002008
Tetris is hard, even to approximate
ED Demaine, S Hohenberger, D Liben-Nowell
International Computing and Combinatorics Conference, 351-363, 2003
1842003
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
1102002
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
1022011
Chord: A scalable peer-to-peer look-up protocol for internet applications
R Morris, MF Kaashoek, D Karger, H Balakrishnan, I Stoica, ...
IEEE/ACM Transactions On Networking 11 (1), 17-32, 2003
872003
An algorithmic approach to social networks
D Liben-Nowell
Massachusetts Institute of Technology, 2005
782005
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
772004
Computing shapley value in supermodular coalitional games
D Liben-Nowell, A Sharp, T Wexler, K Woods
International Computing and Combinatorics Conference, 568-579, 2012
452012
Finding longest increasing and common subsequences in streaming data
D Liben-Nowell, E Vee, A Zhu
Journal of Combinatorial Optimization 11 (2), 155-175, 2006
332006
Reconstructing Patterns of Information Diffusion from Incomplete Observations.
F Chierichetti, JM Kleinberg, D Liben-Nowell
NIPS 11, 792-800, 2011
282011
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
D Liben-Nowell
Journal of Algorithms 43 (2), 264-283, 2002
262002
Navigating low-dimensional and hierarchical population networks
R Kumar, D Liben-Nowell, A Tomkins
European Symposium on Algorithms, 480-491, 2006
252006
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
202007
Finding longest increasing and common subsequences in streaming data
D Liben-Nowell, E Vee, A Zhu
International Computing and Combinatorics Conference, 263-272, 2005
202005
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
192018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20