Resource scheduling for parallel database and scientific applications
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Optimal time-critical scheduling via resource augmentation (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Minimizing wirelength in zero and bounded skew clock trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Improved algorithms for stretch scheduling
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Building Edge-Failure Resilient Networks
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improving Parallel Job Scheduling Using Runtime Measurements
IPDPS '00/JSSPP '00 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
TCP is competitive against a limited adversary
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Minimizing flow time nonclairvoyantly
Journal of the ACM (JACM)
Journal of Global Optimization
Approximation Algorithms for Average Stretch Scheduling
Journal of Scheduling
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Scheduling with conflicts on bipartite and interval graphs
Journal of Scheduling - Special issue: On-line scheduling
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
Journal of the ACM (JACM)
Journal of Scheduling
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Performance guarantees for hierarchical clustering
Journal of Computer and System Sciences - Special issue on COLT 2002
Transactional contention management as a non-clairvoyant scheduling problem
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Scheduling search procedures: The wheel of fortune
Journal of Scheduling
Utilization of nonclairvoyant online schedules
Theoretical Computer Science
Competitive online scheduling for server systems
ACM SIGMETRICS Performance Evaluation Review
Approximating total flow time on parallel machines
Journal of Computer and System Sciences
ACM Transactions on Algorithms (TALG)
Non-clairvoyant scheduling with precedence constraints
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Probabilistic analysis for scheduling with conflicts
Theoretical Computer Science
An Optimal Strategy for Online Non-uniform Length Order Scheduling
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Scalably scheduling processes with arbitrary speedup curves
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Weighted flow time does not admit O(1)-competitive algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the forty-first annual ACM symposium on Theory of computing
Preventing versus curing: avoiding conflicts in transactional memories
Proceedings of the 28th ACM symposium on Principles of distributed computing
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Harnessing migrations in a market-based grid OS
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Transactional Scheduling for Read-Dominated Workloads
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Non-clairvoyant batch sets scheduling: fairness is fair enough
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Prospects of collaboration between compute providers by means of job interchange
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
Scheduling jobs with varying parallelizability to reduce variance
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Optimality, fairness, and robustness in speed scaling designs
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On burst transmission scheduling in mobile TV broadcast networks
IEEE/ACM Transactions on Networking (TON)
Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Non-clairvoyant speed scaling for weighted flow time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Optimal scheduling of heavy tailed traffic via shape parameter estimation
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Minimizing maximum flowtime of jobs with arbitrary parallelizability
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
Broadcasting video streams encoded with arbitrary bit rates in energy-constrained mobile TV networks
IEEE/ACM Transactions on Networking (TON)
Scheduling heterogeneous processors isn't as easy as you think
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On-Line algorithms, real time, the virtue of laziness, and the power of clairvoyance
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On the value of preemption in scheduling
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Oblivious medians via online bidding
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Scalably scheduling processes with arbitrary speedup curves
ACM Transactions on Algorithms (TALG)
Non-clairvoyant weighted flow time scheduling on different multi-processor models
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Non-clairvoyant weighted flow time scheduling with rejection penalty
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Transactional scheduling for read-dominated workloads
Journal of Parallel and Distributed Computing
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science
Shortest-Elapsed-Time-First on a multiprocessor
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
FIFO queueing policies for packets with heterogeneous processing
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Nonclairvoyant sleep management and flow-time scheduling on multiple processors
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Competitive online adaptive scheduling for sets of parallel jobs with fairness and efficiency
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |