5. FCT 1985:
: Space complexity of alternating Turing machines.
Alexander L. Chistov
: Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic.
Paul E. Dunne
: Lower bounds on the complexity of 1-time only branching programs.
: A lower bound on the oscillation complexity of context-free languages.
: Depth efficient transformations of arithmetic into Boolean circuits.
: Statistical testing of finite sequences based on algorithmic complexity.
, Stephan Waack
: Lower bounds for Boolean formulae of depth 3 and the topology of the n-cube (preliminary version).
G. S. Makanin
: On the decidability of the theory of free groups (in Russian).
: The complexity of embedding graphs into binary trees.
: Recent results on continuous ordered algebras.
R. G. Nigmatullin
: Are lower bounds on the complexity lower bounds for universal circuits.
John H. Reif
: Probabilistic algorithms in group theory.
: Parallel time O(log n) recognition of unambiguous CFLs.
: Tree-partite graphs and the complexity of algorithms.
: A quadratic regularity test for non-deleting macro S grammars.
Valery A. Vardanian
: On the length of single dynamic tests for monotone Boolean functions.
: Enumerative combinatorics and algebraic languages.
: On several kinds of space-bounded on-line multicounter automata.
: Iterated linear control and iterated one-turn pushdowns.
: The critical complexity of all (monotone) Boolean functions and monotone graph properties.
: Degeneration of Shimura surfaces and a problem in coding theory.