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

Podrobná bibliografia

Vydané v:	2018 International Conference on Information Technology (ICIT) s. 120 - 125
Hlavní autori:	Koganti, Hemasree, Yijie, Han
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2018
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!