This paper provides the first exact analysis of a preemptive M/M/c queue with two priority classes having different service rates. To perform our analysis, we introduce a new technique to reduce the ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real ...

The M/G/c queue is separately treated. Two imposed prerequisites, that only minimal prior information about the queue will be required and that no numeric method be needed other than a root-finding ...