Search the dblp DataBase
David Liben-Nowell :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
David Liben-Nowell , Jon M. Kleinberg The link prediction problem for social networks. [Citation Graph (0, 0)][DBLP ] CIKM, 2003, pp:556-559 [Conf ] Erik D. Demaine , Susan Hohenberger , David Liben-Nowell Tetris is Hard, Even to Approximate. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:351-363 [Conf ] David Liben-Nowell , Erik Vee , An Zhu Finding Longest Increasing and Common Subsequences in Streaming Data. [Citation Graph (0, 0)][DBLP ] COCOON, 2005, pp:263-272 [Conf ] David Liben-Nowell On the Structure of Syntenic Distance. [Citation Graph (0, 0)][DBLP ] CPM, 1999, pp:50-65 [Conf ] David Liben-Nowell , Jon M. Kleinberg Structural Properties and Tractability Results for Linear Synteny. [Citation Graph (0, 0)][DBLP ] CPM, 2000, pp:248-263 [Conf ] Ravi Kumar , David Liben-Nowell , Andrew Tomkins Navigating Low-Dimensional and Hierarchical Population Networks. [Citation Graph (0, 0)][DBLP ] ESA, 2006, pp:480-491 [Conf ] David Liben-Nowell , Hari Balakrishnan , David R. Karger Observations on the Dynamic Evolution of Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP ] IPTPS, 2002, pp:22-33 [Conf ] David Liben-Nowell , Hari Balakrishnan , David R. Karger Analysis of the evolution of peer-to-peer systems. [Citation Graph (0, 0)][DBLP ] PODC, 2002, pp:233-242 [Conf ] Matt Lepinski , David Liben-Nowell , Seth Gilbert , April Rasala Lehman Playing games in many possible worlds. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2006, pp:150-159 [Conf ] David Liben-Nowell Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance. [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:177-185 [Conf ] Daniel Gruhl , Ramanathan V. Guha , David Liben-Nowell , Andrew Tomkins Information diffusion through blogspace. [Citation Graph (0, 0)][DBLP ] WWW, 2004, pp:491-501 [Conf ] Erik D. Demaine , Susan Hohenberger , David Liben-Nowell Tetris is Hard, Even to Approximate [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Ron Breukelaar , Erik D. Demaine , Susan Hohenberger , Hendrik Jan Hoogeboom , Walter A. Kosters , David Liben-Nowell Tetris is hard, even to approximate. [Citation Graph (0, 0)][DBLP ] Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:41-68 [Journal ] David Liben-Nowell Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 2002, v:43, n:2, pp:264-283 [Journal ] David Liben-Nowell On the Structure of Syntenic Distance. [Citation Graph (0, 0)][DBLP ] Journal of Computational Biology, 2001, v:8, n:1, pp:53-67 [Journal ] David Liben-Nowell , Erik Vee , An Zhu Finding longest increasing and common subsequences in streaming data. [Citation Graph (0, 0)][DBLP ] J. Comb. Optim., 2006, v:11, n:2, pp:155-175 [Journal ] David Liben-Nowell , Jon M. Kleinberg Structural properties and tractability results for linear synteny. [Citation Graph (0, 0)][DBLP ] J. Discrete Algorithms, 2004, v:2, n:2, pp:207-228 [Journal ] Daniel Gruhl , David Liben-Nowell , Ramanathan V. Guha , Andrew Tomkins Information diffusion through blogspace. [Citation Graph (0, 0)][DBLP ] SIGKDD Explorations, 2004, v:6, n:2, pp:43-52 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] IEEE/ACM Trans. Netw., 2003, v:11, n:1, pp:17-32 [Journal ] Esteban Arcaute , Adam Kirsch , Ravi Kumar , David Liben-Nowell , Sergei Vassilvitskii On threshold behavior in query incentive networks. [Citation Graph (0, 0)][DBLP ] ACM Conference on Electronic Commerce, 2007, pp:66-74 [Conf ] Esteban Arcaute , Ning Chen , Ravi Kumar , David Liben-Nowell , Mohammad Mahdian , Hamid Nazerzadeh , Ying Xu 0002 Deterministic Decentralized Search in Random Graphs. [Citation Graph (0, 0)][DBLP ] WAW, 2007, pp:187-194 [Conf ] Depth of Field and Cautious-Greedy Routing in Social Networks. [Citation Graph (, )][DBLP ] Mediated Equilibria in Load-Balancing Games. [Citation Graph (, )][DBLP ] Equilibria and Efficiency Loss in Games on Networks. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.305secs