Gudmund Skovbjerg Frandsen

Publication Activity (10 Years)

Years Active: 1985-2011
Publications (10 Years): 0

Publications

Gudmund Skovbjerg Frandsen, Piotr Sankowski
Dynamic normal forms and dynamic characteristic polynomial. Theor. Comput. Sci. 412 (16) (2011)
Gudmund Skovbjerg Frandsen, Peter Frands Frandsen
Dynamic matrix rank. Theor. Comput. Sci. 410 (41) (2009)
Gudmund Skovbjerg Frandsen, Piotr Sankowski
Dynamic Normal Forms and Dynamic Characteristic Polynomial. ICALP (1) (2008)
Gudmund Skovbjerg Frandsen, Peter Frands Frandsen
Dynamic Matrix Rank. ICALP (1) (2006)
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. LATIN (2006)
Gudmund Skovbjerg Frandsen, Michael I. Schwartzbach
A singular choice for multiple choice. ACM SIGCSE Bull. 38 (4) (2006)
Ivan Damgård, Gudmund Skovbjerg Frandsen
An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate. J. Cryptol. 19 (4) (2006)
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
Reviewing bounds on the circuit size of the hardest functions. Inf. Process. Lett. 95 (2) (2005)
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
Reviewing Bounds on the Circuit Size of the Hardest Functions Electron. Colloquium Comput. Complex. (032) (2005)
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) (2005)
Gudmund Skovbjerg Frandsen, Igor E. Shparlinski
On reducing a system of equations to a single equation. ISSAC (2004)
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
Binary GCD Like Algorithms for Some Complex Quadratic Rings. ANTS (2004)
Ivan Damgård, Gudmund Skovbjerg Frandsen
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. FCT (2003)
Ivan Damgård, Gudmund Skovbjerg Frandsen
Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. FCT (2003)
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
Lower Bounds for Dynamic Algebraic Problems. Inf. Comput. 171 (2) (2001)
Ivan Damgård, Gudmund Skovbjerg Frandsen
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. IACR Cryptol. ePrint Arch. 2001 (2001)
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. 58 (3) (1999)
Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup
The Complexity of Identifying Large Equivalence Classes. Fundam. Informaticae 38 (1-2) (1999)
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
Lower Bounds for Dynamic Algebraic Problems. STACS (1999)
Gudmund Skovbjerg Frandsen, Sven Skyum
Dynamic Maintenance of Majority Information in Constant Time per Update. Inf. Process. Lett. 63 (2) (1997)
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
Dynamic word problems. J. ACM 44 (2) (1997)
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
The Computational Complexity of Some Problems of Linear Algebra Electron. Colloquium Comput. Complex. 4 (9) (1997)
Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey O. Shallit
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS (1997)
Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
Dynamic Algorithms for the Dyck Languages. WADS (1995)
Gudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington
Some Results on Uniform Arithmetic Circuit Complexity. Math. Syst. Theory 27 (2) (1994)
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
Dynamic Word Problems FOCS (1993)
Carl Sturtivant, Gudmund Skovbjerg Frandsen
The Computational Efficacy of Finite-Field Arithmetic. Theor. Comput. Sci. 112 (2) (1993)
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
The Complexity of Finding Replicas Using Equality Tests. MFCS (1993)
Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant
An Arithmetic Model of Computation Equivalent to Threshold Circuits. Theor. Comput. Sci. 93 (2) (1992)
Gudmund Skovbjerg Frandsen, Carl Sturtivant
What is an Efficient Implementation of the \lambda-calculus? FPCA (1991)
Gudmund Skovbjerg Frandsen
Logic programming and substitutions. FCT (1985)