{"created":"2025-01-18T23:01:35.834946+00:00","updated":"2025-01-22T16:07:56.732885+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032532","sets":["1164:2592:2700:2703"]},"path":["2703"],"owner":"1","recid":"32532","title":["対称ヒープの実現とその応用"],"pubdate":{"attribute_name":"公開日","attribute_value":"1992-07-17"},"_buckets":{"deposit":"b08d7781-20fc-4cc6-a760-ec1415205846"},"_deposit":{"id":"32532","pid":{"type":"depid","value":"32532","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"対称ヒープの実現とその応用","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"対称ヒープの実現とその応用"},{"subitem_title":"IMPLEMENTATION OF SYMMETRIC HEAP AND ITS APPLICATIONS","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1992-07-17","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"早稲田大学理工学部情報学科"},{"subitem_text_value":"早稲田大学理工学部情報学科"},{"subitem_text_value":"早稲田大学理工学部情報学科"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Information and Computer Science School of Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Science School of Science and Engineering, Waseda University","subitem_text_language":"en"},{"subitem_text_value":"Department of Information and Computer Science School of Science and Engineering, Waseda University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"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/32532/files/IPSJ-AL92028007.pdf"},"date":[{"dateType":"Available","dateValue":"1994-07-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL92028007.pdf","filesize":[{"value":"1.1 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"72edb6c9-1f01-43f9-a8f5-5f0581b9c2ed","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1992 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"二村, 夏彦"},{"creatorName":"筧, 捷彦"},{"creatorName":"二村, 良彦"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Natuhiko, Futamura","creatorNameLang":"en"},{"creatorName":"Katuhiko, Kakehi","creatorNameLang":"en"},{"creatorName":"Yoshihiko, Futamura","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"数列に関連しかつ数の大小関係を含む広範囲のプログラム作成問題を分割統治法により解決し易くするために対称ヒープと呼ばれるデーター構造を利用する方法を提案する。まず対称ヒープとは何かを詳しく説明し，かつ与えられた長さnの数列からO（）時間（最良n?1かつ最悪2n?）で対称ヒープを作成するアルゴリズムを示す（ヒープに要するメモリー所要量は3nである）。次に対称ヒープの操作に必要な基本関数およびその計算量を示す。最後に数列に関する6つのプログラム作成問題（そのうち3つは本稿オリジナルと考えられる）を対称ヒープを用いて解決する。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"Solving programming problems using data structures called symmetric heaps is proposed. Symmetric heaps make the classic divide and conquer method easier to apply to a class of problems concerning number sequences. The definition of the heap and an O(n) worst case time (between n-1 and 2n-1) algorithm to generate a symmetric heap from a given sequence of length n is described. Extra memories to implement a heap is 3n pointers. Then, primitive functions on symmetric heaps and their time complexities are presented. Finally, solutions of six programming problems concerning number sequences are shown as example applications of the proposed method. Three of the problems are considered to be originated from this manuscript.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"57","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"49","bibliographicIssueDates":{"bibliographicIssueDate":"1992-07-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"58(1992-AL-028)","bibliographicVolumeNumber":"1992"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32532,"links":{}}