Brian C. Dean

Available identifiers

zbMath Open dean.brian-cMaRDI QIDQ326456

List of research outcomes

Publication	Date of Publication	Type
Improved algorithmic results for unsplittable stable allocation problems	2016-10-12	Paper
Determining Parameters Leading to Chaotic Dynamics in Systems	2016-04-23	Paper
Adaptivity and approximation for stochastic packing problems	2014-10-13	Paper
Lightweight Approximate Selection	2014-10-08	Paper
Building Cartesian trees from free trees with \(k\) leaves	2014-05-26	Paper
Speeding up stochastic dynamic programming with zero-delay convolution	2013-12-11	Paper
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity	2011-04-27	Paper
Approximation algorithms for \(k\)-hurdle problems	2011-03-02	Paper
Matchability and \(k\)-maximal matchings	2011-01-14	Paper
Faster algorithms for stable allocation problems	2010-10-07	Paper
An efficient algorithm for batch stability testing	2010-10-07	Paper
Rank-Sensitive Priority Queues	2009-10-20	Paper
A linear‐time algorithm for broadcast domination in a tree	2009-07-28	Paper
The Generalized Stable Allocation Problem	2009-02-24	Paper
Approximation Algorithms for k-Hurdle Problems	2008-04-15	Paper
Finite Termination of “Augmenting Path” Algorithms in the Presence of Irrational Problem Data	2008-03-11	Paper
https://portal.mardi4nfdi.de/entity/Q5443191	2008-02-20	Paper
Embedded minimal disks with prescribed curvature blowup	2006-02-17	Paper
A simple expected running time analysis for randomized ``divide and conquer algorithms	2006-01-10	Paper
A generalization of Rado's theorem for almost graphical boundaries	2005-12-06	Paper
Algorithms for minimum-cost paths in time-dependent networks with waiting policies	2004-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q4449247	2004-02-08	Paper
Compact embedded minimal surfaces of positive genus without area bounds	2004-02-03	Paper

Research outcomes over time

This page was built for person: Brian C. Dean