Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
To Dexter - A Tribute from Aarhus.
Proceedings of the Logic and Program Semantics, 2012
The Complexity of Identifying Large Equivalence Classes.
Fundam. Informaticae, 1999
On Monotone Planar Circuits.
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999
Dynamic Maintenance of Majority Information in Constant Time per Update.
Inf. Process. Lett., 1997
Searching constant width mazes captures the AC<sup>0</sup> hierarchy
Electron. Colloquium Comput. Complex., 1997
The Complexity of Finding Replicas Using Equality Tests.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993
A Simple Algorithm for Computing the Smallest Enclosing Circle.
Inf. Process. Lett., 1991
A Complexity Theory Based on Boolean Algebra
J. ACM, April, 1985
Families of Fixed Degree Graphs for Processor Interconnection.
IEEE Trans. Computers, 1984
Fast Parallel Computation of Polynomials Using Few Processors.
SIAM J. Comput., 1983
A Measure in Which Boolean Negation is Exponentially Powerful.
Inf. Process. Lett., 1983
The Copying Power of One-State Tree Transducers.
J. Comput. Syst. Sci., 1982
A Note on the Complexity of General D0L Membership.
SIAM J. Comput., 1981
k-visit Attribute Grammars.
Math. Syst. Theory, 1981
Fast Parallel Computation of Polynomials Using Few Processes.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981
Complexity of Some Problems Concerning L Systems.
Math. Syst. Theory, 1979
Theor. Comput. Sci., 1978
Recognition of Deterministic ETOL Languages in Logarathimic Space
Inf. Control., November, 1977
A Relationship between ET0L and EDT0L Languages.
Theor. Comput. Sci., 1976
Decomposition Theorems for Various Kinds of Languages Parallel in Nature.
SIAM J. Comput., 1976
Inf. Process. Lett., 1976
On Decomposing Languages Defined by Parallel Devices
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975
Parallel Context-Free Languages
Inf. Control., November, 1974
On Extensions of ALGOL-Like Languages
Inf. Control., September, 1974
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems.
Acta Informatica, 1974
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems.
Acta Informatica, 1974
Nonterminals and Codings in Defining Variations of 0L-Systems.
Proceedings of the L Systems, 1974