Brian C. Dean

According to our database, Brian C. Dean authored at least 30 papers between 2003 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2016

Improved algorithmic results for unsplittable stable allocation problems.

Ágnes Cseh, Brian C. Dean

J. Comb. Optim., 2016

2015

Randomized Reduction.

Brian C. Dean, Raghuveer Mohan, Chad G. Waters

Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

2014

Lightweight Approximate Selection.

Brian C. Dean, Rommel Jalasutram, Chad G. Waters

Proceedings of the Algorithms - ESA 2014, 2014

2013

A linear programming approach to reconstructing subcellular structures from confocal images for automated generation of representative 3D cellular models.

Scott T. Wood, Brian C. Dean, Delphine Dean

Medical Image Anal., 2013

Building Cartesian trees from free trees with k leaves.

Brian C. Dean, Raghuveer Mohan

Inf. Process. Lett., 2013

No sensor left behind: enriching computing education with mobile devices.

Matthew H. Dabney, Brian C. Dean, Tom Rogers

Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Teaching data structures with BeSocratic (abstract only).

Sam Bryfczynski, Brian C. Dean, Roy P. Pargas, Melanie M. Cooper, Michael Klymkowsky

Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Teaching data structures with beSocratic.

Sam Bryfczynski, Roy P. Pargas, Melanie M. Cooper, Michael Klymkowsky, Brian C. Dean

Proceedings of the Innovation and Technology in Computer Science Education conference 2013, 2013

A study of morphology-based wavelet features and multiple-wavelet strategy for EEG signal classification: Results and selected statistical analysis.

Jing Zhou, Robert J. Schalkoff, Brian C. Dean, Jonathan J. Halford

Proceedings of the 35th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2013

2012

Morphology-based wavelet features and multiple mother wavelet strategy for spike classification in EEG signals.

Jing Zhou, Robert J. Schalkoff, Brian C. Dean, Jonathan J. Halford

Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2012

2011

Matchability and k-maximal matchings.

Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae

Discret. Appl. Math., 2011

Approximation Algorithms for <i>k</i>-hurdle Problems.

Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley

Algorithmica, 2011

2010

Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution.

Brian C. Dean

Algorithmic Oper. Res., 2010

Faster Algorithms for Stable Allocation Problems.

Brian C. Dean, Siddharth Munshi

Algorithmica, 2010

An Efficient Algorithm for Batch Stability Testing.

John Dabney, Brian C. Dean

Algorithmica, 2010

Adaptive stable marriage algorithms.

John Dabney, Brian C. Dean

Proceedings of the 48th Annual Southeast Regional Conference, 2010

2009

A linear-time algorithm for broadcast domination in a tree.

John Dabney, Brian C. Dean, Stephen T. Hedetniemi

Networks, 2009

The Generalized Stable Allocation Problem.

Brian C. Dean, Namrata Swar

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Rank-Sensitive Priority Queues.

Brian C. Dean, Zachary H. Jones

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

A Linear Programming Approach for Automated Localization of Multiple Faults.

Brian C. Dean, William B. Pressly, Brian A. Malloy, Adam A. Whitley

Proceedings of the ASE 2009, 2009

2008

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity.

Brian C. Dean, Michel X. Goemans, Jan Vondrák

Math. Oper. Res., 2008

Approximation Algorithms for k-Hurdle Problems.

Brian C. Dean, Adam Griffis, Adam A. Whitley

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

2007

Exploring the duality between skip lists and binary search trees.

Brian C. Dean, Zachary H. Jones

Proceedings of the 45th Annual Southeast Regional Conference, 2007

2006

A simple expected running time analysis for randomized "divide and conquer" algorithms.

Brian C. Dean

Discret. Appl. Math., 2006

The Unsplittable Stable Marriage Problem.

Brian C. Dean, Michel X. Goemans, Nicole Immorlica

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data.

Brian C. Dean, Michel X. Goemans, Nicole Immorlica

Proceedings of the Algorithms, 2006

2005

Approximation algorithms for stochastic scheduling problems.

Brian C. Dean

PhD thesis, 2005

Adaptivity and approximation for stochastic packing problems.

Brian C. Dean, Michel X. Goemans, Jan Vondrák

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

2004

Algorithms for minimum-cost paths in time-dependent networks with waiting policies.

Brian C. Dean

Networks, 2004

2003

Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling.

Brian C. Dean, Michel X. Goemans

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003