Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Models of machines and computation for mapping in multicomputers
ACM Computing Surveys (CSUR)
Support for implementing scheduling algorithms using MESSIAHS
Scientific Programming - Special issue on operating system support for massively parallel computer architectures
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Multiprocessor scheduling with rejection
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Scheduling to minimize average completion time: off-line and on-line algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximation techniques for average completion time scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Improved bicriteria existence theorems for scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Theoretical Computer Science
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Performance Guarantees of Local Search for Multiprocessor Scheduling
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
All-Norm Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Testing Acyclicity of Directed Graphs in Sublinear Time
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Executing Divisible Jobs on a Network with a Fixed Number of Processors
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Task Distributions on Multiprocessor Systems
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Property testing in massive graphs
Handbook of massive data sets
Pipelined operator tree scheduling in heterogeneous environments
Journal of Parallel and Distributed Computing
Self-adapting software for numerical linear algebra and LAPACK for clusters
Parallel Computing - Special issue: Parallel and distributed scientific and engineering computing
Vector assignment problems: a general framework
Journal of Algorithms
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
All-norm approximation algorithms
Journal of Algorithms
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A sufficient condition for truthfulness with single parameter agents
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Self-adapting numerical software (SANS) effort
IBM Journal of Research and Development
Performance Guarantees of Local Search for Multiprocessor Scheduling
INFORMS Journal on Computing
Graph balancing: a special case of scheduling unrelated parallel machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Makespan minimization for multiple uniform machines
Computers and Industrial Engineering
Approximation algorithms for scheduling unrelated parallel machines
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Deterministic monotone algorithms for scheduling on related machines
Theoretical Computer Science
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Fair cost-sharing methods for scheduling jobs on parallel machines
Journal of Discrete Algorithms
Tighter approximation bounds for LPT scheduling in two special cases
Journal of Discrete Algorithms
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Placing pipeline stages on a Grid: Single path and multipath pipeline execution
Future Generation Computer Systems
On Multi-dimensional Envy-Free Mechanisms
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Optimal preemptive scheduling for general target functions
Journal of Computer and System Sciences
Nashification and the coordination ratio for a selfish routing game
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Tradeoffs and average-case equilibria in selfish routing
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
Automation and Remote Control
A deterministic truthful PTAS for scheduling related machines
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Energy efficient scheduling via partial shutdown
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A fast 5/2-approximation algorithm for hierarchical scheduling
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
On the packing of selfish items
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
A truthful constant approximation for maximizing the minimum load on related machines
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Optimal file-distribution in heterogeneous and asymmetric storage networks
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
SIAM Journal on Discrete Mathematics
Santa Claus schedules jobs on unrelated machines
Proceedings of the forty-third annual ACM symposium on Theory of computing
Smoothed performance guarantees for local search
ESA'11 Proceedings of the 19th European conference on Algorithms
Lower bound for envy-free and truthful makespan approximation on related machines
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Truthful Approximation Schemes for Single-Parameter Agents
SIAM Journal on Computing
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Fast monotone 3-approximation algorithm for scheduling related machines
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Journal of Parallel and Distributed Computing
Atomic selfish routing in networks: a survey
WINE'05 Proceedings of the First international conference on Internet and Network Economics
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Linear time algorithms for parallel machine scheduling
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Fair cost-sharing methods for scheduling jobs on parallel machines
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Tighter approximation bounds for LPT scheduling in two special cases
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Truthful approximation mechanisms for scheduling selfish related machines
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Deterministic monotone algorithms for scheduling on related machines
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
On the limits of black-box reductions in mechanism design
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
ACM Transactions on Algorithms (TALG)
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
ACM Transactions on Algorithms (TALG)
Approximation algorithms for scheduling and packing problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Scheduling jobs on identical and uniform processors revisited
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Approximations and auctions for scheduling batches on related machines
Operations Research Letters
Operations Research Letters
An optimal rounding gives a better approximation for scheduling unrelated machines
Operations Research Letters
Online minimum makespan scheduling with a buffer
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
Journal of Combinatorial Optimization
Partitioned EDF scheduling on a few types of unrelated multiprocessors
Real-Time Systems
RTP: robust tenant placement for elastic in-memory database clusters
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Faster approximation algorithms for scheduling with fixed jobs
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Joint cache partition and job assignment on multi-core processors
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Moderately exponential approximation for makespan minimization on related machines
Theoretical Computer Science
Adaptive workload-aware task scheduling for single-ISA asymmetric multicore architectures
ACM Transactions on Architecture and Code Optimization (TACO)
| Hi-index | 0.00 |