default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSven Skyum
Person information
- affiliation: Aarhus University, Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c11]Kristoffer Arnsfelt Hansen
, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard:
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) 2014: 336-347- 2012
- [c10]Erik Meineche Schmidt, Mogens Nielsen, Sven Skyum:
To Dexter - A Tribute from Aarhus. Logic and Program Semantics 2012: 341
1990 – 1999
- 1999
- [j22]Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup:
The Complexity of Identifying Large Equivalence Classes. Fundam. Informaticae 38(1-2): 25-37 (1999) - [c9]David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum:
On Monotone Planar Circuits. CCC 1999: 24- - 1998
- [c8]David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum:
Searching Constant Width Mazes Captures the AC0 Hierarchy. STACS 1998: 73-83 - [e2]Kim Guldstrand Larsen, Sven Skyum, Glynn Winskel:
Automata, Languages and Programming, 25th International Colloquium, ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings. Lecture Notes in Computer Science 1443, Springer 1998, ISBN 3-540-64781-3 [contents] - 1997
- [j21]Gudmund Skovbjerg Frandsen, Sven Skyum:
Dynamic Maintenance of Majority Information in Constant Time per Update. Inf. Process. Lett. 63(2): 75-78 (1997) - [j20]Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum:
Dynamic word problems. J. ACM 44(2): 257-271 (1997) - [i1]David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum:
Searching constant width mazes captures the AC0 hierarchy. Electron. Colloquium Comput. Complex. TR97 (1997) - 1994
- [j19]Sven Skyum:
Guest Editor's Foreword. Nord. J. Comput. 1(4): 387- (1994) - [e1]Erik Meineche Schmidt, Sven Skyum:
Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings. Lecture Notes in Computer Science 824, Springer 1994, ISBN 3-540-58218-5 [contents] - 1993
- [c7]Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum:
Dynamic Word Problems. FOCS 1993: 470-479 - [c6]Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum:
The Complexity of Finding Replicas Using Equality Tests. MFCS 1993: 463-472 - 1991
- [j18]Sven Skyum:
A Simple Algorithm for Computing the Smallest Enclosing Circle. Inf. Process. Lett. 37(3): 121-125 (1991)
1980 – 1989
- 1985
- [j17]Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. J. ACM 32(2): 484-502 (1985) - 1984
- [j16]Mark Jerrum, Sven Skyum:
Families of Fixed Degree Graphs for Processor Interconnection. IEEE Trans. Computers 33(2): 190-194 (1984) - 1983
- [j15]Sven Skyum:
A Measure in Which Boolean Negation is Exponentially Powerful. Inf. Process. Lett. 17(3): 125-128 (1983) - [j14]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
- [j13]Joost Engelfriet, Sven Skyum:
The Copying Power of One-State Tree Transducers. J. Comput. Syst. Sci. 25(3): 418-435 (1982) - 1981
- [j12]Hanne Riis Nielson, Sven Skyum:
k-visit Attribute Grammars. Math. Syst. Theory 15(1): 17-28 (1981) - [j11]Neil D. Jones, Sven Skyum:
A Note on the Complexity of General D0L Membership. SIAM J. Comput. 10(1): 114-117 (1981) - [c5]Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. FOCS 1981: 244-253 - [c4]Leslie G. Valiant, Sven Skyum:
Fast Parallel Computation of Polynomials Using Few Processes. MFCS 1981: 132-139
1970 – 1979
- 1979
- [j10]Neil D. Jones, Sven Skyum:
Complexity of Some Problems Concerning L Systems. Math. Syst. Theory 13: 29-43 (1979) - 1978
- [j9]Sven Skyum:
On Good ET0L Forms. Theor. Comput. Sci. 7: 263-272 (1978) - 1977
- [j8]Neil D. Jones, Sven Skyum:
Recognition of Deterministic ETOL Languages in Logarathimic Space. Inf. Control. 35(3): 177-181 (1977) - [c3]Neil D. Jones, Sven Skyum:
Complexity of Some Problems Concerning L Systems. ICALP 1977: 301-308 - 1976
- [j7]Joost Engelfriet, Sven Skyum:
Copying Theorems. Inf. Process. Lett. 4(6): 157-161 (1976) - [j6]Sven Skyum:
Decomposition Theorems for Various Kinds of Languages Parallel in Nature. SIAM J. Comput. 5(2): 284-296 (1976) - [j5]Andrzej Ehrenfeucht, Grzegorz Rozenberg, Sven Skyum:
A Relationship between ET0L and EDT0L Languages. Theor. Comput. Sci. 1(4): 325-330 (1976) - 1975
- [c2]Sven Skyum:
On Decomposing Languages Defined by Parallel Devices. STOC 1975: 121-125 - 1974
- [j4]Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems. Acta Informatica 3: 357-364 (1974) - [j3]Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems. Acta Informatica 4: 87-106 (1974) - [j2]Sven Skyum:
On Extensions of ALGOL-Like Languages. Inf. Control. 26(1): 82-97 (1974) - [j1]Sven Skyum:
Parallel Context-Free Languages. Inf. Control. 26(3): 280-285 (1974) - [c1]Sven Skyum:
Nonterminals and Codings in Defining Variations of 0L-Systems. L Systems 1974: 244-249
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
