1999 |
34 | EE | David A. Mix Barrington,
Chi-Jen Lu,
Peter Bro Miltersen,
Sven Skyum:
On Monotone Planar Circuits.
IEEE Conference on Computational Complexity 1999: 24- |
33 | | Sven Skyum,
Gudmund Skovbjerg Frandsen,
Peter Bro Miltersen,
Peter G. Binderup:
The Complexity of Identifying Large Equivalence Classes.
Fundam. Inform. 38(1-2): 25-37 (1999) |
1998 |
32 | | Kim Guldstrand Larsen,
Sven Skyum,
Glynn Winskel:
Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings
Springer 1998 |
31 | | David A. Mix Barrington,
Chi-Jen Lu,
Peter Bro Miltersen,
Sven Skyum:
Searching Constant Width Mazes Captures the AC0 Hierarchy.
STACS 1998: 73-83 |
1997 |
30 | EE | David A. Mix Barrington,
Chi-Jen Lu,
Peter Bro Miltersen,
Sven Skyum:
Searching constant width mazes captures the AC0 hierarchy
Electronic Colloquium on Computational Complexity (ECCC) 4(44): (1997) |
29 | EE | Gudmund Skovbjerg Frandsen,
Sven Skyum:
Dynamic Maintenance of Majority Information in Constant Time per Update.
Inf. Process. Lett. 63(2): 75-78 (1997) |
28 | EE | Gudmund Skovbjerg Frandsen,
Peter Bro Miltersen,
Sven Skyum:
Dynamic word problems.
J. ACM 44(2): 257-271 (1997) |
1994 |
27 | | Erik Meineche Schmidt,
Sven Skyum:
Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings
Springer 1994 |
26 | | Sven Skyum:
Guest Editor's Foreword.
Nord. J. Comput. 1(4): 387- (1994) |
1993 |
25 | | Gudmund Skovbjerg Frandsen,
Peter Bro Miltersen,
Sven Skyum:
Dynamic Word Problems
FOCS 1993: 470-479 |
24 | | Gudmund Skovbjerg Frandsen,
Peter Bro Miltersen,
Sven Skyum:
The Complexity of Finding Replicas Using Equality Tests.
MFCS 1993: 463-472 |
1991 |
23 | | Sven Skyum:
A Simple Algorithm for Computing the Smallest Enclosing Circle.
Inf. Process. Lett. 37(3): 121-125 (1991) |
1985 |
22 | EE | Sven Skyum,
Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra
J. ACM 32(2): 484-502 (1985) |
1984 |
21 | | Mark Jerrum,
Sven Skyum:
Families of Fixed Degree Graphs for Processor Interconnection.
IEEE Trans. Computers 33(2): 190-194 (1984) |
1983 |
20 | | Sven Skyum:
A Measure in Which Boolean Negation is Exponentially Powerful.
Inf. Process. Lett. 17(3): 125-128 (1983) |
19 | | Leslie G. Valiant,
Sven Skyum,
S. Berkowitz,
Charles Rackoff:
Fast Parallel Computation of Polynomials Using Few Processors.
SIAM J. Comput. 12(4): 641-644 (1983) |
1982 |
18 | | Joost Engelfriet,
Sven Skyum:
The Copying Power of One-State Tree Transducers.
J. Comput. Syst. Sci. 25(3): 418-435 (1982) |
1981 |
17 | | Sven Skyum,
Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra
FOCS 1981: 244-253 |
16 | | Leslie G. Valiant,
Sven Skyum:
Fast Parallel Computation of Polynomials Using Few Processes.
MFCS 1981: 132-139 |
15 | | Hanne Riis Nielson,
Sven Skyum:
k-visit Attribute Grammars.
Mathematical Systems Theory 15(1): 17-28 (1981) |
14 | | Neil D. Jones,
Sven Skyum:
A Note on the Complexity of General D0L Membership.
SIAM J. Comput. 10(1): 114-117 (1981) |
1979 |
13 | | Neil D. Jones,
Sven Skyum:
Complexity of Some Problems Concerning L Systems.
Mathematical Systems Theory 13: 29-43 (1979) |
1978 |
12 | | Sven Skyum:
On Good ET0L Forms.
Theor. Comput. Sci. 7: 263-272 (1978) |
1977 |
11 | | Neil D. Jones,
Sven Skyum:
Complexity of Some Problems Concerning L Systems.
ICALP 1977: 301-308 |
10 | | Neil D. Jones,
Sven Skyum:
Recognition of Deterministic ETOL Languages in Logarathimic Space
Information and Control 35(3): 177-181 (1977) |
1976 |
9 | | Joost Engelfriet,
Sven Skyum:
Copying Theorems.
Inf. Process. Lett. 4(6): 157-161 (1976) |
8 | | Sven Skyum:
Decomposition Theorems for Various Kinds of Languages Parallel in Nature.
SIAM J. Comput. 5(2): 284-296 (1976) |
7 | | Andrzej Ehrenfeucht,
Grzegorz Rozenberg,
Sven Skyum:
A Relationship between ET0L and EDT0L Languages.
Theor. Comput. Sci. 1(4): 325-330 (1976) |
1975 |
6 | | Sven Skyum:
On Decomposing Languages Defined by Parallel Devices
STOC 1975: 121-125 |
1974 |
5 | | Sven Skyum:
Nonterminals and Codings in Defining Variations of 0L-Systems.
L Systems 1974: 244-249 |
4 | | Mogens Nielsen,
Grzegorz Rozenberg,
Arto Salomaa,
Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems
Acta Inf. 3: 357-364 (1974) |
3 | | Mogens Nielsen,
Grzegorz Rozenberg,
Arto Salomaa,
Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems
Acta Inf. 4: 87-106 (1974) |
2 | | Sven Skyum:
On Extensions of ALGOL-Like Languages
Information and Control 26(1): 82-97 (1974) |
1 | | Sven Skyum:
Parallel Context-Free Languages
Information and Control 26(3): 280-285 (1974) |