Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Brian C. Dean
@article{DBLP:journals/jco/CsehD16, author = {{\'{A}}gnes Cseh and Brian C. Dean}, title = {Improved algorithmic results for unsplittable stable allocation problems}, journal = {J. Comb. Optim.}, volume = {32}, number = {3}, pages = {657--671}, year = {2016}, url = {https://doi.org/10.1007/s10878-015-9889-3}, doi = {10.1007/S10878-015-9889-3}, timestamp = {Thu, 18 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jco/CsehD16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/DeanMW15, author = {Brian C. Dean and Raghuveer Mohan and Chad G. Waters}, editor = {Adrienne Decker and Kurt Eiselt and Carl Alphonce and Jodi L. Tims}, title = {Randomized Reduction}, booktitle = {Proceedings of the 46th {ACM} Technical Symposium on Computer Science Education, {SIGCSE} 2015, Kansas City, MO, USA, March 4-7, 2015}, pages = {259--264}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2676723.2677251}, doi = {10.1145/2676723.2677251}, timestamp = {Mon, 13 Dec 2021 09:32:31 +0100}, biburl = {https://dblp.org/rec/conf/sigcse/DeanMW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/DeanJW14, author = {Brian C. Dean and Rommel Jalasutram and Chad G. Waters}, editor = {Andreas S. Schulz and Dorothea Wagner}, title = {Lightweight Approximate Selection}, booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8737}, pages = {309--320}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-662-44777-2\_26}, doi = {10.1007/978-3-662-44777-2\_26}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/DeanJW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CsehD14, author = {{\'{A}}gnes Cseh and Brian C. Dean}, title = {Improved Algorithmic Results for Unsplittable Stable Allocation Problems}, journal = {CoRR}, volume = {abs/1411.6818}, year = {2014}, url = {http://arxiv.org/abs/1411.6818}, eprinttype = {arXiv}, eprint = {1411.6818}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CsehD14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DeanM13, author = {Brian C. Dean and Raghuveer Mohan}, title = {Building Cartesian trees from free trees with k leaves}, journal = {Inf. Process. Lett.}, volume = {113}, number = {9}, pages = {345--349}, year = {2013}, url = {https://doi.org/10.1016/j.ipl.2013.02.014}, doi = {10.1016/J.IPL.2013.02.014}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DeanM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mia/WoodDD13, author = {Scott T. Wood and Brian C. Dean and Delphine Dean}, title = {A linear programming approach to reconstructing subcellular structures from confocal images for automated generation of representative 3D cellular models}, journal = {Medical Image Anal.}, volume = {17}, number = {3}, pages = {337--347}, year = {2013}, url = {https://doi.org/10.1016/j.media.2012.12.002}, doi = {10.1016/J.MEDIA.2012.12.002}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mia/WoodDD13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/embc/ZhouSDH13, author = {Jing Zhou and Robert J. Schalkoff and Brian C. Dean and Jonathan J. Halford}, title = {A study of morphology-based wavelet features and multiple-wavelet strategy for {EEG} signal classification: Results and selected statistical analysis}, booktitle = {35th Annual International Conference of the {IEEE} Engineering in Medicine and Biology Society, {EMBC} 2013, Osaka, Japan, July 3-7, 2013}, pages = {5998--6002}, publisher = {{IEEE}}, year = {2013}, url = {https://doi.org/10.1109/EMBC.2013.6610919}, doi = {10.1109/EMBC.2013.6610919}, timestamp = {Wed, 16 Oct 2019 14:14:50 +0200}, biburl = {https://dblp.org/rec/conf/embc/ZhouSDH13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iticse/BryfczynskiPCKD13, author = {Sam Bryfczynski and Roy P. Pargas and Melanie M. Cooper and Michael Klymkowsky and Brian C. Dean}, editor = {Janet Carter and Ian Utting and Alison Clear}, title = {Teaching data structures with beSocratic}, booktitle = {Innovation and Technology in Computer Science Education conference 2013, ITiCSE '13, Canterbury, United Kingdom - July 01 - 03, 2013}, pages = {105--110}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2462476.2465583}, doi = {10.1145/2462476.2465583}, timestamp = {Tue, 18 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iticse/BryfczynskiPCKD13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/DabneyDR13, author = {Matthew H. Dabney and Brian C. Dean and Tom Rogers}, editor = {Tracy Camp and Paul T. Tymann and J. D. Dougherty and Kris Nagel}, title = {No sensor left behind: enriching computing education with mobile devices}, booktitle = {The 44th {ACM} Technical Symposium on Computer Science Education, {SIGCSE} 2013, Denver, CO, USA, March 6-9, 2013}, pages = {627--632}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2445196.2445378}, doi = {10.1145/2445196.2445378}, timestamp = {Tue, 23 Mar 2021 10:54:19 +0100}, biburl = {https://dblp.org/rec/conf/sigcse/DabneyDR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sigcse/BryfczynskiDPCK13, author = {Sam Bryfczynski and Brian C. Dean and Roy P. Pargas and Melanie M. Cooper and Michael Klymkowsky}, editor = {Tracy Camp and Paul T. Tymann and J. D. Dougherty and Kris Nagel}, title = {Teaching data structures with BeSocratic (abstract only)}, booktitle = {The 44th {ACM} Technical Symposium on Computer Science Education, {SIGCSE} 2013, Denver, CO, USA, March 6-9, 2013}, pages = {736}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2445196.2445429}, doi = {10.1145/2445196.2445429}, timestamp = {Tue, 18 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/sigcse/BryfczynskiDPCK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/embc/ZhouSDH12, author = {Jing Zhou and Robert J. Schalkoff and Brian C. Dean and Jonathan J. Halford}, title = {Morphology-based wavelet features and multiple mother wavelet strategy for spike classification in {EEG} signals}, booktitle = {Annual International Conference of the {IEEE} Engineering in Medicine and Biology Society, {EMBC} 2012, San Diego, CA, USA, August 28 - September 1, 2012}, pages = {3959--3962}, publisher = {{IEEE}}, year = {2012}, url = {https://doi.org/10.1109/EMBC.2012.6346833}, doi = {10.1109/EMBC.2012.6346833}, timestamp = {Wed, 16 Oct 2019 14:14:50 +0200}, biburl = {https://dblp.org/rec/conf/embc/ZhouSDH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DeanGPW11, author = {Brian C. Dean and Adam Griffis and Ojas Parekh and Adam A. Whitley}, title = {Approximation Algorithms for \emph{k}-hurdle Problems}, journal = {Algorithmica}, volume = {59}, number = {1}, pages = {81--93}, year = {2011}, url = {https://doi.org/10.1007/s00453-010-9408-y}, doi = {10.1007/S00453-010-9408-Y}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DeanGPW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DeanHHLM11, author = {Brian C. Dean and Sandra Mitchell Hedetniemi and Stephen T. Hedetniemi and Jason Lewis and Alice A. McRae}, title = {Matchability and k-maximal matchings}, journal = {Discret. Appl. Math.}, volume = {159}, number = {1}, pages = {15--22}, year = {2011}, url = {https://doi.org/10.1016/j.dam.2010.09.006}, doi = {10.1016/J.DAM.2010.09.006}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DeanHHLM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DabneyD10, author = {John Dabney and Brian C. Dean}, title = {An Efficient Algorithm for Batch Stability Testing}, journal = {Algorithmica}, volume = {58}, number = {1}, pages = {52--58}, year = {2010}, url = {https://doi.org/10.1007/s00453-009-9320-5}, doi = {10.1007/S00453-009-9320-5}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DabneyD10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DeanM10, author = {Brian C. Dean and Siddharth Munshi}, title = {Faster Algorithms for Stable Allocation Problems}, journal = {Algorithmica}, volume = {58}, number = {1}, pages = {59--81}, year = {2010}, url = {https://doi.org/10.1007/s00453-010-9416-y}, doi = {10.1007/S00453-010-9416-Y}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DeanM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aor/Dean10, author = {Brian C. Dean}, title = {Speeding up Stochastic Dynamic Programming with Zero-Delay Convolution}, journal = {Algorithmic Oper. Res.}, volume = {5}, number = {2}, pages = {96--104}, year = {2010}, url = {http://journals.hil.unb.ca/index.php/AOR/article/view/12631}, timestamp = {Wed, 10 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/aor/Dean10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ACMse/DabneyD10, author = {John Dabney and Brian C. Dean}, editor = {H. Conrad Cunningham and Paul Ruth and Nicholas A. Kraft}, title = {Adaptive stable marriage algorithms}, booktitle = {Proceedings of the 48th Annual Southeast Regional Conference, 2010, Oxford, MS, USA, April 15-17, 2010}, pages = {35}, publisher = {{ACM}}, year = {2010}, url = {https://doi.org/10.1145/1900008.1900057}, doi = {10.1145/1900008.1900057}, timestamp = {Fri, 12 Mar 2021 15:27:48 +0100}, biburl = {https://dblp.org/rec/conf/ACMse/DabneyD10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/DabneyDH09, author = {John Dabney and Brian C. Dean and Stephen T. Hedetniemi}, title = {A linear-time algorithm for broadcast domination in a tree}, journal = {Networks}, volume = {53}, number = {2}, pages = {160--169}, year = {2009}, url = {https://doi.org/10.1002/net.20275}, doi = {10.1002/NET.20275}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/DabneyDH09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/kbse/DeanPMW09, author = {Brian C. Dean and William B. Pressly and Brian A. Malloy and Adam A. Whitley}, title = {A Linear Programming Approach for Automated Localization of Multiple Faults}, booktitle = {{ASE} 2009, 24th {IEEE/ACM} International Conference on Automated Software Engineering, Auckland, New Zealand, November 16-20, 2009}, pages = {640--644}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/ASE.2009.54}, doi = {10.1109/ASE.2009.54}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/kbse/DeanPMW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/DeanJ09, author = {Brian C. Dean and Zachary H. Jones}, editor = {Frank K. H. A. Dehne and Marina L. Gavrilova and J{\"{o}}rg{-}R{\"{u}}diger Sack and Csaba D. T{\'{o}}th}, title = {Rank-Sensitive Priority Queues}, booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS} 2009, Banff, Canada, August 21-23, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5664}, pages = {181--192}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03367-4\_16}, doi = {10.1007/978-3-642-03367-4\_16}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/DeanJ09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/walcom/DeanS09, author = {Brian C. Dean and Namrata Swar}, editor = {Sandip Das and Ryuhei Uehara}, title = {The Generalized Stable Allocation Problem}, booktitle = {{WALCOM:} Algorithms and Computation, Third International Workshop, {WALCOM} 2009, Kolkata, India, February 18-20, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5431}, pages = {238--249}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-00202-1\_21}, doi = {10.1007/978-3-642-00202-1\_21}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/walcom/DeanS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mor/DeanGV08, author = {Brian C. Dean and Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity}, journal = {Math. Oper. Res.}, volume = {33}, number = {4}, pages = {945--964}, year = {2008}, url = {https://doi.org/10.1287/moor.1080.0330}, doi = {10.1287/MOOR.1080.0330}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mor/DeanGV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/DeanGW08, author = {Brian C. Dean and Adam Griffis and Adam A. Whitley}, editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Lu{\'{e}}rbio Faria}, title = {Approximation Algorithms for k-Hurdle Problems}, booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium, B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4957}, pages = {449--460}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-78773-0\_39}, doi = {10.1007/978-3-540-78773-0\_39}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/latin/DeanGW08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ACMse/DeanJ07, author = {Brian C. Dean and Zachary H. Jones}, editor = {David John and Sandria N. Kerr}, title = {Exploring the duality between skip lists and binary search trees}, booktitle = {Proceedings of the 45th Annual Southeast Regional Conference, 2007, Winston-Salem, North Carolina, USA, March 23-24, 2007}, pages = {395--399}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1233341.1233413}, doi = {10.1145/1233341.1233413}, timestamp = {Fri, 12 Mar 2021 15:27:48 +0100}, biburl = {https://dblp.org/rec/conf/ACMse/DeanJ07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Dean06, author = {Brian C. Dean}, title = {A simple expected running time analysis for randomized "divide and conquer" algorithms}, journal = {Discret. Appl. Math.}, volume = {154}, number = {1}, pages = {1--5}, year = {2006}, url = {https://doi.org/10.1016/j.dam.2005.07.005}, doi = {10.1016/J.DAM.2005.07.005}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Dean06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/DeanGI06, author = {Brian C. Dean and Michel X. Goemans and Nicole Immorlica}, editor = {Yossi Azar and Thomas Erlebach}, title = {Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data}, booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4168}, pages = {268--279}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11841036\_26}, doi = {10.1007/11841036\_26}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/DeanGI06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifipTCS/DeanGI06, author = {Brian C. Dean and Michel X. Goemans and Nicole Immorlica}, editor = {Gonzalo Navarro and Leopoldo E. Bertossi and Yoshiharu Kohayakawa}, title = {The Unsplittable Stable Marriage Problem}, booktitle = {Fourth {IFIP} International Conference on Theoretical Computer Science {(TCS} 2006), {IFIP} 19th World Computer Congress, {TC-1} Foundations of Computer Science, August 23-24, 2006, Santiago, Chile}, series = {{IFIP}}, volume = {209}, pages = {65--75}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/978-0-387-34735-6\_9}, doi = {10.1007/978-0-387-34735-6\_9}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/ifipTCS/DeanGI06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/ndltd/Dean05, author = {Brian C. Dean}, title = {Approximation algorithms for stochastic scheduling problems}, school = {Massachusetts Institute of Technology, Cambridge, MA, {USA}}, year = {2005}, url = {https://hdl.handle.net/1721.1/30154}, timestamp = {Wed, 04 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/ndltd/Dean05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DeanGV05, author = {Brian C. Dean and Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Adaptivity and approximation for stochastic packing problems}, booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January 23-25, 2005}, pages = {395--404}, publisher = {{SIAM}}, year = {2005}, url = {http://dl.acm.org/citation.cfm?id=1070432.1070487}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/DeanGV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/Dean04, author = {Brian C. Dean}, title = {Algorithms for minimum-cost paths in time-dependent networks with waiting policies}, journal = {Networks}, volume = {44}, number = {1}, pages = {41--46}, year = {2004}, url = {https://doi.org/10.1002/net.20013}, doi = {10.1002/NET.20013}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/Dean04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DeanGV04, author = {Brian C. Dean and Michel X. Goemans and Jan Vondr{\'{a}}k}, title = {Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity}, booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19 October 2004, Rome, Italy, Proceedings}, pages = {208--217}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/FOCS.2004.15}, doi = {10.1109/FOCS.2004.15}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DeanGV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DeanG03, author = {Brian C. Dean and Michel X. Goemans}, editor = {Jos C. M. Baeten and Jan Karel Lenstra and Joachim Parrow and Gerhard J. Woeginger}, title = {Improved Approximation Algorithms for Minimum-Space Advertisement Scheduling}, booktitle = {Automata, Languages and Programming, 30th International Colloquium, {ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2719}, pages = {1138--1152}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/3-540-45061-0\_87}, doi = {10.1007/3-540-45061-0\_87}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DeanG03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.