The following pages link to David Liben-Nowell (Q876714):
Displaying 21 items.
- Structural properties and tractability results for linear synteny (Q876715) (← links)
- Equilibria and efficiency loss in games on networks (Q2213964) (← links)
- Finding longest increasing and common subsequences in streaming data (Q2498982) (← links)
- (Q2723955) (← links)
- (Q2768288) (← links)
- Computing Shapley Value in Supermodular Coalitional Games (Q2914358) (← links)
- (Q3024797) (← links)
- Deterministic Decentralized Search in Random Graphs (Q3078602) (← links)
- Tetris is Hard, Even to Approximate (Q3082942) (← links)
- Gossip is synteny: Incomplete gossip and the syntenic distance between genomes (Q3150285) (← links)
- (Q4709123) (← links)
- TETRIS IS HARD, EVEN TO APPROXIMATE (Q4818596) (← links)
- Connecting Discrete Mathematics and Computer Science (Q5068352) (← links)
- Analysis of the evolution of peer-to-peer systems (Q5170883) (← links)
- Depth of Field and Cautious-Greedy Routing in Social Networks (Q5387792) (← links)
- (Q5414594) (← links)
- Navigating Low-Dimensional and Hierarchical Population Networks (Q5449552) (← links)
- (Q5457090) (← links)
- Deterministic Decentralized Search in Random Graphs (Q5458311) (← links)
- Computing and Combinatorics (Q5716944) (← links)
- (Q5874439) (← links)