@inproceedings{221a5003ed634adb86c77cb192670347,

title = "Towards the Succinct Representation of m Out of n",

abstract = "Combinations of n objects taken m at the time are ubiquitous in a wide range of combinatorial problems. In this paper, we introduce a novel approach to generate combinations from given integer numbers by using a gradient-based algorithm through plural number of CPU and GPU processors. The time complexity is bounded by O(m2) when using a single processor, and bounded by O(mlog m) when using at most O(m/ log m) processors. Relevant computational experiments confirmed the practical efficiency within computationally allowable limits. Our approach offers the building blocks to represent combinations with succinct encoding and complexity being independent of n, which is meritorious when n is very large, or when n is time-varying.",

keywords = "Combinations, Complexity, Optimization, Parallel computing, Representation, Unranking",

author = "Victor Parque and Tomoyuki Miyashita",

note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; 11th International Conference on Internet and Distributed Computing Systems, IDCS 2018 ; Conference date: 11-10-2018 Through 13-10-2018",

year = "2018",

doi = "10.1007/978-3-030-02738-4_2",

language = "English",

isbn = "9783030027377",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "16--26",

editor = "Antonio Guerrieri and Jung, {Jason J.} and Giancarlo Fortino and Jingtao Sun and Yang Xiang",

booktitle = "Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings",

}