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...

Full description

Bibliographic Details

Published in:	2018 International Conference on Information Technology (ICIT) pp. 120 - 125
Main Authors:	Koganti, Hemasree, Yijie, Han
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2018
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!