Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Priority queues with binary priorities

From MaRDI portal
Publication:5958116
Jump to:navigation, search

DOI10.1016/S0304-3975(00)00186-9zbMath0983.68015MaRDI QIDQ5958116

No author found.

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)


zbMATH Keywords

priority queue


Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)





Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Labelled trees and pairs of input--output permutations in priority queues
  • Parking functions, valet functions and priority queues
  • Transforming binary sequences using priority queues
  • Bounded capacity priority queues
  • The permutational power of a priority queue
  • Priority queues
  • Sorting Using Networks of Queues and Stacks




This page was built for publication: Priority queues with binary priorities

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5958116&oldid=12128070"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki