default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrian C. Dean
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Filippo Battaglia
, Mattia Galanti, Giovanni Gugliandolo, Stefan Rampp, Jan Remi, Alexandra Parashos, Sonali Sharma, Sonal Bhatia, Brian C. Dean, Ekrem Kutluay, Zeke Campbell, Sarah Schmitt, Nicola Donato, Jonathan J. Halford, Giuseppe Campobello:
Neurophysiology Signal Codecs for the DICOM® Standard: Preliminary Results. MeMeA 2024: 1-6- 2021
- [j13]S. Koshy-Chenthittayil, E. Dimitrova, Eleanor W. Jenkins, Brian C. Dean:
A computational framework for finding parameter sets associated with chaotic dynamics. Silico Biol. 14(1-2): 41-51 (2021)
2010 – 2019
- 2016
- [j12]Ágnes Cseh, Brian C. Dean:
Improved algorithmic results for unsplittable stable allocation problems. J. Comb. Optim. 32(3): 657-671 (2016) - 2015
- [c18]Brian C. Dean, Raghuveer Mohan, Chad G. Waters:
Randomized Reduction. SIGCSE 2015: 259-264 - 2014
- [c17]Brian C. Dean, Rommel Jalasutram, Chad G. Waters:
Lightweight Approximate Selection. ESA 2014: 309-320 - [i1]Ágnes Cseh, Brian C. Dean:
Improved Algorithmic Results for Unsplittable Stable Allocation Problems. CoRR abs/1411.6818 (2014) - 2013
- [j11]Brian C. Dean, Raghuveer Mohan:
Building Cartesian trees from free trees with k leaves. Inf. Process. Lett. 113(9): 345-349 (2013) - [j10]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): 337-347 (2013) - [c16]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: 5998-6002 - [c15]Sam Bryfczynski, Roy P. Pargas, Melanie M. Cooper, Michael Klymkowsky, Brian C. Dean:
Teaching data structures with beSocratic. ITiCSE 2013: 105-110 - [c14]Matthew H. Dabney, Brian C. Dean, Tom Rogers:
No sensor left behind: enriching computing education with mobile devices. SIGCSE 2013: 627-632 - [c13]Sam Bryfczynski, Brian C. Dean, Roy P. Pargas, Melanie M. Cooper, Michael Klymkowsky:
Teaching data structures with BeSocratic (abstract only). SIGCSE 2013: 736 - 2012
- [c12]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: 3959-3962 - 2011
- [j9]Brian C. Dean, Adam Griffis, Ojas Parekh, Adam A. Whitley:
Approximation Algorithms for k-hurdle Problems. Algorithmica 59(1): 81-93 (2011) - [j8]Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae:
Matchability and k-maximal matchings. Discret. Appl. Math. 159(1): 15-22 (2011) - 2010
- [j7]John Dabney, Brian C. Dean:
An Efficient Algorithm for Batch Stability Testing. Algorithmica 58(1): 52-58 (2010) - [j6]Brian C. Dean, Siddharth Munshi:
Faster Algorithms for Stable Allocation Problems. Algorithmica 58(1): 59-81 (2010) - [j5]Brian C. Dean:
Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution. Algorithmic Oper. Res. 5(2): 96-104 (2010) - [c11]John Dabney, Brian C. Dean:
Adaptive stable marriage algorithms. ACM Southeast Regional Conference 2010: 35
2000 – 2009
- 2009
- [j4]John Dabney, Brian C. Dean, Stephen T. Hedetniemi:
A linear-time algorithm for broadcast domination in a tree. Networks 53(2): 160-169 (2009) - [c10]Brian C. Dean, William B. Pressly, Brian A. Malloy, Adam A. Whitley:
A Linear Programming Approach for Automated Localization of Multiple Faults. ASE 2009: 640-644 - [c9]Brian C. Dean, Zachary H. Jones:
Rank-Sensitive Priority Queues. WADS 2009: 181-192 - [c8]Brian C. Dean, Namrata Swar:
The Generalized Stable Allocation Problem. WALCOM 2009: 238-249 - 2008
- [j3]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. Math. Oper. Res. 33(4): 945-964 (2008) - [c7]Brian C. Dean, Adam Griffis, Adam A. Whitley:
Approximation Algorithms for k-Hurdle Problems. LATIN 2008: 449-460 - 2007
- [c6]Brian C. Dean, Zachary H. Jones:
Exploring the duality between skip lists and binary search trees. ACM Southeast Regional Conference 2007: 395-399 - 2006
- [j2]Brian C. Dean:
A simple expected running time analysis for randomized "divide and conquer" algorithms. Discret. Appl. Math. 154(1): 1-5 (2006) - [c5]Brian C. Dean, Michel X. Goemans, Nicole Immorlica:
Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data. ESA 2006: 268-279 - [c4]Brian C. Dean, Michel X. Goemans, Nicole Immorlica:
The Unsplittable Stable Marriage Problem. IFIP TCS 2006: 65-75 - 2005
- [b1]Brian C. Dean:
Approximation algorithms for stochastic scheduling problems. Massachusetts Institute of Technology, Cambridge, MA, USA, 2005 - [c3]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Adaptivity and approximation for stochastic packing problems. SODA 2005: 395-404 - 2004
- [j1]Brian C. Dean:
Algorithms for minimum-cost paths in time-dependent networks with waiting policies. Networks 44(1): 41-46 (2004) - [c2]Brian C. Dean, Michel X. Goemans, Jan Vondrák:
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity. FOCS 2004: 208-217 - 2003
- [c1]Brian C. Dean, Michel X. Goemans:
Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling. ICALP 2003: 1138-1152
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
