Permuting machines and priority queues
نویسندگان
چکیده
منابع مشابه
Permuting machines and priority queues
Machines whose sole function is to re-order their input data are considered. Every such machine defines a set of allowable input-output pairs of permutations. These sets are studied in terms of the minimal disallowed pairs (the basis). Some allowable sets with small bases are considered including the one defined by a priority queue machine. For more complex machines defined by two or more prior...
متن کاملPriority Queues on Parallel Machines
We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one proces-and DecreaseKey in constant time with O(log n) processors. A priority queue can be build in time O(log n) with O(n= log n) processors and k elements can be inserted into a priority queue in time O(log k) with O((log n + k)= log k) processors. With a slowdown of O(log log n) in...
متن کاملPriority Queues and Multisets
A priority queue, a container data structure equipped with the operations insert and delete-minimum, can re-order its input in various ways, depending both on the input and on the sequence of operations used. If a given input σ can produce a particular output τ then (σ, τ) is said to be an allowable pair. It is shown that allowable pairs on a fixed multiset are in one-to-one correspondence with...
متن کاملPattern classes and priority queues
When a set of permutations comprising a pattern class C is submitted as input to a priority queue the resulting output is again a pattern class C′. The basis of C′ is determined for pattern classes C whose basis elements have length 3, and is finite in these cases. An example is given of a class C with basis {2431} for which C′ is not finitely based. Mathematics Subject Classification: 05A05, 6...
متن کاملTime Dependent Priority Queues
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.07.039