publication venue for
- Feasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata.. 16:37-48. 2011
- Computing Quasi Suffix Arrays.. 8:593-606. 2003
- Computing all Repeats Using Suffix Arrays.. 8:579-591. 2003
J. Autom. Lang. Comb.
Journal
- Overview