Nonterminals and Codings in Defining Variations of 0L-Systems. - Sven Skyum (L Systems, 1974)

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems. - Mogens Nielsen; Grzegorz Rozenberg; Arto Salomaa; Sven Skyum (Acta Informatica, 1974)

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems. - Mogens Nielsen; Grzegorz Rozenberg; Arto Salomaa; Sven Skyum (Acta Informatica, 1974)

On Extensions of ALGOL-Like Languages - Sven Skyum (Inf. Control., 1974)

Parallel Context-Free Languages - Sven Skyum (Inf. Control., 1974)

On Decomposing Languages Defined by Parallel Devices - Sven Skyum (STOC, 1975)

Copying Theorems. - Joost Engelfriet; Sven Skyum (Inf. Process. Lett., 1976)

Decomposition Theorems for Various Kinds of Languages Parallel in Nature. - Sven Skyum (SIAM J. Comput., 1976)

A Relationship between ET0L and EDT0L Languages. - Andrzej Ehrenfeucht; Grzegorz Rozenberg; Sven Skyum (Theor. Comput. Sci., 1976)

Complexity of Some Problems Concerning L Systems. - Neil D. Jones; Sven Skyum (ICALP, 1977)

Recognition of Deterministic ETOL Languages in Logarathimic Space - Neil D. Jones; Sven Skyum (Inf. Control., 1977)

On Good ET0L Forms. - Sven Skyum (Theor. Comput. Sci., 1978)

A Complexity Theory Based on Boolean Algebra - Sven Skyum; Leslie G. Valiant (FOCS, 1981)

Fast Parallel Computation of Polynomials Using Few Processes. - Leslie G. Valiant; Sven Skyum (MFCS, 1981)

k-visit Attribute Grammars. - Hanne Riis Nielson; Sven Skyum (Math. Syst. Theory, 1981)

A Note on the Complexity of General D0L Membership. - Neil D. Jones; Sven Skyum (SIAM J. Comput., 1981)

The Copying Power of One-State Tree Transducers. - Joost Engelfriet; Sven Skyum (J. Comput. Syst. Sci., 1982)

A Measure in Which Boolean Negation is Exponentially Powerful. - Sven Skyum (Inf. Process. Lett., 1983)

Fast Parallel Computation of Polynomials Using Few Processors. - Leslie G. Valiant; Sven Skyum; S. Berkowitz; Charles Rackoff (SIAM J. Comput., 1983)

Families of Fixed Degree Graphs for Processor Interconnection. - Mark Jerrum; Sven Skyum (IEEE Trans. Computers, 1984)

A Simple Algorithm for Computing the Smallest Enclosing Circle. - Sven Skyum (Inf. Process. Lett., 1991)

Dynamic Word Problems - Gudmund Skovbjerg Frandsen; Peter Bro Miltersen; Sven Skyum (FOCS, 1993)

The Complexity of Finding Replicas Using Equality Tests. - Gudmund Skovbjerg Frandsen; Peter Bro Miltersen; Sven Skyum (MFCS, 1993)

Guest Editor's Foreword. - Sven Skyum (Nord. J. Comput., 1994)

Dynamic Maintenance of Majority Information in Constant Time per Update. - Gudmund Skovbjerg Frandsen; Sven Skyum (Inf. Process. Lett., 1997)

Searching Constant Width Mazes Captures the AC0 Hierarchy. - David A. Mix Barrington; Chi-Jen Lu; Peter Bro Miltersen; Sven Skyum (STACS, 1998)

On Monotone Planar Circuits. - David A. Mix Barrington; Chi-Jen Lu; Peter Bro Miltersen; Sven Skyum (CCC, 1999)

The Complexity of Identifying Large Equivalence Classes. - Sven Skyum; Gudmund Skovbjerg Frandsen; Peter Bro Miltersen; Peter G. Binderup (Fundam. Informaticae, 1999)

To Dexter - A Tribute from Aarhus. - Erik Meineche Schmidt; Mogens Nielsen; Sven Skyum (Logic and Program Semantics, 2012)

Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. - Kristoffer Arnsfelt Hansen; Balagopal Komarath; Jayalal Sarma; Sven Skyum; Navid Talebanfard (MFCS (2), 2014)