Next:
On the average case
On the average case number of rebalancing operations in weight-balanced trees
More on the power of chain rules in context-free grammars
A boolean function requiring 3
n
network size
Characterization of all Optimal Networks for a Simultaneous Computation of AND and NOR.
An
lower bound on the monotone network complexity of the
n
th
degree convolution
An Area-Maximum Edge Length Trade-off for VLSI Layout
On the single-operation worst-case time complexity of the disjoint set union problem
A lower bound on the single-operation worst-case time complexity of the union-find problem on intervals
An
Implementation of the Standard Method for Minimizing
n
-state Finite Automata
Greibach Normal Form Transformation, Revisited
On Parsing
LL
-Languages
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
About this document ...
Claus Rick
2000-05-10
lower bound on the monotone network complexity of the nth degree convolution
Implementation of the Standard Method for Minimizing n-state Finite Automata