The following pages link to (Q3338254):
Displaying 50 items.
- Mutually orthogonal rectangular gerechte designs (Q254879) (← links)
- A conditional frequency distribution test for analyzing \(2 \times c\) tables (Q334077) (← links)
- On \(J_{m}\)-Hadamard matrices (Q556423) (← links)
- Counting matchings in graphs (Q579280) (← links)
- Isols and Burnside's lemma (Q580334) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- \(p\)-competition numbers (Q689960) (← links)
- Linear extension majority cycles on partial orders (Q751946) (← links)
- Tight and loose value automorphisms (Q757409) (← links)
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem (Q872264) (← links)
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays (Q915448) (← links)
- Clique optimization: A method to construct parsimonious ultrametric trees from similarity data (Q923556) (← links)
- 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class (Q963062) (← links)
- Space-filling curves in adaptive curvilinear coordinates for computer numerically controlled five-axis machining (Q1025326) (← links)
- On methods for generating random partial orders (Q1085055) (← links)
- What can we hope to accomplish in generalized Ramsey theory ? (Q1092924) (← links)
- Self-routing control algorithms and the passability of random inputs by the base-line network (Q1097236) (← links)
- Who put the ``C'' in A.-T. Vandermonde ? (Q1113883) (← links)
- A reconfiguration algorithm for fault tolerance in a hypercube multiprocessor (Q1117686) (← links)
- Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
- Niche graphs (Q1123204) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- Some chip transfer games (Q1127321) (← links)
- Perron eigenvectors and the symmetric transportation polytope (Q1174689) (← links)
- \((i,j)\) competition graphs (Q1179189) (← links)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- Power series and zeroes of trinomial equations (Q1188302) (← links)
- An application of graph theory to the estimation of bond numbers in crystals (Q1192219) (← links)
- Taylor series solution of the \(M/M/1\) queueing system (Q1208567) (← links)
- Phylogeny numbers (Q1270783) (← links)
- The largest component in a random subgraph of the \(n\)-cycle (Q1309458) (← links)
- No-hole 2-distant colorings (Q1310246) (← links)
- Resistance of balanced s-boxes to linear and differential cryptanalysis (Q1352088) (← links)
- The determinant of a tree's neighborhood matrix (Q1355240) (← links)
- Stochastic token theory (Q1368382) (← links)
- 2-role assignments on triangulated graphs. (Q1401397) (← links)
- Phylogeny numbers for graphs with two triangles (Q1570836) (← links)
- Constraint-directed techniques for scheduling alternative activities (Q1583239) (← links)
- The parameters of bipartite \(Q\)-polynomial distance-regular graphs (Q1604767) (← links)
- \(p\)-competition graphs (Q1805319) (← links)
- Gridline graphs: A review in two dimensions and an extension to higher dimensions (Q1861575) (← links)
- The reversing number of a digraph (Q1894351) (← links)
- Some canonical sequences of integers (Q1899396) (← links)
- Applications of Ramsey theory (Q2266026) (← links)
- A regional Kronecker product and multiple-pair Latin squares (Q2286609) (← links)
- A characterization and hereditary properties for partition graphs (Q2366015) (← links)
- Formulas for counting acyclic digraph Markov equivalence classes (Q2491863) (← links)
- Finite groups with planar subgroup lattices. (Q2494272) (← links)
- Rational linear spaces on hypersurfaces over quasi-algebraically closed fields (Q2514540) (← links)
- Stable matching with special preference patterns (Q3210911) (← links)
