David's primary research interests include large-scale mathematical optimization and applied algorithms and data structures. His secondary interests include networking, combinatorial puzzles, and integer sequences. He was named an AT&T Fellow (2013), and has received the Frederick W. Lanchester prize (INFORMS, 2007, for The Traveling Salesman: A Computational Study), the William R. Bennet prize (IEEE Communications Society, 2007, for “Making Routing Robust to Changing Traffic Demands: Algorithms and Evaluation”), the Beale-Orchard-Hays prize (Mathematical Optimization Society, 2000, for "On the Solution of Traveling Salesman Problems”), and the George Pólya award (MAA, 2013, for “Carryless Arithmetic Mod 10”). He also had a winning entry in the 8th International Obfuscated C Code Contest (1991).
David also enjoys rock climbing and supporting the New Jersey Devils and New York Red Bulls.
Optimal Content Placement for a Large-Scale VoD System
IEEE/ACM Transactions on Networking, vol. 24 (2016), pp. 2114-2127
Content placement via the exponential potential function method
Integer Programming and Combinatorial Optimization - 16th International Conference, IPCO 2013, Springer, pp. 49-61
Combining predictors for recommending music: the False Positives' approach to KDD Cup track 2
JMLR Proceedings, vol. 18 (2012), pp. 199-213
Leveraging video viewing patterns for optimal content placement
NETWORKING 2012 - 11th International IFIP TC 6 Networking Conference Proceedings, Part II, pp. 44-58
Voting power and target-based site prioritization
Biological Conservation, vol. 143 (2010), pp. 1989-1997