Volker Diekert Word Problems Over Traces which are Solvable in Linear Time. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:74, n:1, pp:3-18 [Journal]
Petr Jancar Decidability of a Temporal Logic Problem for Petri Nets. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:74, n:1, pp:71-93 [Journal]
Andrzej Szepietowski If Deterministic and Nondeterministic Space Complexities are Equal for log log n, then they are also Equal for log n. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:74, n:1, pp:115-119 [Journal]
Paul Gastin Un Modèle Asynchrone pour les Systèmes Distribués. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1990, v:74, n:1, pp:121-162 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP