{"id":{"repo_id":"umkc","oai_identifier":"oai:mospace.umsystem.edu:10355/68848"},"canonical_url":"https://search.dev.ndltd.org/etd/umkc/oai:mospace.umsystem.edu:10355/68848","repository":{"repo_id":"umkc","name":"University of Missouri - Kansas City","base_url":"https://mospace.umsystem.edu/oai/request"},"display":{"title":"Searching in a Sorted Linked List and Sort Integers into a Linked List","abstract":"The research work consists of two parts. Part one is about Searching for an integer in a sorted Linked list. 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 constructed, for any given integer we can find the predecessor and successor of the integer, insert or delete the integer in O(loglogm) time. The 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. Part two is on sorting integers into a linked list. There are various best algorithms for sorting integers. The current research work applies the recent important results of sorting integers in Ω(logn/loglogn) time. This algorithm takes “constant time” to sort integers into a linked list with nlogm processors and O(loglogm/logt) time using nt processors on the Priority CRCW PRAM model.","abstract_html":"The research work consists of two parts. Part one is about Searching for an integer in a sorted Linked list. 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 constructed, for any given integer we can find the predecessor and successor of the integer, insert or delete the integer in O(loglogm) time. The 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. Part two is on sorting integers into a linked list. There are various best algorithms for sorting integers. The current research work applies the recent important results of sorting integers in Ω(logn/loglogn) time. This algorithm takes “constant time” to sort integers into a linked list with nlogm processors and O(loglogm/logt) time using nt processors on the Priority CRCW PRAM model.","abstract_has_math":false,"creators":["Koganti, Hemasree"],"institution":"University of Missouri -- Kansas City","degree_name":"M.S. (Master of Science)","degree_level":"Masters","degree_discipline":"Computer Science (UMKC)","degree_department":null,"school":null,"contributors":[],"advisors":["Han, Yijie, 1959-"],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019","date_published":"2019","updated_at":"2026-07-24T05:19:40Z","subjects":[],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10355/68848","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Han, Yijie, 1959-"]},{"key":"dc:creator","label":"Author","values":["Koganti, Hemasree"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-06-04T16:20:53Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-06-04T16:20:53Z"]},{"key":"dc:date.issued","label":"Date","values":["2019"]},{"key":"dc:publisher","label":"Institution","values":["University of Missouri -- Kansas City"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science (UMKC)"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S. (Master of Science)"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Missouri--Kansas City"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10355/68848"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Title from PDF of title page viewed June 12, 2019","Thesis advisor: Yijie Han","Vita","Includes bibliographical references (pages 25-27)","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2019"]},{"key":"dc:description.abstract","label":"Abstract","values":["The research work consists of two parts. Part one is about Searching for an integer in a sorted Linked list. 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 constructed, for any given integer we can find the predecessor and successor of the integer, insert or delete the integer in O(loglogm) time. The 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. Part two is on sorting integers into a linked list. There are various best algorithms for sorting integers. The current research work applies the recent important results of sorting integers in Ω(logn/loglogn) time. This algorithm takes “constant time” to sort integers into a linked list with nlogm processors and O(loglogm/logt) time using nt processors on the Priority CRCW PRAM model."]},{"key":"dc:title","label":"Title","values":["Searching in a Sorted Linked List and Sort Integers into a Linked List"]}]}],"canonical_facts":{"dc:contributor.advisor":["Han, Yijie, 1959-"],"dc:creator":["Koganti, Hemasree"],"dc:date.accessioned":["2019-06-04T16:20:53Z"],"dc:date.available":["2019-06-04T16:20:53Z"],"dc:date.issued":["2019"],"dc:description":["Title from PDF of title page viewed June 12, 2019","Thesis advisor: Yijie Han","Vita","Includes bibliographical references (pages 25-27)","Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2019"],"dc:description.abstract":["The research work consists of two parts. Part one is about Searching for an integer in a sorted Linked list. 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 constructed, for any given integer we can find the predecessor and successor of the integer, insert or delete the integer in O(loglogm) time. The 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. Part two is on sorting integers into a linked list. There are various best algorithms for sorting integers. The current research work applies the recent important results of sorting integers in Ω(logn/loglogn) time. This algorithm takes “constant time” to sort integers into a linked list with nlogm processors and O(loglogm/logt) time using nt processors on the Priority CRCW PRAM model."],"dc:identifier.uri":["https://hdl.handle.net/10355/68848"],"dc:language.iso":["en_US"],"dc:publisher":["University of Missouri -- Kansas City"],"dc:title":["Searching in a Sorted Linked List and Sort Integers into a Linked List"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science (UMKC)"],"thesis:degree_level":["Masters"],"thesis:degree_name":["M.S. (Master of Science)"],"thesis:institution_name":["University of Missouri--Kansas City"]},"updated_at":"2026-07-24T05:19:40Z"}