ROBUST: a hardware solution to real-time overload
SIGMETRICS '93 Proceedings of the 1993 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Bounding the power of preemption in randomized scheduling
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Bandwidth allocation with preemption
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Scheduling for Overload in Real-Time Systems
IEEE Transactions on Computers
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Non-Preemptive Real-Time Scheduling of Multimedia Tasks
Real-Time Systems
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Performance guarantee for online deadline scheduling in the presence of overload
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Online server allocation in a server farm via benefit task systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
(Incremental) priority algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Extra processors versus future information in optimal deadline scheduling
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the speed requirement for optimal deadline scheduling in overloaded systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On-Line Scheduling with Tight Deadlines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On-Line Deadline Scheduling on Multiple Resources
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Maximizing job benefits on-line
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Online real-time preemptive scheduling of jobs with deadlines
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On-line scheduling with tight deadlines
Theoretical Computer Science - Mathematical foundations of computer science
Hard deadline queueing system with application to unified messaging service
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
Non-migratory online deadline scheduling on multiprocessors
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive deadline scheduling via additional or faster processors
Journal of Scheduling - Special issue: On-line algorithm part I
Fast, Best-Effort Real-Time Scheduling Algorithms
IEEE Transactions on Computers
Performance guarantee for EDF under overload
Journal of Algorithms
IEEE Transactions on Computers
Exact admission-control for integrated aperiodic and periodic tasks
Journal of Computer and System Sciences
Energy efficient online deadline scheduling
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing throughput for optical burst switching networks
IEEE/ACM Transactions on Networking (TON)
Online market driven spectrum scheduling and auction
Proceedings of the 2009 ACM workshop on Cognitive radio networks
Optimizing throughput and energy in online deadline scheduling
ACM Transactions on Algorithms (TALG)
SOFA: Strategyproof Online Frequency Allocation for Multihop Wireless Networks
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Energy efficient deadline scheduling in two processor systems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Deadline scheduling and power management for speed bounded processors
Theoretical Computer Science
Online deadline scheduling with preemption penalties
Computers and Industrial Engineering
Proceedings of the 2011 ACM Symposium on Applied Computing
TOFU: semi-truthful online frequency allocation mechanism for wireless network
IEEE/ACM Transactions on Networking (TON)
Maximizing the throughput of multiple machines on-line
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Algorithms for energy management
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Schemes for scheduling control messages by hierarchical protocols
Computer Communications
Competitive algorithms for due date scheduling
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
International Journal of Advanced Pervasive and Ubiquitous Computing
Slow down and sleep for profit in online deadline scheduling
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
| Hi-index | 0.01 |
The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.