Pages that link to "Item:Q2542990"
From MaRDI portal
The following pages link to On the computational power of pushdown automata (Q2542990):
Displayed 16 items.
- A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers (Q272196) (← links)
- The incremental maintenance of a depth-first-search tree in directed acyclic graphs (Q286984) (← links)
- A tight bound for approximating the square root (Q287183) (← links)
- Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint (Q287196) (← links)
- K-M-P string matching revisited (Q293129) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- An optimal \(O(N^{2})\) algorithm for computing the min-transitive closure of a weighted graph (Q294772) (← links)
- Even faster integer multiplication (Q306687) (← links)
- The derivational complexity of string rewriting systems (Q441853) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Simultaneous modular reduction and Kronecker substitution for small finite fields (Q540334) (← links)
- A note on detecting simple redundancies in linear systems (Q579125) (← links)
- Minimizing the density of terminal assignments in layout design (Q581242) (← links)
- Fast computation of divided differences and parallel Hermite interpolation (Q581992) (← links)
- String-matching with OBDDs (Q596086) (← links)