- Location
-
Bayerische Staatsbibliothek
- Extent
-
1 Online-Ressource (25 Seiten)
- Language
-
Englisch
- Notes
-
Ill., graph. Darst.
- Event
-
Veröffentlichung
- (where)
-
New York, NY
- (who)
-
Assoc. for Computing Machinery
- (when)
-
2000
- Creator
- URN
-
urn:nbn:de:bvb:12-bsb00084151-1
- Last update
-
16.04.2025, 8:49 AM CEST
Data provider
This object is provided by:
Bayerische Staatsbibliothek. If you have any questions about the object, please contact the data provider.
Bayerische Staatsbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Sanders, Peter
- Assoc. for Computing Machinery
Time of origin
- 2000
Other Objects (12)
Radix heaps, an efficient implementation for priority queues
Provision of deterministic services for voice over IP using priority queues
Practical memory checkers for stacks, queues and deques
Priority Auctions and Queue Disciplines that Depend on Processing Time
What money can't buy: allocations with priority lists, lotteries and queues
The Slow Server Problem: A Queue with Stalling
A queue for the commons
Big queues
Spatial queues
Priority for the referral of labor
Concurrent data structures: Fast and Space-Efficient Queues via Relaxation
The queue habit
Radix heaps, an efficient implementation for priority queues
Provision of deterministic services for voice over IP using priority queues
Practical memory checkers for stacks, queues and deques
Priority Auctions and Queue Disciplines that Depend on Processing Time
What money can't buy: allocations with priority lists, lotteries and queues
The Slow Server Problem: A Queue with Stalling
A queue for the commons
Big queues
Spatial queues
Priority for the referral of labor
Concurrent data structures: Fast and Space-Efficient Queues via Relaxation
The queue habit
Radix heaps, an efficient implementation for priority queues
Provision of deterministic services for voice over IP using priority queues
Practical memory checkers for stacks, queues and deques
Priority Auctions and Queue Disciplines that Depend on Processing Time
What money can't buy: allocations with priority lists, lotteries and queues
The Slow Server Problem: A Queue with Stalling
A queue for the commons
Big queues
Spatial queues
Priority for the referral of labor
Concurrent data structures: Fast and Space-Efficient Queues via Relaxation