Pages that link to "Item:Q1214419"
From MaRDI portal
The following pages link to A method and two algorithms on the theory of partitions (Q1214419):
Displaying 50 items.
- Multivariate Poisson interpoint distances (Q273791) (← links)
- Boltzmann samplers for \(v\)-balanced cycles (Q391394) (← links)
- A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem (Q582208) (← links)
- On the computational complexity of path cover problems (Q799105) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- Families of prudent self-avoiding walks (Q965213) (← links)
- Enumeration and random generation of accessible automata (Q995562) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- On permutations of wires and states (Q1064313) (← links)
- On combinatorial differential equations (Q1090823) (← links)
- Calculation of the probability of eventual ruin by Beekman's convolution series (Q1115077) (← links)
- The enumeration of connected graphs and linked diagrams (Q1132893) (← links)
- Lexicographic permutations with restrictions (Q1133901) (← links)
- On the measurement of complexity in activity networks (Q1145062) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- A solution of the Sperner-Erdős problem (Q1171500) (← links)
- Tours for the traveling salesman (Q1181042) (← links)
- A loopless algorithm for generating binary tree sequences (Q1182098) (← links)
- Generating permutations with given ups and downs (Q1186163) (← links)
- Computing structure: Sets, structures, and invariants in LISP (Q1192167) (← links)
- A method and two algorithms on the theory of partitions (Q1214419) (← links)
- Partial products in finite groups (Q1232458) (← links)
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects (Q1236548) (← links)
- A probabilistic proof of a formula for the number of Young tableaux of a given shape (Q1254319) (← links)
- An algorithm for the most economic link addition in a tree communications network (Q1259541) (← links)
- A pentagonal number sieve (Q1268625) (← links)
- Random generation of trees and other combinatorial objects (Q1292293) (← links)
- Uniform random generation of decomposable structures using floating-point arithmetic (Q1292294) (← links)
- Uniform generation of forests of restricted height (Q1330666) (← links)
- A calculus for the random generation of labelled combinatorial structures (Q1334654) (← links)
- The Hamiltonicity of directed \(\sigma\)-\(\tau\) Cayley graphs (Or: A tale of backtracking) (Q1345967) (← links)
- Combinatorial structures and structures for classification (Q1350822) (← links)
- Recent developments and problems in the domain of random generation (Q1351205) (← links)
- Uniform random generation of words of rational languages (Q1351211) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Chromatic polynomials and order ideals of monomials (Q1584366) (← links)
- Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer (Q1679226) (← links)
- Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method (Q1687781) (← links)
- Extended boxed product and application to synchronized trees (Q1687792) (← links)
- Matrix permanent inequalities for approximating joint assignment matrices in tracking systems (Q1771051) (← links)
- Generating random binary trees -- a survey (Q1818783) (← links)
- Algorithms for sequential generation of combinatorial structures (Q1822996) (← links)
- Sieve equivalence in generalized partition theory (Q1835671) (← links)
- Algorithms for the Chinese postman problem on mixed networks (Q1894723) (← links)
- Random and uniform generation of words (Q1917516) (← links)
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey (Q1923505) (← links)
- On sampling representatives of relational schemas with a functional dependency (Q2103897) (← links)
- A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space (Q2120961) (← links)
- On coding labeled trees (Q2381521) (← links)
- Probabilistic divide-and-conquer: deterministic second half (Q2407388) (← links)
