{"created":"2021-03-01T05:52:07.568507+00:00","id":385,"links":{},"metadata":{"_buckets":{"deposit":"2b239ee6-27bc-4480-b729-b8d8ff5cf1b3"},"_deposit":{"id":"385","owners":[],"pid":{"revision_id":0,"type":"depid","value":"385"},"status":"published"},"_oai":{"id":"oai:repository.nii.ac.jp:00000385","sets":["136"]},"author_link":[],"control_number":"385","item_5_biblio_info_30":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2003-04-08","bibliographicIssueDateType":"Issued"},"bibliographicPageEnd":"11","bibliographicPageStart":"1","bibliographic_titles":[{"bibliographic_title":"NIIテクニカル・レポート","bibliographic_titleLang":"ja"},{"bibliographic_title":"NII Technical Report","bibliographic_titleLang":"en"}]}]},"item_5_description_28":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Enumeration and generation algorithms are for outputting all the elements of a given set just once for each. There have been numerous studies on developing algorithms for various problems. One goal of this research is to derive exact constant time algorithms, where the computation time between any two consecutive outputs is constant. Although there are many amortized constant time algorithms, there are only few exact constant time algorithms in the literature. In this paper, we give simple ways to improve these algorithms so that they become exact constant time algorithms.","subitem_description_language":"en","subitem_description_type":"Abstract"}]},"item_5_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.20736/0000000385","subitem_identifier_reg_type":"JaLC"}]},"item_5_publisher_31":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"国立情報学研究所","subitem_publisher_language":"ja"}]},"item_5_source_id_32":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"1346-5597","subitem_source_identifier_type":"ISSN"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"宇野, 毅明","creatorNameLang":"ja"},{"creatorName":"Uno, Takeaki","creatorNameLang":"en"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2015-08-27"}],"displaytype":"detail","filename":"03-004E.pdf","filesize":[{"value":"133.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"NII Technical Report (NII-2003-004E)：Two General Methods to Reduce Delay and Change of Enumeration Algorithms","url":"https://repository.nii.ac.jp/record/385/files/03-004E.pdf"},"version_id":"a8b89370-51fa-4e6e-a8b4-a3ce998394a5"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"テクニカルレポート","subitem_subject_language":"ja","subitem_subject_scheme":"Other"},{"subitem_subject":"Technical Report","subitem_subject_language":"en","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"NII Technical Report (NII-2003-004E)：Two General Methods to Reduce Delay and Change of Enumeration Algorithms","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"NII Technical Report (NII-2003-004E)：Two General Methods to Reduce Delay and Change of Enumeration Algorithms","subitem_title_language":"en"}]},"item_type_id":"5","owner":"1","path":["136"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2003-04-08"},"publish_date":"2003-04-08","publish_status":"0","recid":"385","relation_version_is_last":true,"title":["NII Technical Report (NII-2003-004E)：Two General Methods to Reduce Delay and Change of Enumeration Algorithms"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2022-12-27T01:15:23.728302+00:00"}