Showing results 1 to 20 of 26
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Weighted flow time does not admit O(1)-competitive algorithms Proceeding/Conference:Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2009 | |||
Tradeoff between energy and throughput for online deadline scheduling Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2011 | 115 | ||
Speed scaling with an arbitrary power function Proceeding/Conference:Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2009 | |||
Speed scaling of processes with arbitrary speedup curves on a multiprocessor Proceeding/Conference:Proceedings of the Annual ACM Symposium on Parallel Algorithms and Architectures | 2009 | 107 | ||
Scheduling for speed bounded processors Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2008 | |||
Reconstructing an ultrametric galled phylogenetic network from a distance matrix Proceeding/Conference:Lecture Notes in Computer Science | 2005 | |||
Online flow time scheduling in the presence of preemption overhead Proceeding/Conference:Lecture Notes in Computer Science | 2012 | |||
Nonclairvoyant speed scaling for flow and energy Proceeding/Conference:Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science | 2009 | 109 | ||
Non-preemptive min-sum scheduling with resource augmentation Proceeding/Conference:Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS | 2007 | 106 | ||
Non-migratory Online Deadline Scheduling on Multiprocessors Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2004 | 106 | ||
Non-clairvoyant weighted flow time scheduling on different multi-processor models Proceeding/Conference:Lecture Notes in Computer Science | 2011 | 101 | ||
A mutation-sensitive approach for locating conserved gene pairs between related species Proceeding/Conference:Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004 | 2004 | |||
A linear size index for approximate pattern matching Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2006 | |||
A linear size index for approximate pattern matching Proceeding/Conference:Journal of Discrete Algorithms | 2011 | 120 | ||
Improved bounds for speed scaling in devices obeying the cube-root rule Proceeding/Conference:Lecture Notes In Computer Science | 2009 | |||
Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling Proceeding/Conference:Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2006 | |||
Energy-efficient due date scheduling Proceeding/Conference:Lecture Notes in Computer Science | 2011 | |||
Energy Efficient Online Deadline Scheduling Proceeding/Conference:Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2007 | 111 | ||
Efficiency of data distribution in BitTorrent-like systems Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2007 | |||
Edit distance to monotonicity in sliding windows Proceeding/Conference:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2011 |