scientific article; zbMATH DE number 3403734
From MaRDI portal
Publication:5670175
Cited in
(22)- Searching for gapped palindromes
- On efficient recognition of transductions and relations
- Alternating multihead finite automata
- Partial memoization for obtaining linear time behavior of a 2DPDA
- A note on linear time simulation of deterministic two-way pushdown automata
- Computational complexity of multitape Turing machines and random access machines
- Three one-way heads cannot do string matching
- Refined simulation of multihead automata
- On the language of primitive words
- A simulation result for two-way pushdown automata
- Time bounded random access machines
- A V log V algorithm for isomorphism of triconnected planar graphs
- Dynamic interpolation search revisited
- A practical simulation result for two-way pushdown automata
- Maximally-polyvariant partial evaluation in polynomial time
- Searching for Gapped Palindromes
- scientific article; zbMATH DE number 3576701 (Why is no real title available?)
- Window-accumulated subsequence matching problem is linear
- New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
- Generalizing Cook's transformation to imperative stack programs
- Parallel detection of all palindromes in a string
- The 1982 ACM Turing Award lecture. An overview of computational complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5670175)
