The following pages link to Norbert Blum (Q672726):
Displaying 26 items.
- (Q236673) (redirect page) (← links)
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata (Q672727) (← links)
- More on the power of chain rules in context-free grammars (Q759487) (← links)
- A Boolean function requiring 3n network size (Q794625) (← links)
- Characterization of all optimal networks for a simultaneous computation of AND and NOR (Q796492) (← links)
- A note on the ''parallel computation thesis'' (Q1056537) (← links)
- An \(\Omega (n^{4/3})\) lower bound on the monotone network complexity of the \(n\)-th degree convolution (Q1066118) (← links)
- On the average number of rebalancing operations in weight-balanced trees (Q1140428) (← links)
- On the power of chain rules in context free grammars (Q1168748) (← links)
- A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals (Q1332777) (← links)
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
- On LR(k)-Parsers of Polynomial Size (Q3587436) (← links)
- On Negations in Boolean Networks (Q3644711) (← links)
- (Q3685219) (← links)
- An area-maximum edge length trade-off for VSLI layout (Q3703304) (← links)
- (Q3716970) (← links)
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem (Q3756517) (← links)
- (Q3959449) (← links)
- (Q4038720) (← links)
- (Q4182532) (← links)
- (Q4302467) (← links)
- Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology (Q4485189) (← links)
- Algorithmen und Datenstrukturen (Q4904854) (← links)
- (Q4955250) (← links)
- On locally optimal alignments in genetic sequences (Q5096800) (← links)
- On parsing LL-languages (Q5958724) (← links)
