The following pages link to (Q5585020):
Displaying 50 items.
- Refining binomial confidence intervals (Q136394) (← links)
- Reactive computing as model generation (Q264957) (← links)
- Geometric properties of matrices induced by pattern avoidance (Q265055) (← links)
- XML compression via directed acyclic graphs (Q269349) (← links)
- Pattern restricted Stirling \(k\)-ary words, the plateau statistic and the kernel method (Q277629) (← links)
- The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
- Construction of natural cycletrees (Q286963) (← links)
- Pascal matrices and Stirling numbers (Q289326) (← links)
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication (Q293191) (← links)
- On the richness of the collection of subtrees in random binary search trees (Q293237) (← links)
- Pattern matching for permutations (Q293263) (← links)
- A study on interleaving versus segmentation (Q293277) (← links)
- On fixed priority scheduling, offsets and co-prime task periods (Q293317) (← links)
- Efficient algorithms for the temporal precedence problem (Q293412) (← links)
- A note on the Horton-Strahler number for random binary search trees (Q294608) (← links)
- Generating all the acyclic orientations of an undirected graph (Q294704) (← links)
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- An efficient method to evaluate intersections on big data sets (Q306702) (← links)
- Major index distribution over permutation classes (Q308984) (← links)
- The parallel stack loading problem to minimize blockages (Q321007) (← links)
- An elementary solution of Gessel's walks in the quadrant (Q323719) (← links)
- Permutations sortable by two stacks in series (Q343835) (← links)
- Coarse synchronization of UWB signals in the dense multipath channel based on the golden section (Q357932) (← links)
- Stability and performance of greedy server systems (Q383183) (← links)
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials (Q384775) (← links)
- Enumeration of permutations by number of alternating runs (Q385736) (← links)
- Upward planar drawings on the standing and the rolling cylinders (Q390362) (← links)
- Lyndon words and Fibonacci numbers (Q392802) (← links)
- The Dyck pattern poset (Q394536) (← links)
- Random cyclations (Q396919) (← links)
- The shape of random pattern-avoiding permutations (Q401507) (← links)
- Computing the extensions of preinjective and preprojective Kronecker modules. (Q402709) (← links)
- The Magnus expansion, trees and Knuth's rotation correspondence (Q404248) (← links)
- Equivalence classes of permutations modulo replacements between 123 and two-integer patterns (Q405257) (← links)
- The maximal length of a \(k\)-separator permutation (Q405306) (← links)
- A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
- Record statistics in a random composition (Q412369) (← links)
- Inference on power law spatial trends (Q418245) (← links)
- A direct calculation of moments of the sample variance (Q419424) (← links)
- A sparse octree gravitational \(N\)-body code that runs entirely on the GPU processor (Q419652) (← links)
- Maxima-finding algorithms for multidimensional samples: A two-phase approach (Q425621) (← links)
- On the computing time of the continued fractions method (Q438690) (← links)
- A method of formalizing computer operations for solving nonlinear differential equations (Q440669) (← links)
- An explicit formula for the number of permutations with a given number of alternating runs (Q444901) (← links)
- A (probably) exact solution to the birthday problem (Q454354) (← links)
- Computing elliptic curve discrete logarithms with the negation map (Q454851) (← links)
- Efficient processing of probabilistic set-containment queries on uncertain set-valued data (Q454921) (← links)
- Topological ordering algorithm for LDAG (Q456140) (← links)
