Selected research papers by Gudmund S. Frandsen

Journals

• Theoret. Comput. Sci. 412 (2011) 1470-1483 Dynamic Normal Forms and Dynamic Characteristic Polynomial (with Sankowski)
• Theoret. Comput. Sci. 410 (2009) 4085-4093 Dynamic Matrix Rank (with Frandsen)
• ACM SIGCSE Bulletin 38 issue 4 (2006), 34-38 A Singular Choice for Multiple Choice (with Schwartzbach)
• J. Cryptology 19 (2006) 489-520 An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates (with Damgård)
• Inform. Process. Lett. 95 (2005) 354-357. Reviewing Bounds on the Circuit Size of the Hardest Functions (with Miltersen)
• J. Symb. Comput. 39 (2005) 643-652 Efficient algorithms for gcd and cubic residuosity in the ring of Eisenstein integers (with Damgård)
• Inf. and Comp. 171 (2001) 333-349 Lower Bounds for Dynamic Algebraic Problems (with Hansen, Miltersen)
• Finite Fields Appl. 6 (2000) 23-38 On the Density of Normal Bases in Finite Fields
• J. Comput. System Sci. 58 (1999) 572-596 The Computational Complexity of Some Problems of Linear Algebra (with Buss, Shallit)
• Fund. Inform. 38 (1999) 25-37 The Complexity of Identifying Large Equivalence Classes (with Skyum, Miltersen, Binderup)
• Inform. Process. Lett. 63 (1997) 75-78 Dynamic Maintenance of Majority Information in Constant Time per Update (with Skyum)
• J.ACM 44 (1997) 257-271 Dynamic Word Problems (with Miltersen, Skyum)
• Math. Systems Theory 27 (1994) 105-124 Some Results on Uniform Arithmetic Circuit Complexity (with Valence, Barrington)
• Theoret. Comput. Sci. 112 (1993) 291-309 The Computational Efficacy of Finite Field Arithmetic (with Sturtivant)
• Theoret. Comput. Sci. 93 (1992) 303-319 An Arithmetic Model of Computation Equivalent to Threshold Circuits (with Boyar, Sturtivant)

Proceedings

• LATIN'06. LNCS 3887 (2006) 30-42 A new GCD Algorithm for Quadratic Number Rings with Unique Factorization (with Agarwal)
• ISSAC'04. 163-166 On Reducing a System of Equations to a Single Equation (with Shparlinski)
• ANTS'04. LNCS 3076 (2004) 57-71Binary GCD Like Algorithms for Some Complex Quadratic Rings (with Agarwal)
• WADS'95. LNCS 955 (1995) 98-108 Dynamic Algorithms for the Dyck Languages (with Husfeldt, Miltersen, Rauhe, Skyum)
• FPCA'91, LNCS 523 (1991) 289-312 What is an Efficient Implementation of the lambda-calculus? (with Sturtivant)
• FCT'85, LNCS 199 (1985) 146-158 Logic Programming and Substitutions

Tech reports

• DAIMI-PB-450 (1993) A Case Study in Algorithm Engineering (with Palsberg, Schmidt, Sjøgaard)
• DAIMI-PB-358 (1991) Parallel Construction of Irreducible Polynomials
• DAIMI-PB-201 (1985) A Denotational Semantics for Logic Programming (part of PhD thesis)
• DAIMI-PB-199 (1985) Learnability (part of PhD thesis)