default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGudmund Skovbjerg Frandsen
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
- 2011
[j14]Gudmund Skovbjerg Frandsen, Piotr Sankowski:
Dynamic normal forms and dynamic characteristic polynomial. Theor. Comput. Sci. 412(16): 1470-1483 (2011)
2000 – 2009
- 2009
- [j13]Gudmund Skovbjerg Frandsen, Peter Frands Frandsen:
Dynamic matrix rank. Theor. Comput. Sci. 410(41): 4085-4093 (2009) - 2008
- [c14]Gudmund Skovbjerg Frandsen, Piotr Sankowski:
Dynamic Normal Forms and Dynamic Characteristic Polynomial. ICALP (1) 2008: 434-446 - 2006
- [j12]Ivan Damgård, Gudmund Skovbjerg Frandsen:
An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate. J. Cryptol. 19(4): 489-520 (2006) - [j11]Gudmund Skovbjerg Frandsen, Michael I. Schwartzbach:
A singular choice for multiple choice. ACM SIGCSE Bull. 38(4): 34-38 (2006) - [c13]Gudmund Skovbjerg Frandsen, Peter Frands Frandsen:
Dynamic Matrix Rank. ICALP (1) 2006: 395-406 - [c12]Saurabh Agarwal, Gudmund Skovbjerg Frandsen:
A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. LATIN 2006: 30-42 - 2005
- [j10]Gudmund Skovbjerg Frandsen, Peter Bro Miltersen:
Reviewing bounds on the circuit size of the hardest functions. Inf. Process. Lett. 95(2): 354-357 (2005) - [j9]Ivan Damgård, Gudmund Skovbjerg Frandsen:
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers. J. Symb. Comput. 39(6): 643-652 (2005) - [i3]Gudmund Skovbjerg Frandsen, Peter Bro Miltersen:
Reviewing Bounds on the Circuit Size of the Hardest Functions. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [c11]Saurabh Agarwal, Gudmund Skovbjerg Frandsen:
Binary GCD Like Algorithms for Some Complex Quadratic Rings. ANTS 2004: 57-71 - [c10]Gudmund Skovbjerg Frandsen, Igor E. Shparlinski
:
On reducing a system of equations to a single equation. ISSAC 2004: 163-166 - 2003
- [c9]Ivan Damgård, Gudmund Skovbjerg Frandsen:
Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. FCT 2003: 109-117 - [c8]Ivan Damgård, Gudmund Skovbjerg Frandsen:
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. FCT 2003: 118-131 - 2001
- [j8]Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen:
Lower Bounds for Dynamic Algebraic Problems. Inf. Comput. 171(2): 333-349 (2001) - [i2]Ivan Damgård, Gudmund Skovbjerg Frandsen:
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. IACR Cryptol. ePrint Arch. 2001: 102 (2001)
1990 – 1999
- 1999
- [j7]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) - [j6]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. 58(3): 572-596 (1999) - [c7]Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen:
Lower Bounds for Dynamic Algebraic Problems. STACS 1999: 362-372 - 1997
- [j5]Gudmund Skovbjerg Frandsen, Sven Skyum:
Dynamic Maintenance of Majority Information in Constant Time per Update. Inf. Process. Lett. 63(2): 75-78 (1997) - [j4]Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum:
Dynamic word problems. J. ACM 44(2): 257-271 (1997) - [c6]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS 1997: 451-462 - [i1]Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit:
The Computational Complexity of Some Problems of Linear Algebra. Electron. Colloquium Comput. Complex. TR97 (1997) - 1995
- [c5]Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum:
Dynamic Algorithms for the Dyck Languages. WADS 1995: 98-108 - 1994
- [j3]Gudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington:
Some Results on Uniform Arithmetic Circuit Complexity. Math. Syst. Theory 27(2): 105-124 (1994) - 1993
- [j2]Carl Sturtivant, Gudmund Skovbjerg Frandsen:
The Computational Efficacy of Finite-Field Arithmetic. Theor. Comput. Sci. 112(2): 291-309 (1993) - [c4]Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum:
Dynamic Word Problems. FOCS 1993: 470-479 - [c3]Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum:
The Complexity of Finding Replicas Using Equality Tests. MFCS 1993: 463-472 - 1992
- [j1]Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant:
An Arithmetic Model of Computation Equivalent to Threshold Circuits. Theor. Comput. Sci. 93(2): 303-319 (1992) - 1991
- [c2]Gudmund Skovbjerg Frandsen, Carl Sturtivant:
What is an Efficient Implementation of the \lambda-calculus? FPCA 1991: 289-312
1980 – 1989
- 1985
- [c1]Gudmund Skovbjerg Frandsen:
Logic programming and substitutions. FCT 1985: 146-158
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 22:57 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:
