 | 2012 |
| 22 |  | Richard A. Brown,
Elizabeth Shoop,
Joel C. Adams,
David P. Bunde,
Jens Mache,
Paul F. Steinberg,
Matthew Wolf,
Michael Wrinn:
Sharing incremental approaches for adding parallelism to CS curricula (abstract only).
SIGCSE 2012: 747 |
| 21 |  | Richard A. Brown,
Joel C. Adams,
David P. Bunde,
Jens Mache,
Elizabeth Shoop:
A stratified view of programming language parallelism for undergraduate CS education.
SIGCSE 2012: 81-82 |
| 2011 |
| 20 |  | Alexander M. Lindsay,
Maxwell Galloway-Carson,
Christopher R. Johnson,
David P. Bunde,
Vitus J. Leung:
Backfilling with Guarantees Granted upon Job Submission.
Euro-Par (1) 2011: 142-153 |
| 19 |  | Nikhil Bansal,
David P. Bunde,
Ho-Leung Chan,
Kirk Pruhs:
Average Rate Speed Scaling.
Algorithmica 60(4): 877-889 (2011) |
| 2010 |
| 18 |  | Christopher R. Johnson,
David P. Bunde,
Vitus J. Leung:
A Tie-Breaking Strategy for Processor Allocation in Meshes.
ICPP Workshops 2010: 331-338 |
| 17 |  | David P. Bunde,
Michael H. Goldwasser:
Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput.
SWAT 2010: 346-358 |
| 2009 |
| 16 |  | Ojaswirajanya Thebe,
David P. Bunde,
Vitus J. Leung:
Scheduling Restartable Jobs with Short Test Runs.
JSSPP 2009: 116-137 |
| 15 |  | David P. Bunde:
Power-aware scheduling for makespan and flow.
J. Scheduling 12(5): 489-500 (2009) |
| 2008 |
| 14 |  | Nikhil Bansal,
David P. Bunde,
Ho-Leung Chan,
Kirk Pruhs:
Average Rate Speed Scaling.
LATIN 2008: 240-251 |
| 13 |  | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.
Algorithmica 50(2): 279-298 (2008) |
| 12 |  | David P. Bunde,
Kevin G. Milans,
Douglas B. West,
Hehui Wu:
Optimal strong parity edge-coloring of complete graphs.
Combinatorica 28(6): 625-632 (2008) |
| 11 |  | David P. Bunde,
Erin W. Chambers,
Daniel W. Cranston,
Kevin G. Milans,
Douglas B. West:
Pebbling and optimal pebbling in graphs.
Journal of Graph Theory 57(3): 215-238 (2008) |
| 2006 |
| 10 |  | David P. Bunde:
Power-aware scheduling for makespan and flow.
SPAA 2006: 190-196 |
| 9 |  | David P. Bunde:
Power-aware scheduling for makespan and flow
CoRR abs/cs/0605126: (2006) |
| 2005 |
| 8 |  | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers.
WADS 2005: 169-181 |
| 7 |  | Jeff Erickson,
Shripad Thite,
David P. Bunde:
Distance-2 Edge Coloring is NP-Complete
CoRR abs/cs/0509100: (2005) |
| 6 |  | Yossi Azar,
Avrim Blum,
David P. Bunde,
Yishay Mansour:
Combining Online Algorithms for Acceptance and Rejection.
Theory of Computing 1(1): 105-117 (2005) |
| 2004 |
| 5 |  | David P. Bunde,
Vitus J. Leung,
Jens Mache:
Communication Patterns and Allocation Strategies.
IPDPS 2004 |
| 4 |  | David P. Bunde,
Yishay Mansour:
Improved combination of online algorithms for acceptance and rejection.
SPAA 2004: 265-266 |
| 3 |  | Michael A. Bender,
David P. Bunde,
Erik D. Demaine,
Sándor P. Fekete,
Vitus J. Leung,
Henk Meijer,
Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers
CoRR cs.DS/0407058: (2004) |
| 2 |  | David P. Bunde:
SPT is optimally competitive for uniprocessor flow.
Inf. Process. Lett. 90(5): 233-238 (2004) |
| 2002 |
| 1 |  | Vitus J. Leung,
Esther M. Arkin,
Michael A. Bender,
David P. Bunde,
Jeanette Johnston,
Alok Lal,
Joseph S. B. Mitchell,
Cynthia A. Phillips,
Steven S. Seiden:
Processor Allocation on Cplant: Achieving General Processor Locality Using One-Dimensional Allocation Strategies.
CLUSTER 2002: 296-304 |