9 citations · 9 across the 3 of their papers we have counts for
5 papers
Maximizing the Margin between Desirable and Undesirable Elements in a Covering Problem
Sophie Boileau, Andrew Hong, David Liben-Nowell +3
In many covering settings, it is natural to consider the presence both of elements that we seek to include and of elements that we seek to avoid. This paper introduces a novel comb…
When the Universe is Too Big: Bounding Consideration Probabilities for Plackett-Luce Rankings
Ben Aoki-Sherwood, Catherine Bregou, David Liben-Nowell +2
The widely used Plackett-Luce ranking model assumes that individuals rank items by making repeated choices from a universe of items. But in many cases the universe is too big for p…
Summarizing Diverging String Sequences, with Applications to Chain-Letter Petitions
Patty Commins, David Liben-Nowell, Tina Liu +1
Algorithms to find optimal alignments among strings, or to find a parsimonious summary of a collection of strings, are well studied in a variety of contexts, addressing a wide rang…
Do Diffusion Protocols Govern Cascade Growth?
Justin Cheng, Jon Kleinberg, Jure Leskovec +4
Large cascades can develop in online social networks as people share information with one another. Though simple reshare cascades have been studied extensively, the full range of c…
Tetris is Hard, Even to Approximate
Erik D. Demaine, Susan Hohenberger, David Liben-Nowell
In the popular computer game of Tetris, the player is given a sequence of tetromino pieces and must pack them into a rectangular gameboard initially occupied by a given configurati…