Logic programming and substitutions. - Gudmund Skovbjerg Frandsen (FCT, 1985)

What is an Efficient Implementation of the lambda-calculus? - Gudmund Skovbjerg Frandsen; Carl Sturtivant (FPCA, 1991)

An Arithmetic Model of Computation Equivalent to Threshold Circuits. - Joan Boyar; Gudmund Skovbjerg Frandsen; Carl Sturtivant (Theor. Comput. Sci., 1992)

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

The Computational Efficacy of Finite-Field Arithmetic. - Carl Sturtivant; Gudmund Skovbjerg Frandsen (Theor. Comput. Sci., 1993)

Some Results on Uniform Arithmetic Circuit Complexity. - Gudmund Skovbjerg Frandsen; Mark Valence; David A. Mix Barrington (Math. Syst. Theory, 1994)

Dynamic Algorithms for the Dyck Languages. - Gudmund Skovbjerg Frandsen; Thore Husfeldt; Peter Bro Miltersen; Theis Rauhe; Søren Skyum (WADS, 1995)

The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). - Jonathan F. Buss; Gudmund Skovbjerg Frandsen; Jeffrey O. Shallit (STACS, 1997)

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

Dynamic word problems. - Gudmund Skovbjerg Frandsen; Peter Bro Miltersen; Sven Skyum (J. ACM, 1997)

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

The Computational Complexity of Some Problems of Linear Algebra. - Jonathan F. Buss; Gudmund Skovbjerg Frandsen; Jeffrey O. Shallit (J. Comput. Syst. Sci., 1999)

An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. - Ivan Damgård; Gudmund Skovbjerg Frandsen (IACR Cryptol. ePrint Arch., 2001)

Lower Bounds for Dynamic Algebraic Problems. - Gudmund Skovbjerg Frandsen; Johan P. Hansen; Peter Bro Miltersen (Inf. Comput., 2001)

An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. - Ivan Damgård; Gudmund Skovbjerg Frandsen (FCT, 2003)

Binary GCD Like Algorithms for Some Complex Quadratic Rings. - Saurabh Agarwal; Gudmund Skovbjerg Frandsen (ANTS, 2004)

On reducing a system of equations to a single equation. - Gudmund Skovbjerg Frandsen; Igor E. Shparlinski (ISSAC, 2004)

Reviewing bounds on the circuit size of the hardest functions. - Gudmund Skovbjerg Frandsen; Peter Bro Miltersen (Inf. Process. Lett., 2005)

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers. - Ivan Damgård; Gudmund Skovbjerg Frandsen (J. Symb. Comput., 2005)

A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. - Saurabh Agarwal; Gudmund Skovbjerg Frandsen (LATIN, 2006)

An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate. - Ivan Damgård; Gudmund Skovbjerg Frandsen (J. Cryptol., 2006)

A singular choice for multiple choice. - Gudmund Skovbjerg Frandsen; Michael I. Schwartzbach (ACM SIGCSE Bull., 2006)

Dynamic matrix rank. - Gudmund Skovbjerg Frandsen; Peter Frands Frandsen (Theor. Comput. Sci., 2009)

Dynamic normal forms and dynamic characteristic polynomial. - Gudmund Skovbjerg Frandsen; Piotr Sankowski (Theor. Comput. Sci., 2011)