Gudmund Skovbjerg Frandsen

发表

The Computational Efficacy of Finite-Field Arithmetic

Carl Sturtivant, Gudmund Skovbjerg Frandsen, G. Frandsen, 1993, Theor. Comput. Sci..

Layout Construction: A Case Study In Algorithm Engineering

Jens Palsberg, Erik Meineche Schmidt, Gudmund Skovbjerg Frandsen, 1993 .

Dynamic Matrix Rank

Gudmund Skovbjerg Frandsen, Peter Frands Frandsen, 2006, ICALP.

An Arithmetic Model of Computation Equivalent to Threshold Circuits

Carl Sturtivant, Joan Boyar, Gudmund Skovbjerg Frandsen, 1992, Theor. Comput. Sci..

Lower Bounds for Dynamic Algebraic Problems

Peter Bro Miltersen, Gudmund Skovbjerg Frandsen, Johan P. Hansen, 1998, Inf. Comput..

On reducing a system of equations to a single equation

Igor E. Shparlinski, Gudmund Skovbjerg Frandsen, I. Shparlinski, 2004, ISSAC '04.

Binary GCD Like Algorithms for Some Complex Quadratic Rings

Gudmund Skovbjerg Frandsen, Saurabh Agarwal, 2004, ANTS.

An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate

Ivan Damgård, Gudmund Skovbjerg Frandsen, I. Damgård, 2006, Journal of Cryptology.

Some results on uniform arithmetic circuit complexity

David A. Mix Barrington, Gudmund Skovbjerg Frandsen, Mark Valence, 1994, Mathematical systems theory.

The Complexity of Finding Replicas Using Equality Tests

Peter Bro Miltersen, Sven Skyum, Gudmund Skovbjerg Frandsen, 1993, MFCS.

Dynamic word problems

Peter Bro Miltersen, Sven Skyum, Gudmund Skovbjerg Frandsen, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates

Ivan Damgård, Gudmund Skovbjerg Frandsen, 2001, IACR Cryptol. ePrint Arch..

Dynamic Maintenance of Majority Information in Constant Time per Update

Sven Skyum, Gudmund Skovbjerg Frandsen, 1997, Inf. Process. Lett..

An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates

Ivan Damgård, Gudmund Skovbjerg Frandsen, I. Damgård, 2003, FCT.

Logic programming and substitutions

Gudmund Skovbjerg Frandsen, 1985, FCT.

A singular choice for multiple choice

Gudmund Skovbjerg Frandsen, Michael I. Schwartzbach, 2006, ACM SIGCSE Bull..

Dynamic Algorithms for the Dyck Languages

Peter Bro Miltersen, Thore Husfeldt, Gudmund Skovbjerg Frandsen, 1995 .

What is an Efficient Implementation of the \lambda-calculus?

Carl Sturtivant, Gudmund Skovbjerg Frandsen, 1991, FPCA.

Lower Bounds for Dynamic Algebraic Problems

Peter Bro Miltersen, Gudmund Skovbjerg Frandsen, Johan P. Hansen, 2001, Inf. Comput..

A New GCD Algorithm for Quadratic Number Rings with Unique Factorization

Gudmund Skovbjerg Frandsen, Saurabh Agarwal, Saurabh Agarwal, 2006, LATIN.

The Computational Complexity of Some Problems of Linear Algebra

Jeffrey Shallit, Gudmund Skovbjerg Frandsen, Jonathan F. Buss, 1996, J. Comput. Syst. Sci..

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers

Ivan Damgård, Gudmund Skovbjerg Frandsen, I. Damgård, 2003, J. Symb. Comput..

Reviewing bounds on the circuit size of the hardest functions

Peter Bro Miltersen, Gudmund Skovbjerg Frandsen, 2005, Inf. Process. Lett..

Dynamic matrix rank

Gudmund Skovbjerg Frandsen, Peter Frands Frandsen, G. Frandsen, 2006, Theor. Comput. Sci..

The Complexity of Identifying Large Equivalence Classes

Peter Bro Miltersen, Sven Skyum, Gudmund Skovbjerg Frandsen, 1998, Fundam. Informaticae.

The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract)

Jeffrey Shallit, Gudmund Skovbjerg Frandsen, Jonathan F. Buss, 1997, STACS.

Dynamic Algorithms for the Dyck Languages

Peter Bro Miltersen, Thore Husfeldt, Gudmund Skovbjerg Frandsen, 1995, WADS.

Dynamic normal forms and dynamic characteristic polynomial

Piotr Sankowski, Gudmund Skovbjerg Frandsen, P. Sankowski, 2008, Theor. Comput. Sci..

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers

Ivan Damgård, Gudmund Skovbjerg Frandsen, 2005, J. Symb. Comput..

Dynamic normal forms and dynamic characteristic polynomial

Piotr Sankowski, Gudmund Skovbjerg Frandsen, 2011, Theor. Comput. Sci..

On the Density of Normal Bases in Finite Fields

Gudmund Skovbjerg Frandsen, 1997 .

Dynamic Normal Forms and Dynamic Characteristic Polynomial

Piotr Sankowski, Gudmund Skovbjerg Frandsen, 2008 .

Lower Bounds for Dynamic Algebraic Problems

Peter Bro Miltersen, Gudmund Skovbjerg Frandsen, Johan P. Hansen, 1998 .

On the Density of Normal Bases in Finite Fields

Gudmund Skovbjerg Frandsen, G. Frandsen, 1997 .

On Reducing a System of Equations to a Single Equation

Igor E. Shparlinski, Gudmund Skovbjerg Frandsen, I. Shparlinski, 2004 .

Parallel Construction of Irreducible Polynomials

Gudmund Skovbjerg Frandsen, G. Frandsen, 1991 .

Some Results on Uniform Arithmetic Circuit Complexity

David A. Mix Barrington, Gudmund Skovbjerg Frandsen, Mark Valence, 1991 .

Efficient Algorithms for gcd and Cubic Residuosity in the Ring of Eisenstein Integers

Ivan Damgård, Gudmund Skovbjerg Frandsen, 2003 .

A Denotational Semantics for Logic Programming

Gudmund Skovbjerg Frandsen, 1985 .

Dynamic Maintenance of Majority Information in Constant Time per Update

Sven Skyum, Gudmund Skovbjerg Frandsen, 1995 .

Logic Programming, Substitutions and Finite Computability

Gudmund Skovbjerg Frandsen, 1985 .

The Computational Efficacy of Finite Field Arithmetic

Gudmund Skovbjerg Frandsen, Carl Sturtivant, 1987 .

The Computational Complexity of Some Problems of Linear Algebra

Jeffrey Shallit, Gudmund Skovbjerg Frandsen, Jonathan F. Buss, 1996 .

Reviewing Bounds on the Circuit Size of the Hardest Functions

Peter Bro Miltersen, Gudmund Skovbjerg Frandsen, 2005 .

The Complexity of Identifying Large Equivalence Classes

Peter Bro Miltersen, Sven Skyum, Gudmund Skovbjerg Frandsen, 1998 .

The Depth Efficacy of Unbounded: Characteristic Finite Field Arithmetic

Gudmund Skovbjerg Frandsen, Carl Sturtivant, 1988 .

Dynamic Word problems

Peter Bro Miltersen, Sven Skyum, Gudmund Skovbjerg Frandsen, 1993 .