The following pages link to Ernst W. Mayr (Q169355):
Displayed 50 items.
- Inequalities for the number of walks in graphs (Q378237) (← links)
- Memories on Vladimir Gerdt (Q820940) (← links)
- Parallelism and the maximal path problem (Q1098641) (← links)
- Parallel approximation algorithms for bin packing (Q1123807) (← links)
- Persistence of vector replacement systems is decidable (Q1149775) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- On the spanning trees of weighted graphs (Q1204524) (← links)
- Some complexity results for polynomial ideals (Q1296522) (← links)
- Divide-and-conquer algorithms on the hypercube (Q1365934) (← links)
- Projections of vector addition system reachability sets are semilinear (Q1823697) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344) (← links)
- Optimal routing of parentheses on the hypercube (Q1893667) (← links)
- Dimension-dependent bounds for Gröbner bases of polynomial ideals (Q1930154) (← links)
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals (Q1974694) (← links)
- Pipelined parallel prefix computations, and sorting on a pipelined hypercube (Q2365584) (← links)
- Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms (Q2805419) (← links)
- Degree bounds for Gröbner bases of low-dimensional polynomial ideals (Q2946516) (← links)
- Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities (Q2968528) (← links)
- Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes (Q3150270) (← links)
- Efficient Dynamic Embeddings of Binary Trees into Hypercubes (Q3150271) (← links)
- (Q3468890) (← links)
- (Q3477945) (← links)
- (Q3477976) (← links)
- Stability Investigation of a Difference Scheme for Incompressible Navier-Stokes Equations (Q3508472) (← links)
- On the Provably Tight Approximation of Optimal Meshing for Non-convex Regions (Q3511105) (← links)
- An Algorithm for the General Petri Net Reachability Problem (Q3677184) (← links)
- (Q3680870) (← links)
- (Q3731028) (← links)
- Two Processor Scheduling is in $\mathcal{NC}$ (Q3773326) (← links)
- (Q3785968) (← links)
- (Q3798222) (← links)
- The Complexity of the Finite Containment Problem for Petri Nets (Q3912016) (← links)
- (Q3932309) (← links)
- (Q4227324) (← links)
- (Q4227325) (← links)
- (Q4281517) (← links)
- Counting Minimum Weight Spanning Trees (Q4349703) (← links)
- (Q4380159) (← links)
- (Q4536417) (← links)
- (Q4536921) (← links)
- Complexity of Membership Problems of Different Types of Polynomial Ideals (Q4556588) (← links)
- Embedding graphs with bounded treewidth into optimal hypercubes (Q4593926) (← links)
- Efficient Embeddings into Hypercube-like Topologies (Q4811512) (← links)
- (Q4813062) (← links)
- (Q4818838) (← links)
- SCHEDULING INTERVAL ORDERS IN PARALLEL (Q4820141) (← links)
- A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube (Q4876698) (← links)
- On polynomial ideals, their complexity, and applications (Q5055880) (← links)
- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups (Q5055940) (← links)