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 and multisets

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

zbMath0852.90075MaRDI QIDQ1909965

Yanyan Li

Publication date: 21 July 1996

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/Volume_2/volume2.html#R24


zbMATH Keywords

priority queueallowable pairs on a fixed multiset


Mathematics Subject Classification ID

Queues and service in operations research (90B22)


Related Items (11)

Permuted composition tableaux, 0-Hecke algebra and labeled binary trees ⋮ Pattern avoidance in poset permutations ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Pattern avoidance of generalized permutations ⋮ Ordered partitions avoiding a permutation pattern of length 3 ⋮ Pattern avoidance in biwords ⋮ Unnamed Item ⋮ Pattern avoidance in compositions and multiset permutations ⋮ Permutations of a multiset avoiding permutations of length 3 ⋮ Parking functions, valet functions and priority queues ⋮ Stack-sorting for Words


Uses Software

  • AXIOM






This page was built for publication: Priority queues and multisets

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