Sort Integers into a Linked List
We show that n integers in {0, 1, …, m-1} can be sorted into a linked list in constant time using nlogm processors on the Priority CRCW PRAM model, and they can be sorted into a linked list in O(loglogm/logt) time using nt processors on the Priority CRCW PRAM model.
2021 ◽
Vol 10
(2)
◽
1994 ◽
Vol 04
(04)
◽
pp. 437-445
◽
Keyword(s):
1995 ◽
Vol 05
(03)
◽
pp. 273-288
◽
Keyword(s):
2003 ◽
Vol 14
(10)
◽
pp. 973-982
◽
Keyword(s):
1999 ◽
Vol 10
(01)
◽
pp. 19-31
◽
Keyword(s):
Keyword(s):
2007 ◽
Vol 17
(02)
◽
pp. 153-168
◽
Keyword(s):