dblp.uni-trier.dewww.uni-trier.de

David P. Bunde Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
15EEOjaswirajanya Thebe, David P. Bunde, Vitus J. Leung: Scheduling Restartable Jobs with Short Test Runs. JSSPP 2009: 116-137
14EEDavid P. Bunde: Power-aware scheduling for makespan and flow. J. Scheduling 12(5): 489-500 (2009)
2008
13EENikhil Bansal, David P. Bunde, Ho-Leung Chan, Kirk Pruhs: Average Rate Speed Scaling. LATIN 2008: 240-251
12EEMichael 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)
11EEDavid P. Bunde, Erin W. Chambers, Daniel W. Cranston, Kevin Milans, Douglas B. West: Pebbling and optimal pebbling in graphs. Journal of Graph Theory 57(3): 215-238 (2008)
2006
10EEDavid P. Bunde: Power-aware scheduling for makespan and flow. SPAA 2006: 190-196
9EEDavid P. Bunde: Power-aware scheduling for makespan and flow CoRR abs/cs/0605126: (2006)
2005
8EEMichael 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
7EEJeff Erickson, Shripad Thite, David P. Bunde: Distance-2 Edge Coloring is NP-Complete CoRR abs/cs/0509100: (2005)
6EEYossi Azar, Avrim Blum, David P. Bunde, Yishay Mansour: Combining Online Algorithms for Acceptance and Rejection. Theory of Computing 1(1): 105-117 (2005)
2004
5EEDavid P. Bunde, Vitus J. Leung, Jens Mache: Communication Patterns and Allocation Strategies. IPDPS 2004
4EEDavid P. Bunde, Yishay Mansour: Improved combination of online algorithms for acceptance and rejection. SPAA 2004: 265-266
3EEMichael 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)
2EEDavid P. Bunde: SPT is optimally competitive for uniprocessor flow. Inf. Process. Lett. 90(5): 233-238 (2004)
2002
1EEVitus 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

Coauthor Index

1Esther M. Arkin [1]
2Yossi Azar [6]
3Nikhil Bansal [13]
4Michael A. Bender [1] [3] [8] [12]
5Avrim Blum [6]
6Erin W. Chambers [11]
7Ho-Leung Chan [13]
8Daniel W. Cranston [11]
9Erik D. Demaine [3] [8] [12]
10Jeff Erickson [7]
11Sándor P. Fekete [3] [8] [12]
12Jeanette Johnston [1]
13Alok Lal [1]
14Vitus J. Leung [1] [3] [5] [8] [12] [15]
15Jens Mache [5]
16Yishay Mansour [4] [6]
17Henk Meijer [3] [8] [12]
18Kevin Milans [11]
19Joseph S. B. Mitchell [1]
20Cynthia A. Phillips [1] [3] [8] [12]
21Kirk Pruhs [13]
22Steven S. Seiden [1]
23Ojaswirajanya Thebe [15]
24Shripad Thite [7]
25Douglas B. West [11]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)