A generic approach for the unranking of labeled combinatorial classes (Q2772928): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1002/rsa.10025
@@ Property / full work available at URL: https://doi.org/10.1002/rsa.10025 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1963510333
@@ Property / OpenAlex ID: W1963510333 / rank @@
+Normal rank
@@ Property / cites work @@
+Computer algebra libraries for combinatorial structures
+Normal rank
@@ Property / cites work @@
+A calculus for the random generation of labelled combinatorial structures
+Normal rank
@@ Property / cites work @@
+Solution of a Divide-and-Conquer Maximin Recurrence
+Normal rank
@@ Property / cites work @@
+On Rotations and the Generation of Binary Trees
@@ Property / cites work: On Rotations and the Generation of Binary Trees / rank @@
+Normal rank
@@ Property / cites work @@
+On the Altitude of Nodes in Random Trees
@@ Property / cites work: On the Altitude of Nodes in Random Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4855565
@@ Property / cites work: Q4855565 / rank @@
+Normal rank
@@ Property / cites work @@
+A bernoulli excursion and its various applications
+Normal rank
@@ Property / cites work @@
+Conditional limit theorems for branching processes
+Normal rank
@@ Property / cites work @@
+On a probability problem connected with railway traffic
+Normal rank