default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Liben-Nowell
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Ben Aoki-Sherwood, Catherine Bregou, David Liben-Nowell, Kiran Tomlinson, Thomas Zeng:
Bounding Consideration Probabilities in Consider-Then-Choose Ranking Models. AAMAS 2024: 2129-2131- [c27]Anna N. Rafferty
, David Liben-Nowell, David R. Musicant, Emy Farley, Allie Lyman, Ann May:
Playing with Matches: Adopting Gale-Shapley for Managing Student Enrollments Beyond CS2. SIGCSE (1) 2024: 1084-1090 - [i4]Ben Aoki-Sherwood, Catherine Bregou, David Liben-Nowell, Kiran Tomlinson, Thomas Zeng:
Bounding Consideration Probabilities in Consider-Then-Choose Ranking Models. CoRR abs/2401.11016 (2024) - 2022
- [c26]David Liben-Nowell, Anna N. Rafferty:
Student Motivations and Goals for CS1: Themes and Variations. SIGCSE (1) 2022: 237-243 - 2020
- [c25]Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson:
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. CPM 2020: 11:1-11:15 - [i3]Patty Commins, David Liben-Nowell, Tina Liu, Kiran Tomlinson:
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions. CoRR abs/2004.08993 (2020)
2010 – 2019
- 2019
- [c24]Barbara M. Anthony, Mia Minnes, David Liben-Nowell, Peter-Michael Osera:
Modernizing the Mathematics Taught in Computer Science. SIGCSE 2019: 1246 - 2018
- [c23]Violet Brown, Xi Chen, Maryam Hedayati, Camden Sikes, Julia Strand, Tegan Wilson, David Liben-Nowell:
Node Ordering for Rescalable Network Summarization (or, the Apparent Magic of Word Frequency and Age of Acquisition in the Lexicon). COMPLEX NETWORKS (1) 2018: 66-80 - [c22]Justin Cheng, Jon M. Kleinberg, Jure Leskovec, David Liben-Nowell, Bogdan State, Karthik Subbian, Lada A. Adamic:
Do Diffusion Protocols Govern Cascade Growth? ICWSM 2018: 32-41 - [i2]Justin Cheng, Jon M. Kleinberg, Jure Leskovec, David Liben-Nowell, Bogdan State, Karthik Subbian, Lada A. Adamic:
Do Diffusion Protocols Govern Cascade Growth? CoRR abs/1805.07368 (2018) - 2016
- [c21]Desislava Hristova, David Liben-Nowell, Anastasios Noulas, Cecilia Mascolo:
If You've Got the Money, I've Got the Time: Spatio-Temporal Footprints of Spending at Sports Events on Foursquare. CitiLab@ICWSM 2016 - 2015
- [p2]David Liben-Nowell, Carissa Knipe, Calder Coalson:
Indifferent Attachment: The Role of Degree in Ranking Friends. Applications of Social Media and Social Network Analysis 2015: 41-55 - 2013
- [c20]David Liben-Nowell, Carissa Knipe, Calder Coalson:
Indifferent attachment: the role of degree in ranking friends. ASONAM 2013: 1416-1417 - 2012
- [c19]David Liben-Nowell, Alexa Sharp, Tom Wexler, Kevin M. Woods:
Computing Shapley Value in Supermodular Coalitional Games. COCOON 2012: 568-579 - 2011
- [j13]Joshua R. Davis, David Liben-Nowell, Alexa Sharp, Tom Wexler:
Mediated Equilibria in Load-Balanced Games. Chic. J. Theor. Comput. Sci. 2011 (2011) - [j12]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 Math. 7(3): 178-205 (2011) - [c18]Flavio Chierichetti, Jon M. Kleinberg, David Liben-Nowell:
Reconstructing Patterns of Information Diffusion from Incomplete Observations. NIPS 2011: 792-800 - [c17]Russell Buehler, Zachary Goldman, David Liben-Nowell, Yuechao Pei, Jamie Quadri, Alexa Sharp, Sam Taggart, Tom Wexler, Kevin M. Woods:
The Price of Civil Society. WINE 2011: 375-382 - 2010
- [p1]David Liben-Nowell:
Wayfinding in Social Networks. Algorithms for Next Generation Networks 2010: 435-456
2000 – 2009
- 2009
- [c16]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 - [c15]Joshua R. Davis, David Liben-Nowell, Alexa Sharp, Tom Wexler:
Mediated Equilibria in Load-Balancing Games. WINE 2009: 591-599 - 2008
- [j11]Esteban Arcaute, Ning Chen, Ravi Kumar, David Liben-Nowell, Mohammad Mahdian, Hamid Nazerzadeh, Ying Xu:
Deterministic Decentralized Search in Random Graphs. Internet Math. 5(1): 141-154 (2008) - [j10]David Liben-Nowell, Jon M. Kleinberg:
Tracing information flow on a global scale using Internet chain-letter data. Proc. Natl. Acad. Sci. USA 105(12): 4633-4638 (2008) - 2007
- [j9]David Liben-Nowell, Jon M. Kleinberg:
The link-prediction problem for social networks. J. Assoc. Inf. Sci. Technol. 58(7): 1019-1031 (2007) - [c14]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 - [c13]Esteban Arcaute, Adam Kirsch, Ravi Kumar, David Liben-Nowell, Sergei Vassilvitskii:
On threshold behavior in query incentive networks. EC 2007: 66-74 - [c12]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 - 2006
- [j8]David Liben-Nowell, Erik Vee, An Zhu:
Finding longest increasing and common subsequences in streaming data. J. Comb. Optim. 11(2): 155-175 (2006) - [c11]Ravi Kumar, David Liben-Nowell, Andrew Tomkins:
Navigating Low-Dimensional and Hierarchical Population Networks. ESA 2006: 480-491 - [c10]Matt Lepinski, David Liben-Nowell, Seth Gilbert, April Rasala Lehman:
Playing games in many possible worlds. EC 2006: 150-159 - 2005
- [b1]David Liben-Nowell:
An algorithmic approach to social networks. Massachusetts Institute of Technology, Cambridge, MA, USA, 2005 - [j7]David Liben-Nowell, Jasmine Novak, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins:
Geographic routing in social networks. Proc. Natl. Acad. Sci. USA 102(33): 11623-11628 (2005) - [c9]David Liben-Nowell, Erik Vee, An Zhu:
Finding Longest Increasing and Common Subsequences in Streaming Data. COCOON 2005: 263-272 - 2004
- [j6]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. Geom. Appl. 14(1-2): 41-68 (2004) - [j5]David Liben-Nowell, Jon M. Kleinberg:
Structural properties and tractability results for linear synteny. J. Discrete Algorithms 2(2): 207-228 (2004) - [j4]Daniel Gruhl, David Liben-Nowell, Ramanathan V. Guha, Andrew Tomkins:
Information diffusion through blogspace. SIGKDD Explor. 6(2): 43-52 (2004) - [c8]Daniel Gruhl, Ramanathan V. Guha, David Liben-Nowell, Andrew Tomkins:
Information diffusion through blogspace. WWW 2004: 491-501 - 2003
- [j3]Ion Stoica, Robert Tappan 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) - [c7]David Liben-Nowell, Jon M. Kleinberg:
The link prediction problem for social networks. CIKM 2003: 556-559 - [c6]Erik D. Demaine, Susan Hohenberger, David Liben-Nowell:
Tetris is Hard, Even to Approximate. COCOON 2003: 351-363 - 2002
- [j2]David Liben-Nowell:
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes. J. Algorithms 43(2): 264-283 (2002) - [c5]David Liben-Nowell, Hari Balakrishnan, David R. Karger:
Observations on the Dynamic Evolution of Peer-to-Peer Networks. IPTPS 2002: 22-33 - [c4]David Liben-Nowell, Hari Balakrishnan, David R. Karger:
Analysis of the evolution of peer-to-peer systems. PODC 2002: 233-242 - [i1]Erik D. Demaine, Susan Hohenberger, David Liben-Nowell:
Tetris is Hard, Even to Approximate. CoRR cs.CC/0210020 (2002) - 2001
- [j1]David Liben-Nowell:
On the Structure of Syntenic Distance. J. Comput. Biol. 8(1): 53-67 (2001) - [c3]David Liben-Nowell:
Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance. SODA 2001: 177-185 - 2000
- [c2]David Liben-Nowell, Jon M. Kleinberg:
Structural Properties and Tractability Results for Linear Synteny. CPM 2000: 248-263
1990 – 1999
- 1999
- [c1]David Liben-Nowell:
On the Structure of Syntenic Distance. CPM 1999: 50-65
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-04 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
