David Liben-Nowell

Available identifiers

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5874439	2023-02-07	Paper
Connecting Discrete Mathematics and Computer Science	2022-04-06	Paper
Equilibria and efficiency loss in games on networks	2020-12-04	Paper
Analysis of the evolution of peer-to-peer systems	2014-07-25	Paper
https://portal.mardi4nfdi.de/entity/Q5414594	2014-05-06	Paper
Computing Shapley Value in Supermodular Coalitional Games	2012-09-25	Paper
Tetris is Hard, Even to Approximate	2011-03-18	Paper
Deterministic Decentralized Search in Random Graphs	2011-02-28	Paper
Depth of Field and Cautious-Greedy Routing in Social Networks	2008-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q5457090	2008-04-14	Paper
Deterministic Decentralized Search in Random Graphs	2008-04-11	Paper
Navigating Low-Dimensional and Hierarchical Population Networks	2008-03-11	Paper
Structural properties and tractability results for linear synteny	2007-04-26	Paper
Finding longest increasing and common subsequences in streaming data	2006-08-14	Paper
Computing and Combinatorics	2006-01-11	Paper
https://portal.mardi4nfdi.de/entity/Q3024797	2005-07-04	Paper
TETRIS IS HARD, EVEN TO APPROXIMATE	2004-09-29	Paper
https://portal.mardi4nfdi.de/entity/Q4709123	2003-06-20	Paper
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes	2002-09-30	Paper
Gossip is synteny: Incomplete gossip and an exact algorithm for syntenic distance	2002-03-24	Paper
https://portal.mardi4nfdi.de/entity/Q2723955	2001-07-08	Paper

This page was built for person: David Liben-Nowell