The following pages link to DBLP publication ID (P1635):
Displaying 50 items.
- Does co-NP have short interactive proofs ? (Q1108004) (← links)
- Parallel algorithms for finding Hamilton cycles in random graphs (Q1108039) (← links)
- Random oracles separate PSPACE from the polynomial-time hierarchy (Q1108794) (← links)
- A new system of proof-theoretic ordinal functions (Q1109029) (← links)
- The complexity of facets resolved (Q1109565) (← links)
- How easy is local search? (Q1109573) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- Explanation-based generalisation \(=\) partial evaluation (Q1109580) (← links)
- A predictive demand model for systems planning, using noisy realization theory (Q1109747) (← links)
- The complexity of finding uniform emulations on fixed graphs (Q1110329) (← links)
- Bounding the diameter of distance. Regular graphs (Q1110534) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- A fast algorithm for coloring Meyniel graphs (Q1111563) (← links)
- Is the data encryption standard a group? (Results of cycling experiments on DES) (Q1112006) (← links)
- Probabilistic quantifiers and games (Q1112019) (← links)
- Intersection graphs for families of balls in \(R^n\) (Q1112070) (← links)
- Reliable broadcasts and communication models: tradeoffs and lower bounds (Q1112599) (← links)
- Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley (Q1112824) (← links)
- Ramanujan graphs (Q1112836) (← links)
- Optimal node ranking of trees (Q1113677) (← links)
- Large holes in sparse random graphs (Q1113926) (← links)
- A Prolog technology theorem prover: Implementation by an extended Prolog compiler (Q1114446) (← links)
- On clustering problems with connected optima in Euclidean spaces (Q1116236) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation (Q1116896) (← links)
- Gröbner bases and primary decomposition of polynomial ideals (Q1117277) (← links)
- Multiset theory (Q1117926) (← links)
- A coloring problem related to the Erdős, Faber, Lovasz conjecture (Q1117945) (← links)
- The construction of cubature formulae for a family of integrals: A bifurcation problem (Q1118348) (← links)
- Algorithms for determining relative star height and star height (Q1118420) (← links)
- Simple spectral representations for the M/M/1 queue (Q1119280) (← links)
- Convex sets in graphs. II: Minimal path convexity (Q1120125) (← links)
- Embedding planar graphs in four pages (Q1120582) (← links)
- A trade-off between page number and page width of book embeddings of graphs (Q1120583) (← links)
- A simple way to tell a simple polytope from its graph (Q1120602) (← links)
- A constructive proof of a permutation-based generalization of Sperner's lemma (Q1120843) (← links)
- Observations concerning a public-key cryptosystem based on iterated morphisms (Q1121851) (← links)
- Thue-Morse sequence and p-adic topology for the free monoid (Q1121888) (← links)
- On the thickness and arboricity of a graph (Q1121907) (← links)
- On an installation of Buchberger's algorithm (Q1121950) (← links)
- Morris' tree traversal algorithm reconsidered (Q1122985) (← links)
- On the number of arithmetical operations for finding Fibonacci numbers (Q1123222) (← links)
- Sampling derivatives of probabilities (Q1123526) (← links)
- The Steiner problem with edge lengths 1 and 2 (Q1123630) (← links)
- Degeneracy in infinite horizon optimization (Q1123819) (← links)
- Algorithms for assignment problems on an array processor (Q1124328) (← links)
- Worst-case analysis of the set-union problem with extended backtracking (Q1124334) (← links)
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (Q1124585) (← links)
- Designs from pairs of finite fields. I: A cyclic unital U(6) and other regular Steiner 2-designs (Q1124592) (← links)
- Quick approximation to matrices and applications (Q1125616) (← links)
