Sven Skyum

Proceedings of the Logic and Program Semantics, 2012

1999

The Complexity of Identifying Large Equivalence Classes.

[BibT_eX]

[DOI]

Peter G. Binderup

Fundam. Informaticae, 1999

On Monotone Planar Circuits.

[BibT_eX]

[DOI]

David A. Mix Barrington

Chi-Jen Lu

Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999

1997

Dynamic word problems.

[BibT_eX]

[DOI]

J. ACM, 1997

Dynamic Maintenance of Majority Information in Constant Time per Update.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Searching constant width mazes captures the AC<sup>0</sup> hierarchy

[BibT_eX]

[DOI]

David A. Mix Barrington

Chi-Jen Lu

Electron. Colloquium Comput. Complex., 1997

1994

Guest Editor's Foreword.

[BibT_eX]

Nord. J. Comput., 1994

1993

The Complexity of Finding Replicas Using Equality Tests.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1991

A Simple Algorithm for Computing the Smallest Enclosing Circle.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1985

A Complexity Theory Based on Boolean Algebra

[BibT_eX]

[DOI]

Leslie G. Valiant

J. ACM, April, 1985

1984

Families of Fixed Degree Graphs for Processor Interconnection.

[BibT_eX]

[DOI]

Mark Jerrum

IEEE Trans. Computers, 1984

1983

Fast Parallel Computation of Polynomials Using Few Processors.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

A Measure in Which Boolean Negation is Exponentially Powerful.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

1982

The Copying Power of One-State Tree Transducers.

[BibT_eX]

[DOI]

Joost Engelfriet

J. Comput. Syst. Sci., 1982

1981

A Note on the Complexity of General D0L Membership.

[BibT_eX]

[DOI]

Neil D. Jones

SIAM J. Comput., 1981

k-visit Attribute Grammars.

[BibT_eX]

[DOI]

Hanne Riis Nielson

Math. Syst. Theory, 1981

Fast Parallel Computation of Polynomials Using Few Processes.

[BibT_eX]

[DOI]

Leslie G. Valiant

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1979

Complexity of Some Problems Concerning L Systems.

[BibT_eX]

[DOI]

Neil D. Jones

Math. Syst. Theory, 1979

1978

On Good ET0L Forms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

1977

Recognition of Deterministic ETOL Languages in Logarathimic Space

[BibT_eX]

[DOI]

Neil D. Jones

Inf. Control., November, 1977

1976

A Relationship between ET0L and EDT0L Languages.

[BibT_eX]

[DOI]

Andrzej Ehrenfeucht

Grzegorz Rozenberg

Theor. Comput. Sci., 1976

Decomposition Theorems for Various Kinds of Languages Parallel in Nature.

[BibT_eX]

[DOI]

SIAM J. Comput., 1976

Copying Theorems.

[BibT_eX]

[DOI]

Joost Engelfriet

Inf. Process. Lett., 1976

1975

On Decomposing Languages Defined by Parallel Devices

[BibT_eX]

[DOI]

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974

Parallel Context-Free Languages

[BibT_eX]

[DOI]

Inf. Control., November, 1974

On Extensions of ALGOL-Like Languages

[BibT_eX]

[DOI]

Inf. Control., September, 1974

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems.

[BibT_eX]

[DOI]

Acta Informatica, 1974

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems.

[BibT_eX]

[DOI]

Acta Informatica, 1974

Nonterminals and Codings in Defining Variations of 0L-Systems.

[BibT_eX]

[DOI]