{"updated":"2025-01-22T03:26:06.501113+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00059782","sets":["5471:5490:5493"]},"path":["5493"],"owner":"1","recid":"59782","title":["Roughly Sorting: Sequential and Parallel Approach"],"pubdate":{"attribute_name":"公開日","attribute_value":"1989-08-25"},"_buckets":{"deposit":"57b7e328-95b0-4999-9473-94d0cc1cb806"},"_deposit":{"id":"59782","pid":{"type":"depid","value":"59782","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"Roughly Sorting: Sequential and Parallel Approach","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Roughly Sorting: Sequential and Parallel Approach"},{"subitem_title":"Roughly Sorting: Sequential and Parallel Approach","subitem_title_language":"en"}]},"item_type_id":"5","publish_date":"1989-08-25","item_5_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science  University of Kentucky"},{"subitem_text_value":"Department of Computer Science  Gunma University"}]},"item_5_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, University of Kentucky","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, Gunma University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/59782/files/IPSJ-JIP1202006.pdf"},"date":[{"dateType":"Available","dateValue":"1991-08-25"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-JIP1202006.pdf","filesize":[{"value":"545.2 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"5"},{"tax":["include_tax"],"price":"0","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"e095ad29-005c-4648-b0e2-d528aaa98cb5","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1989 by the Information Processing Society of Japan"}]},"item_5_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tom, Altman"},{"creatorName":"Yoshihide, Igarashi"}],"nameIdentifiers":[{}]}]},"item_5_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Tom, Altman","creatorNameLang":"en"},{"creatorName":"Yoshihide, Igarashi","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_5_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA00700121","subitem_source_identifier_type":"NCID"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_6501","resourcetype":"journal article"}]},"item_5_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1882-6652","subitem_source_identifier_type":"ISSN"}]},"item_5_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We study sequential and parallel algorithms on roughly sorted sequences. A sequence a = (a_l  a_2  . . .   a_n) is k-sorted if for all 1&les;i j&les;n i<j- k implies a_i&les;a_j. We first show a real-time algorithm for determining if a given sequence is k-sorted and an O(n)-time algorithm for finding the smallest k for a given sequence to be k-sorted. Next  we give two sequential algorithms that merge two k-sorted sequences to form a k-sorted sequence and completely sort a k-sorted sequence. Their running times are O(n) and O(n log k)  respectively. Finally  parallel versions of the complete-sorting algorithm are presented. Their parallel running times are O(f(2k) 1og k)  where f(t) is the computing time of an algorithm used for finding the median among t elements.","subitem_description_type":"Other"}]},"item_5_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We study sequential and parallel algorithms on roughly sorted sequences. A sequence a = (a_l, a_2, . . . , a_n) is k-sorted if for all 1&les;i,j&les;n,i<j- k implies a_i&les;a_j. We first show a real-time algorithm for determining if a given sequence is k-sorted and an O(n)-time algorithm for finding the smallest k for a given sequence to be k-sorted. Next, we give two sequential algorithms that merge two k-sorted sequences to form a k-sorted sequence and completely sort a k-sorted sequence. Their running times are O(n) and O(n log k), respectively. Finally, parallel versions of the complete-sorting algorithm are presented. Their parallel running times are O(f(2k) 1og k), where f(t) is the computing time of an algorithm used for finding the median among t elements.","subitem_description_type":"Other"}]},"item_5_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"158","bibliographic_titles":[{"bibliographic_title":"Journal of Information Processing "}],"bibliographicPageStart":"154","bibliographicIssueDates":{"bibliographicIssueDate":"1989-08-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"2","bibliographicVolumeNumber":"12"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"created":"2025-01-18T23:22:29.104427+00:00","id":59782,"links":{}}