The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)

404 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Processing Data Where It Makes Sense: Enabling In-Memory Computation (2019, background): “ks,RowClone reduces the energyconsumptionbetween 15% and 69%. 5.1.2. Ambit Inadditiontobulkdatamovement,manyapplications trigger bulk bitwise operations, i.e., bitwise operations on large bit vectors [158, 159]. Examples of such applications include bitmap indices [160, 161, 162, 163] andbitwise sca”
Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks (2010, background): “Recall that [14] an n-bit Gray ordering is a total order on the set of the 2n binary n-bit vectors such that any two successive vectors differ in exactly one position.”
Learning a SAT Solver from Single-Bit Supervision (2018, methodology): “…with u sampled at random for each problem from a collection of three unsat cores ranging from three clauses to nine clauses: the unsat core R from Knuth (2015), and the two unsat cores resulting from encoding the pigeonhole principles PP(2, 1) and PP(3, 2).7 We trained our architecture on this…”