| 2015 | SIGCSE | Randomized Reduction. | Brian C. Dean, Raghuveer Mohan, Chad G. Waters |
| 2014 | ESA | Lightweight Approximate Selection. | Brian C. Dean, Rommel Jalasutram, Chad G. Waters |
| 2013 | ITiCSE | Teaching data structures with beSocratic. | Sam Bryfczynski, Roy P. Pargas, Melanie M. Cooper, Michael Klymkowsky, Brian C. Dean |
| 2013 | SIGCSE | Teaching data structures with BeSocratic (abstract only). | Sam Bryfczynski, Brian C. Dean, Roy P. Pargas, Melanie M. Cooper, Michael Klymkowsky |
| 2013 | SIGCSE | No sensor left behind: enriching computing education with mobile devices. | Matthew H. Dabney, Brian C. Dean, Tom Rogers |
| 2009 | WADS | Rank-Sensitive Priority Queues. | Brian C. Dean, Zachary H. Jones |
| 2009 | WALCOM | The Generalized Stable Allocation Problem. | Brian C. Dean, Namrata Swar |
| 2008 | LATIN | Approximation Algorithms for k-Hurdle Problems. | Brian C. Dean, Adam Griffis, Adam Whitley |
| 2006 | ESA | Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. | Brian C. Dean, Michel X. Goemans, Nicole Immorlica |
| 2005 | SODA | Adaptivity and approximation for stochastic packing problems. | Brian C. Dean, Michel X. Goemans, Jan Vondrk |
| 2004 | FOCS | Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. | Brian C. Dean, Michel X. Goemans, Jan Vondrk |
| 2003 | ICALP | Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. | Brian C. Dean, Michel X. Goemans |