![]() | ![]() |
| 2011 | ||
|---|---|---|
| 30 | Flavio Chierichetti, Jon M. Kleinberg, David Liben-Nowell: Reconstructing Patterns of Information Diffusion from Incomplete Observations. NIPS 2011: 792-800 | |
| 29 | Russell Buehler, Zachary Goldman, David Liben-Nowell, Yuechao Pei, Jamie Quadri, Alexa Sharp, Sam Taggart, Tom Wexler, Kevin Woods: The Price of Civil Society. WINE 2011: 375-382 | |
| 28 | Joshua R. Davis, David Liben-Nowell, Alexa Sharp, Tom Wexler: Mediated Equilibria in Load-Balanced Games. Chicago J. Theor. Comput. Sci. 2011: (2011) | |
| 27 | Joshua R. Davis, Zachary Goldman, Elizabeth N. Koch, Jacob Hilty, David Liben-Nowell, Alexa Sharp, Tom Wexler, Emma Zhou: Equilibria and Efficiency Loss in Games on Networks. Internet Mathematics 7(3): 178-205 (2011) | |
| 2009 | ||
| 26 | Joshua R. Davis, Zachary Goldman, Jacob Hilty, Elizabeth N. Koch, David Liben-Nowell, Alexa Sharp, Tom Wexler, Emma Zhou: Equilibria and Efficiency Loss in Games on Networks. CSE (4) 2009: 82-89 | |
| 25 | Joshua R. Davis, David Liben-Nowell, Alexa Sharp, Tom Wexler: Mediated Equilibria in Load-Balancing Games. WINE 2009: 591-599 | |
| 2008 | ||
| 24 | Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu: Deterministic Decentralized Search in Random Graphs. Internet Mathematics 5(1): 141-154 (2008) | |
| 2007 | ||
| 23 | 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 | 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 | 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 | David Liben-Nowell, Jon M. Kleinberg: The link-prediction problem for social networks. JASIST 58(7): 1019-1031 (2007) | |
| 2006 | ||
| 19 | 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 | Ravi Kumar, David Liben-Nowell, Andrew Tomkins: Navigating Low-Dimensional and Hierarchical Population Networks. ESA 2006: 480-491 | |
| 17 | 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 | David Liben-Nowell, Erik Vee, An Zhu: Finding Longest Increasing and Common Subsequences in Streaming Data. COCOON 2005: 263-272 | |
| 2004 | ||
| 15 | Daniel Gruhl, Ramanathan V. Guha, David Liben-Nowell, Andrew Tomkins: Information diffusion through blogspace. WWW 2004: 491-501 | |
| 14 | 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 | David Liben-Nowell, Jon M. Kleinberg: Structural properties and tractability results for linear synteny. J. Discrete Algorithms 2(2): 207-228 (2004) | |
| 12 | Daniel Gruhl, David Liben-Nowell, Ramanathan V. Guha, Andrew Tomkins: Information diffusion through blogspace. SIGKDD Explorations 6(2): 43-52 (2004) | |
| 2003 | ||
| 11 | David Liben-Nowell, Jon M. Kleinberg: The link prediction problem for social networks. CIKM 2003: 556-559 | |
| 10 | Erik D. Demaine, Susan Hohenberger, David Liben-Nowell: Tetris is Hard, Even to Approximate. COCOON 2003: 351-363 | |
| 9 | 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 | David Liben-Nowell, Hari Balakrishnan, David R. Karger: Observations on the Dynamic Evolution of Peer-to-Peer Networks. IPTPS 2002: 22-33 | |
| 7 | David Liben-Nowell, Hari Balakrishnan, David R. Karger: Analysis of the evolution of peer-to-peer systems. PODC 2002: 233-242 | |
| 6 | Erik D. Demaine, Susan Hohenberger, David Liben-Nowell: Tetris is Hard, Even to Approximate CoRR cs.CC/0210020: (2002) | |
| 5 | David Liben-Nowell: Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. J. Algorithms 43(2): 264-283 (2002) | |
| 2001 | ||
| 4 | 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 | David Liben-Nowell, Jon M. Kleinberg: Structural Properties and Tractability Results for Linear Synteny. CPM 2000: 248-263 | |
| 1999 | ||
| 1 | David Liben-Nowell: On the Structure of Syntenic Distance. CPM 1999: 50-65 | |
Colors in the list of coauthors
Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page