MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 11 documents:

  1. A note on sorting buffers offline
    Ho-Leung Chan, Nicole Megow, René Sitters, and Rob van Stee
    Theoretical Computer Science 423: 11-18, 2012

  2. Algorithms and Complexity for Periodic Real-Time Scheduling
    Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, and Nicole Megow
    ACM Transactions on Algorithms 9: 601-619, 2012
  3. Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
    Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting
    Algorithmica 62 (3-4): 1088-1111, 2012
  4. Competitive Algorithms for Due Date Schedulin
    Nikhil Bansal, Ho-Leung Chan, and KIrk Pruhs
    Algorithmica 59 (4): 569-582, 2011
  5. Nonclairvoyant speed scaling for flow and energy
    Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, and Kirk Pruhs
    Algorithmica 61 (3): 507-517, 2011
  6. Algorithms and Complexity for Periodic Real-Time Scheduling
    Vincenzo Bonifaci, Ho-Leung Chan, Alberto Marchetti-Spaccamela, and Nicole Megow
    In: 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), Austin (TX), USA, 2010, 1350-1359
    [PDF: Download: SODA10_109_bonifaciv.pdf]
  7. Continuous monitoring of distributed data streams over a time-based sliding window
    Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting
    In: 27th International Symposium on Theoretical Aspects of Computer Science STACS 2010, Nancy, France, 2010, 179-190
  8. Nonclairvoyant Speed Scaling for Flow and Energy
    Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam, Lap-Kei Lee, Alberto Marchetti-Spaccamela, and Kirk Pruhs
    In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), Freiburg, Germany, 2009, 255-264
  9. Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
    Ho-Leung Chan, Jeff Edmonds, and Kirk Pruhs
    In: SPAA'09 : proceedings of the Twenty-First Annual Symposium on Parallelism in Algorithms and Architectures, Calgary, Canada, 2009, 1-10
  10. Speed Scaling with an Arbitrary Power Function
    Nikhil Bansal, Ho-Leung Chan, and Kirk Pruhs
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, USA, 2009, 693-701
  11. Weighted flow time does not admit O(1)-competitive algorithms
    Nikhil Bansal and Ho-Leung Chan
    In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), New York, USA, 2009, 1238-1244