The following pages link to Esko Ukkonen (Q294883):
Displaying 32 items.
- The equivalence problem for some non-real-time deterministic pushdown automata (Q3951577) (← links)
- Approximate Boyer–Moore String Matching (Q4032935) (← links)
- (Q4035246) (← links)
- (Q4136590) (← links)
- (Q4168089) (← links)
- (Q4185829) (← links)
- (Q4190163) (← links)
- An analysis of the effect of rounding errors on the flow of control in numerical processes (Q4192895) (← links)
- (Q4410142) (← links)
- (Q4413212) (← links)
- (Q4413809) (← links)
- (Q4418649) (← links)
- (Q4536411) (← links)
- (Q4547735) (← links)
- (Q4721668) (← links)
- (Q4725747) (← links)
- (Q4737694) (← links)
- (Q4737703) (← links)
- (Q4782748) (← links)
- (Q4858448) (← links)
- Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time (Q4943755) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- Seed-driven Learning of Position Probability Matrices from Large Sequence Sets. (Q5111835) (← links)
- (Q5456817) (← links)
- Implementation and Application of Automata (Q5464004) (← links)
- Algorithmic Learning Theory (Q5464521) (← links)
- Transposition invariant string matching (Q5692274) (← links)
- Computational Science - ICCS 2004 (Q5712870) (← links)
- Theory Is Forever (Q5894874) (← links)
- Implementation and Application of Automata (Q5897686) (← links)
- Sparse suffix trees (Q6184666) (← links)
- Discovering unbounded unions of regular pattern languages from positive examples (Q6487429) (← links)