{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:33:21Z","timestamp":1772368401664,"version":"3.50.1"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A simple meta-algorithm is provided to efficiently generate a wide variety of combinatorial objects that can be represented by binary strings with a fixed number of 1s. Such objects include: $k$-ary Dyck words, connected unit interval graphs, binary strings lexicographically larger than $\\omega$, those avoiding $10^k$ for fixed $k$, reversible strings and feasible solutions to knapsack problems. Each object requires only a very simple object-specific subroutine (oracle) that plugs into the generic cool-lex framework introduced by Williams.\u00a0\u00a0 The result is that each object can be generated in amortized $O(1)$-time.\u00a0 Moreover, the strings can be listed in either a conventional co-lexicographic order, or in the cool-lex Gray code order. <\/jats:p>","DOI":"10.37236\/2051","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T03:32:05Z","timestamp":1578713525000},"source":"Crossref","is-referenced-by-count":14,"title":["Efficient Oracles for Generating Binary Bubble Languages"],"prefix":"10.37236","volume":"19","author":[{"given":"J.","family":"Sawada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2012,2,23]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i1p42\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v19i1p42\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T22:41:49Z","timestamp":1579300909000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v19i1p42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,23]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2012,2,15]]}},"URL":"https:\/\/doi.org\/10.37236\/2051","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,23]]},"article-number":"P42"}}