Constant time generation of integer partitions. Yamanaka, K., Kawano, S.I, Kikuchi, Y., & Nakano, S. *IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*, E90-A(5):888--895, 2007. Paper doi abstract bibtex In this paper we give a simple algorithm to generate all partitions of a positive integer n. The problem is one of the basic problems in combinatorics, and has been extensively studied for a long time. Our algorithm generates each partition of a given integer in constant time for each without repetition, while best known algorithm generates each partition in constant time on "average." Also, we propose some algorithms to generate all partitions of an integer with some additional property in constant time. 10.1093/ietfec/e90-a.5.888

@article{ Yamanaka2007,
abstract = {In this paper we give a simple algorithm to generate all partitions of a positive integer n. The problem is one of the basic problems in combinatorics, and has been extensively studied for a long time. Our algorithm generates each partition of a given integer in constant time for each without repetition, while best known algorithm generates each partition in constant time on "average." Also, we propose some algorithms to generate all partitions of an integer with some additional property in constant time. 10.1093/ietfec/e90-a.5.888},
author = {Yamanaka, Katsuhisa and Kawano, Shin-ichiro and Kikuchi, Yosuke and Nakano, Shin-ichi},
doi = {10.1093/ietfec/e90-a.5.888},
issn = {09168508},
journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},
keywords = {Algorithm,Generation,Integer partition,The family tree},
number = {5},
pages = {888--895},
title = {{Constant time generation of integer partitions}},
url = {http://search.ieice.org/bin/summary.php?id=e90-a_5_888\&category=A\&year=2007\&lang=E\&abst=},
volume = {E90-A},
year = {2007}
}

Downloads: 0

{"_id":"ybECMFMMaERdAmg4y","authorIDs":[],"author_short":["Yamanaka, K.","Kawano, S.I","Kikuchi, Y.","Nakano, S."],"bibbaseid":"yamanaka-kawano-kikuchi-nakano-constanttimegenerationofintegerpartitions-2007","bibdata":{"abstract":"In this paper we give a simple algorithm to generate all partitions of a positive integer n. The problem is one of the basic problems in combinatorics, and has been extensively studied for a long time. Our algorithm generates each partition of a given integer in constant time for each without repetition, while best known algorithm generates each partition in constant time on \"average.\" Also, we propose some algorithms to generate all partitions of an integer with some additional property in constant time. 10.1093/ietfec/e90-a.5.888","author":["Yamanaka, Katsuhisa","Kawano, Shin-ichiro","Kikuchi, Yosuke","Nakano, Shin-ichi"],"author_short":["Yamanaka, K.","Kawano, S.I","Kikuchi, Y.","Nakano, S."],"bibtex":"@article{ Yamanaka2007,\n abstract = {In this paper we give a simple algorithm to generate all partitions of a positive integer n. The problem is one of the basic problems in combinatorics, and has been extensively studied for a long time. Our algorithm generates each partition of a given integer in constant time for each without repetition, while best known algorithm generates each partition in constant time on \"average.\" Also, we propose some algorithms to generate all partitions of an integer with some additional property in constant time. 10.1093/ietfec/e90-a.5.888},\n author = {Yamanaka, Katsuhisa and Kawano, Shin-ichiro and Kikuchi, Yosuke and Nakano, Shin-ichi},\n doi = {10.1093/ietfec/e90-a.5.888},\n issn = {09168508},\n journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences},\n keywords = {Algorithm,Generation,Integer partition,The family tree},\n number = {5},\n pages = {888--895},\n title = {{Constant time generation of integer partitions}},\n url = {http://search.ieice.org/bin/summary.php?id=e90-a_5_888\\&category=A\\&year=2007\\&lang=E\\&abst=},\n volume = {E90-A},\n year = {2007}\n}","bibtype":"article","doi":"10.1093/ietfec/e90-a.5.888","id":"Yamanaka2007","issn":"09168508","journal":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","key":"Yamanaka2007","keywords":"Algorithm,Generation,Integer partition,The family tree","number":"5","pages":"888--895","title":"Constant time generation of integer partitions","type":"article","url":"http://search.ieice.org/bin/summary.php?id=e90-a_5_888\\&category=A\\&year=2007\\&lang=E\\&abst=","volume":"E90-A","year":"2007","bibbaseid":"yamanaka-kawano-kikuchi-nakano-constanttimegenerationofintegerpartitions-2007","role":"author","urls":{"Paper":"http://search.ieice.org/bin/summary.php?id=e90-a_5_888\\&category=A\\&year=2007\\&lang=E\\&abst="},"keyword":["Algorithm","Generation","Integer partition","The family tree"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.439Z","downloads":0,"keywords":["algorithm","generation","integer partition","the family tree"],"search_terms":["constant","time","generation","integer","partitions","yamanaka","kawano","kikuchi","nakano"],"title":"Constant time generation of integer partitions","year":2007,"dataSources":["YRMeqhMHoNu9HzJoC"]}