Daniel Leventhal and Meinolf Sellmann
The Accuracy of Search Heuristics
Proceedings the Fifth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 5015, pp. 142-157, 2008.
Meinolf Sellmann, Luc Mercier, and Daniel Leventhal
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
Proceedings the Fourth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 4510, pp. 275-287, 2007.
Ionut Aron, Daniel Leventhal, and Meinolf Sellmann
A Totally Unimodular Description of the Consistent Value Polytope for Binary CSPs
Proceedings the Third International Conference on the Integration of AI and OR Techniques in Constraint
Programming for Combinatorial Optimization Problems
(CP-AI-OR), Springer LNCS 3990, pp. 16-28, 2006.
Daniel Leventhal, Bernie Gordon, and Peter G. Sibley
Poisson Image Editing Extended (supplement)
ACM SIGGRAPH 2006 Posters.
Mocha - An alternative course planning site for Brown University. Mocha helps find courses to take, create a schedule and buy books for courses.
Hogs - A 3D, third person, multi-player, networked game we made in cs32. Strive to prove your dominance in a hovercraft tournament of champions. It supports messages, team play, and customized taunts (once we added this feature, development slowed considerably, since we would just play the game for hours and taunt each other). The project is open source and can be found on source forge. Hogs was later used as the basis for a project in cs166, a class on computer security.
Spring 07: cs157 - Algorithms
Fall 06: cs167/9 - Operating Systems
Spring 06: cs141 - AI
Fall 05: cs149 - Combinatorial Optimization
Fall 04 - Spring 05: cs17/18 - An integrated introduction to CS