David Liben-Nowell

According to our database1, David Liben-Nowell authored at least 36 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bounding Consideration Probabilities in Consider-Then-Choose Ranking Models.
CoRR, 2024

2022
Student Motivations and Goals for CS1: Themes and Variations.
Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

2020
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
Modernizing the Mathematics Taught in Computer Science.
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

2018
Do Diffusion Protocols Govern Cascade Growth?
Proceedings of the Twelfth International Conference on Web and Social Media, 2018

Node Ordering for Rescalable Network Summarization (or, the Apparent Magic of Word Frequency and Age of Acquisition in the Lexicon).
Proceedings of the Complex Networks and Their Applications VII, 2018

2016
If You've Got the Money, I've Got the Time: Spatio-Temporal Footprints of Spending at Sports Events on Foursquare.
Proceedings of the CitiLab, Papers from the 2016 ICWSM Workshop, 2016

2015
Indifferent Attachment: The Role of Degree in Ranking Friends.
Proceedings of the Applications of Social Media and Social Network Analysis, 2015

2013
Indifferent attachment: the role of degree in ranking friends.
Proceedings of the Advances in Social Networks Analysis and Mining 2013, 2013

2012
Computing Shapley Value in Supermodular Coalitional Games.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Equilibria and Efficiency Loss in Games on Networks.
Internet Math., 2011

Mediated Equilibria in Load-Balanced Games.
Chic. J. Theor. Comput. Sci., 2011

The Price of Civil Society.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Reconstructing Patterns of Information Diffusion from Incomplete Observations.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010
Wayfinding in Social Networks.
Proceedings of the Algorithms for Next Generation Networks, 2010

2009
Mediated Equilibria in Load-Balancing Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008
Tracing information flow on a global scale using Internet chain-letter data.
Proc. Natl. Acad. Sci. USA, 2008

Deterministic Decentralized Search in Random Graphs.
Internet Math., 2008

2007
The link-prediction problem for social networks.
J. Assoc. Inf. Sci. Technol., 2007

On threshold behavior in query incentive networks.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Depth of Field and Cautious-Greedy Routing in Social Networks.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
Finding longest increasing and common subsequences in streaming data.
J. Comb. Optim., 2006

Playing games in many possible worlds.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Navigating Low-Dimensional and Hierarchical Population Networks.
Proceedings of the Algorithms, 2006

2005
An algorithmic approach to social networks.
PhD thesis, 2005

Geographic routing in social networks.
Proc. Natl. Acad. Sci. USA, 2005

2004
Information diffusion through blogspace.
SIGKDD Explor., 2004

Structural properties and tractability results for linear synteny.
J. Discrete Algorithms, 2004

Tetris is hard, even to approximate.
Int. J. Comput. Geom. Appl., 2004

2003
Chord: a scalable peer-to-peer lookup protocol for internet applications.
IEEE/ACM Trans. Netw., 2003

Tetris is Hard, Even to Approximate.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes.
J. Algorithms, 2002

Analysis of the evolution of peer-to-peer systems.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Observations on the Dynamic Evolution of Peer-to-Peer Networks.
Proceedings of the Peer-to-Peer Systems, First International Workshop, 2002

2001
On the Structure of Syntenic Distance.
J. Comput. Biol., 2001

Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001


  Loading...