Clive N. Galley An Omega(log n) time linear cost lower bound for the single function coarsest partition problem. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1995, v:56, n:, pp:- [Journal]
Petr Jancar All action-based behavioural equivalences are undecidable for labelled Petri nets. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1995, v:56, n:, pp:- [Journal]
Alexander Meduna A trivial method of characterizing the family of recursively enumerable languages by scattered context grammars. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1995, v:56, n:, pp:- [Journal]
M. Moshkov Relationships between depth of deterministic and nondeterministic acyclic programs computing functions of k-valued logic. [Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 1995, v:56, n:, pp:- [Journal]