Searching in a Sorted Linked List

Let A be the array of n integers in {0, 1, ..., n-1}. A tree is constructed in O(nloglogm/p+loglogm) time with p processors based on the trie with all the given integers. Additional nodes (O(nloglogm) of them) are added to the tree. After the tree is construct we can, for any given integer, find the...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2018 International Conference on Information Technology (ICIT) s. 120 - 125
Hlavní autoři:	Koganti, Hemasree, Yijie, Han
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.12.2018
Témata:	Binary trees bucket sorting CRCW-PRAM algorithm Integer search Phase change random access memory Program processors recursion and linked list Search problems Sorting Urban areas Vegetation
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Let A be the array of n integers in {0, 1, ..., n-1}. A tree is constructed in O(nloglogm/p+loglogm) time with p processors based on the trie with all the given integers. Additional nodes (O(nloglogm) of them) are added to the tree. After the tree is construct we can, for any given integer, find the predecessor and successor of this integer, insert or delete the integer in A in O(loglogm) time. This result demonstrates for the searching purpose we need not to sort the input numbers into a sorted array for this would need at least O(logn/loglogn) time while this algorithm for constructing the tree can run in O(loglogm) time with n processors.
DOI:	10.1109/ICIT.2018.00034