Sven Skyum
According to our database^{1}, Sven Skyum
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at www.brics.dk
On csauthors.net:
Bibliography
2014
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014
2012
To Dexter  A Tribute from Aarhus.
Proceedings of the Logic and Program Semantics, 2012
1999
The Complexity of Identifying Large Equivalence Classes.
Fundam. Inform., 1999
On Monotone Planar Circuits.
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999
1998
Searching Constant Width Mazes Captures the AC^{0} Hierarchy.
Proceedings of the STACS 98, 1998
1997
Dynamic word problems.
J. ACM, 1997
Dynamic Maintenance of Majority Information in Constant Time per Update.
Inf. Process. Lett., 1997
Searching constant width mazes captures the AC^{0} hierarchy
Electronic Colloquium on Computational Complexity (ECCC), 1997
1994
Guest Editor's Foreword.
Nord. J. Comput., 1994
1993
The Complexity of Finding Replicas Using Equality Tests.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993
Dynamic Word Problems
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
1991
A Simple Algorithm for Computing the Smallest Enclosing Circle.
Inf. Process. Lett., 1991
1985
A Complexity Theory Based on Boolean Algebra
J. ACM, April, 1985
1984
Families of Fixed Degree Graphs for Processor Interconnection.
IEEE Trans. Computers, 1984
1983
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
1982
The Copying Power of OneState Tree Transducers.
J. Comput. Syst. Sci., 1982
1981
A Note on the Complexity of General D0L Membership.
SIAM J. Comput., 1981
kvisit Attribute Grammars.
Mathematical Systems 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
A Complexity Theory Based on Boolean Algebra
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1979
Complexity of Some Problems Concerning L Systems.
Mathematical Systems Theory, 1979
1978
On Good ET0L Forms.
Theor. Comput. Sci., 1978
1977
Recognition of Deterministic ETOL Languages in Logarathimic Space
Information and Control, November, 1977
Complexity of Some Problems Concerning L Systems.
Proceedings of the Automata, 1977
1976
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
Copying Theorems.
Inf. Process. Lett., 1976
1975
On Decomposing Languages Defined by Parallel Devices
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975
1974
Parallel ContextFree Languages
Information and Control, November, 1974
On Extensions of ALGOLLike Languages
Information and Control, September, 1974
Nonterminals, Homomorphisms and Codings in Different Variations of OLSystems. I. Deterministic Systems.
Acta Inf., 1974
Nonterminals, Homomorphisms and Codings in Different Variations of OLSystems. II. Nondeterministic Systems.
Acta Inf., 1974
Nonterminals and Codings in Defining Variations of 0LSystems.
Proceedings of the L Systems, 1974