1. Time and tape complexity of pushdown automaton languages
2. Visibly pushdown languages
3. Vladimir L'vovich Arlazarov , Yefim A Dinitz , MA Kronrod , and IgorAleksandrovich Faradzhev . 1970 . On economical construction of the transitive closure of an oriented graph . In Doklady Akademii Nauk , Vol. 194 . Russian Academy of Sciences, 487--488. Vladimir L'vovich Arlazarov, Yefim A Dinitz, MA Kronrod, and IgorAleksandrovich Faradzhev. 1970. On economical construction of the transitive closure of an oriented graph. In Doklady Akademii Nauk, Vol. 194. Russian Academy of Sciences, 487--488.
4. Robert S. Arnold . 1996. Software Change Impact Analysis . IEEE Computer Society Press , Los Alamitos, CA, USA . Robert S. Arnold. 1996. Software Change Impact Analysis. IEEE Computer Society Press, Los Alamitos, CA, USA.
5. A complement to Tarjan's result about the lower bound on the complexity of the set union problem