2007 |
23 | EE | Esteban Arcaute,
Adam Kirsch,
Ravi Kumar,
David Liben-Nowell,
Sergei Vassilvitskii:
On threshold behavior in query incentive networks.
ACM Conference on Electronic Commerce 2007: 66-74 |
22 | EE | David Barbella,
George Kachergis,
David Liben-Nowell,
Anna Sallstrom,
Ben Sowell:
Depth of Field and Cautious-Greedy Routing in Social Networks.
ISAAC 2007: 574-586 |
21 | EE | Esteban Arcaute,
Ning Chen,
Ravi Kumar,
David Liben-Nowell,
Mohammad Mahdian,
Hamid Nazerzadeh,
Ying Xu:
Deterministic Decentralized Search in Random Graphs.
WAW 2007: 187-194 |
20 | EE | David Liben-Nowell,
Jon M. Kleinberg:
The link-prediction problem for social networks.
JASIST 58(7): 1019-1031 (2007) |
2006 |
19 | EE | Matt Lepinski,
David Liben-Nowell,
Seth Gilbert,
April Rasala Lehman:
Playing games in many possible worlds.
ACM Conference on Electronic Commerce 2006: 150-159 |
18 | EE | Ravi Kumar,
David Liben-Nowell,
Andrew Tomkins:
Navigating Low-Dimensional and Hierarchical Population Networks.
ESA 2006: 480-491 |
17 | EE | David Liben-Nowell,
Erik Vee,
An Zhu:
Finding longest increasing and common subsequences in streaming data.
J. Comb. Optim. 11(2): 155-175 (2006) |
2005 |
16 | EE | David Liben-Nowell,
Erik Vee,
An Zhu:
Finding Longest Increasing and Common Subsequences in Streaming Data.
COCOON 2005: 263-272 |
2004 |
15 | EE | Daniel Gruhl,
Ramanathan V. Guha,
David Liben-Nowell,
Andrew Tomkins:
Information diffusion through blogspace.
WWW 2004: 491-501 |
14 | EE | Ron Breukelaar,
Erik D. Demaine,
Susan Hohenberger,
Hendrik Jan Hoogeboom,
Walter A. Kosters,
David Liben-Nowell:
Tetris is hard, even to approximate.
Int. J. Comput. Geometry Appl. 14(1-2): 41-68 (2004) |
13 | EE | David Liben-Nowell,
Jon M. Kleinberg:
Structural properties and tractability results for linear synteny.
J. Discrete Algorithms 2(2): 207-228 (2004) |
12 | EE | Daniel Gruhl,
David Liben-Nowell,
Ramanathan V. Guha,
Andrew Tomkins:
Information diffusion through blogspace.
SIGKDD Explorations 6(2): 43-52 (2004) |
2003 |
11 | EE | David Liben-Nowell,
Jon M. Kleinberg:
The link prediction problem for social networks.
CIKM 2003: 556-559 |
10 | EE | Erik D. Demaine,
Susan Hohenberger,
David Liben-Nowell:
Tetris is Hard, Even to Approximate.
COCOON 2003: 351-363 |
9 | EE | 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) |
2002 |
8 | EE | David Liben-Nowell,
Hari Balakrishnan,
David R. Karger:
Observations on the Dynamic Evolution of Peer-to-Peer Networks.
IPTPS 2002: 22-33 |
7 | EE | David Liben-Nowell,
Hari Balakrishnan,
David R. Karger:
Analysis of the evolution of peer-to-peer systems.
PODC 2002: 233-242 |
6 | EE | Erik D. Demaine,
Susan Hohenberger,
David Liben-Nowell:
Tetris is Hard, Even to Approximate
CoRR cs.CC/0210020: (2002) |
5 | EE | David Liben-Nowell:
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes.
J. Algorithms 43(2): 264-283 (2002) |
2001 |
4 | EE | David Liben-Nowell:
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance.
SODA 2001: 177-185 |
3 | | David Liben-Nowell:
On the Structure of Syntenic Distance.
Journal of Computational Biology 8(1): 53-67 (2001) |
2000 |
2 | EE | David Liben-Nowell,
Jon M. Kleinberg:
Structural Properties and Tractability Results for Linear Synteny.
CPM 2000: 248-263 |
1999 |
1 | EE | David Liben-Nowell:
On the Structure of Syntenic Distance.
CPM 1999: 50-65 |