The following pages link to Combinatorica (Q168579):
Displaying 50 items.
- The monotone circuit complexity of Boolean functions (Q1094870) (← links)
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) (Q1095149) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (Q1097640) (← links)
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes (Q1097884) (← links)
- Almost linear upper bounds on the length of general Davenport-Schinzel sequences (Q1097885) (← links)
- Expanders obtained from affine transformations (Q1098859) (← links)
- An algorithm for finding Hamilton paths and cycles in random graphs (Q1099190) (← links)
- Finding a small 3-connected minor maintaining a fixed minor and a fixed element (Q1100209) (← links)
- Families of finite sets with minimum shadows (Q1100465) (← links)
- Clique covering of graphs (Q1100482) (← links)
- Matrices with the Edmonds-Johnson property (Q1100483) (← links)
- One way functions and pseudorandom generators (Q1100894) (← links)
- The average-case analysis of some on-line algorithms for bin packing (Q1100912) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- An application of simultaneous diophantine approximation in combinatorial optimization (Q1101013) (← links)
- Subgraphs of colour-critical graphs (Q1101121) (← links)
- Directed cut transversal packing for source-sink connected graphs (Q1101126) (← links)
- Packing and covering a tree by subtrees (Q1101129) (← links)
- The Schrijver system of odd join polyhedra (Q1101352) (← links)
- Finite projective spaces and intersecting hypergraphs (Q1101456) (← links)
- Small topological complete subgraphs of ``dense'' graphs (Q1101464) (← links)
- A problem of Erdős on Abelian groups (Q1101829) (← links)
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253) (← links)
- On a problem of Erdős concerning property B (Q1102961) (← links)
- On the non-existence of Barker sequences (Q1103627) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- A Las Vegas RNC algorithm for maximum matching (Q1103637) (← links)
- Constructing a perfect matching is in random NC (Q1103639) (← links)
- Covering graphs by the minimum number of equivalence relations (Q1103644) (← links)
- On submodular function minimization (Q1104332) (← links)
- On well-quasi-ordering-finite graphs by immersion (Q1104345) (← links)
- A random NC algorithm for depth first search (Q1104756) (← links)
- Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances (Q1104935) (← links)
- Threshold functions (Q1104940) (← links)
- Expose-and-merge exploration and the chromatic number of a random graph (Q1104942) (← links)
- Optima of dual integer linear programs (Q1105488) (← links)
- A completion problem for finite affine planes (Q1105611) (← links)
- The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem (Q1106221) (← links)
- Some intersection theorems on two-valued functions (Q1106236) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- A local characterization of the Johnson scheme (Q1107538) (← links)
- Dual vectors and lower bounds for the nearest lattice point problem (Q1107568) (← links)
- On a lattice point problem of L. Moser. I (Q1107572) (← links)
- Quasi-symmetric 2,3,4-designs (Q1109036) (← links)
- An extension of the Erdős-Szekeres theorem on large angles (Q1109334) (← links)
- Limit theorem concerning random mapping patterns (Q1110176) (← links)
- On multiplicative graphs and the product conjecture (Q1110530) (← links)
- Bounding the diameter of distance. Regular graphs (Q1110534) (← links)
- A lower bound on strictly non-blocking networks (Q1111529) (← links)
