David Bunde's Papers

• Average rate speed scaling
  Written with Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs.
  Proceedings of the 8th Latin American Theoretical Infomatics Symposium (LATIN), volume 4957 of LNCS, pp. 240-251, 2008.
  

• Parity and strong edge-coloring of graphs
  Written with Kevin Milans, Douglas B. West, and Hehui Wu.
  Congressus Numerantium 187(2007), 193-213.
  

• Communication-aware processor allocation for supercomputers
  Written with Michael A. Bender, Erik D. Demaine, Sandor P. Fekete, Vitus J. Leung, Henk Meijer, and Cynthia A. Phillips.
  Algorithmica 50(2): 279-298, 2008.
  Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS), volume 3608 of LNCS, pp. 169-181, 2005.
  arXiv:cs.DS/0407058

• Pebbling and Optimal Pebbling in Graphs
  Written with Erin W. Chambers, Daniel Cranston, Kevin Milans, and Douglas B. West.
  Journal of Graph Theory 57(3):215-238, 2008.
  arXiv:math.CO/0510621

• Scheduling and admission control
  Ph.D. dissertation, University of Illinois at Urbana-Champaign, July 2006.
  Technical report UIUCDCS-R-2006-2729.

• Power-aware scheduling for makespan and flow
  Proceedings of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 190-196, 2006.
  arXiv:cs.DS/0605126

• Distance-2 Edge Coloring is NP-Complete
  Written with Jeff Erickson and Shripad Thite.
  Unpublished note, 2005.
  arXiv:cs.DM/0509100

• Combining Online Algorithms for Acceptance and Rejection
  Written with Yossi Azar, Avrim Blum, and Yishay Mansour.
  Theory of Computing, volume 1, pp. 105-117, 2005.
  Combines a SPAA '04 paper "Improved combination of online algorithms for acceptance and rejection", written with Yishay Mansour, and a paper that I did not write.

• Scheduling on a single machine to minimize total flow time with job rejections
  Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory & Applications (MISTA), pp. 562-572, 2005.

• SPT is optimally competitive for uniprocessor flow
  Information Processing Letters 90(5): 233-238, 2004.

• Communication patterns and allocation strategies
  Written with Vitus J. Leung and Jens Mache.
  Sandia Technical Report SAND2003-4522, January 2004.
  Proceedings of 3rd International Workshop on Performance Modeling, Evaluation, and Optimization of Parallel and Distributed Systems (PMEO-PDS), 2004. (No page number because the proceedings were distributed on CD.)

• Approximating total flow time
  Master's thesis, University of Illinois at Urbana-Champaign, December 2002.

• Processor allocation on Cplant: Achieving general processor locality using one-dimensional allocation strategies
  Written with Vitus J. Leung, Esther M. Arkin, Michael A. Bender, Jeanette Johnston, Alok Lal, Joseph S. B. Mitchell, Cynthia Phillips, and Steven S. Seiden
  Sandia Technical Report SAND2002-1488, July 2002.
  Proceedings of the 4th IEEE International Conference on Cluster Computing, pp. 296-304, 2002.