%0 Journal Article %1 journals/jal/Semba84 %A Semba, Ichiro %D 1984 %J J. Algorithms %K dblp %N 2 %P 281-283 %T An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set 1, 2, ..., n in Lexicographical Order. %U http://dblp.uni-trier.de/db/journals/jal/jal5.html#Semba84 %V 5

@article{journals/jal/Semba84, added-at = {2011-07-01T00:00:00.000+0200}, author = {Semba, Ichiro}, biburl = {https://www.bibsonomy.org/bibtex/2fcab68dc78571042a0df28bd3da85129/dblp}, ee = {http://dx.doi.org/10.1016/0196-6774(84)90031-2}, interhash = {1b77d2f669152f94c9567e24c5d7f3f2}, intrahash = {fcab68dc78571042a0df28bd3da85129}, journal = {J. Algorithms}, keywords = {dblp}, number = 2, pages = {281-283}, timestamp = {2011-07-02T11:38:14.000+0200}, title = {An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order.}, url = {http://dblp.uni-trier.de/db/journals/jal/jal5.html#Semba84}, volume = 5, year = 1984 }