![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Kalorkoti K. Tulley D.H.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.262, Iss.1, 2001-07, pp. : 133-144
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Bounded capacity priority queues
Theoretical Computer Science, Vol. 182, Iss. 1, 1997-08 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Randomized Priority Queues for Fast Parallel Access
By Sanders P.
Journal of Parallel and Distributed Computing, Vol. 49, Iss. 1, 1998-02 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Analyzing priority queues with 3 classes using tree-like processes
Queueing Systems, Vol. 54, Iss. 2, 2006-10 ,pp. :