Brian C. Dean

Publication Activity (10 Years)

Years Active: 2003-2016
Publications (10 Years): 2

Top Venues

SIGCSE

EMBC

CoRR

J. Comb. Optim.

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Ágnes Cseh, Brian C. Dean
Improved algorithmic results for unsplittable stable allocation problems. J. Comb. Optim. 32 (3) (2016)
Brian C. Dean, Raghuveer Mohan, Chad G. Waters
Randomized Reduction. SIGCSE (2015)
Ágnes Cseh, Brian C. Dean
Improved Algorithmic Results for Unsplittable Stable Allocation Problems. CoRR (2014)
Brian C. Dean, Rommel Jalasutram, Chad G. Waters
Lightweight Approximate Selection. ESA (2014)
Brian C. Dean, Raghuveer Mohan
Building Cartesian trees from free trees with k leaves. Inf. Process. Lett. 113 (9) (2013)
Jing Zhou, Robert J. Schalkoff, Brian C. Dean, Jonathan J. Halford
A study of morphology-based wavelet features and multiple-wavelet strategy for EEG signal classification: Results and selected statistical analysis. EMBC (2013)
Scott T. Wood, Brian C. Dean, Delphine Dean
A linear programming approach to reconstructing subcellular structures from confocal images for automated generation of representative 3D cellular models. Medical Image Anal. 17 (3) (2013)
Sam Bryfczynski, Roy P. Pargas, Melanie M. Cooper, Michael Klymkowsky, Brian C. Dean
Teaching data structures with beSocratic. ITiCSE (2013)
Matthew H. Dabney, Brian C. Dean, Tom Rogers
No sensor left behind: enriching computing education with mobile devices. SIGCSE (2013)
Sam Bryfczynski, Brian C. Dean, Roy P. Pargas, Melanie M. Cooper, Michael Klymkowsky
Teaching data structures with BeSocratic (abstract only). SIGCSE (2013)
Jing Zhou, Robert J. Schalkoff, Brian C. Dean, Jonathan J. Halford
Morphology-based wavelet features and multiple mother wavelet strategy for spike classification in EEG signals. EMBC (2012)
Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley
-hurdle Problems. Algorithmica 59 (1) (2011)
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae
Matchability and k-maximal matchings. Discret. Appl. Math. 159 (1) (2011)
John Dabney, Brian C. Dean
An Efficient Algorithm for Batch Stability Testing. Algorithmica 58 (1) (2010)
Brian C. Dean, Siddharth Munshi
Faster Algorithms for Stable Allocation Problems. Algorithmica 58 (1) (2010)
John Dabney, Brian C. Dean
Adaptive stable marriage algorithms. ACM Southeast Regional Conference (2010)
Brian C. Dean
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution. Algorithmic Oper. Res. 5 (2) (2010)
Brian C. Dean, William B. Pressly, Brian A. Malloy, Adam A. Whitley
A Linear Programming Approach for Automated Localization of Multiple Faults. ASE (2009)
John Dabney, Brian C. Dean, Stephen T. Hedetniemi
A linear-time algorithm for broadcast domination in a tree. Networks 53 (2) (2009)
Brian C. Dean, Zachary H. Jones
Rank-Sensitive Priority Queues. WADS (2009)
Brian C. Dean, Namrata Swar
The Generalized Stable Allocation Problem. WALCOM (2009)
Brian C. Dean, Adam Griffis, Adam A. Whitley
Approximation Algorithms for k-Hurdle Problems. LATIN (2008)
Brian C. Dean, Michel X. Goemans, Jan Vondrák
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. Math. Oper. Res. 33 (4) (2008)
Brian C. Dean, Zachary H. Jones
Exploring the duality between skip lists and binary search trees. ACM Southeast Regional Conference (2007)
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. ESA (2006)
Brian C. Dean
A simple expected running time analysis for randomized "divide and conquer" algorithms. Discret. Appl. Math. 154 (1) (2006)
Brian C. Dean, Michel X. Goemans, Nicole Immorlica
The Unsplittable Stable Marriage Problem. IFIP TCS (2006)
Brian C. Dean, Michel X. Goemans, Jan Vondrák
Adaptivity and approximation for stochastic packing problems. SODA (2005)
Brian C. Dean
Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44 (1) (2004)
Brian C. Dean, Michel X. Goemans, Jan Vondrák
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS (2004)
Brian C. Dean, Michel X. Goemans
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. ICALP (2003)

Brian C. Dean.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Brian C. Dean