Gudmund Skovbjerg Frandsen - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2011

Dynamic normal forms and dynamic characteristic polynomialGudmund Skovbjerg Frandsen, Piotr Sankowski. TCS, 412(16):1470-1483, 2011. [doi]

2009

Dynamic matrix rankGudmund Skovbjerg Frandsen, Peter Frands Frandsen. TCS, 410(41):4085-4093, 2009. [doi]

2008

Dynamic Normal Forms and Dynamic Characteristic PolynomialGudmund Skovbjerg Frandsen, Piotr Sankowski. icalp 2008: 434-446 [doi]

2006

2005

Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integersIvan Damgård, Gudmund Skovbjerg Frandsen. JSC, 39(6):643-652, 2005. [doi]

Reviewing bounds on the circuit size of the hardest functionsGudmund Skovbjerg Frandsen, Peter Bro Miltersen. ipl, 95(2):354-357, 2005. [doi]

Reviewing Bounds on the Circuit Size of the Hardest FunctionsGudmund Skovbjerg Frandsen, Peter Bro Miltersen. eccc, (032), 2005. [doi]

2004

Binary GCD Like Algorithms for Some Complex Quadratic RingsSaurabh Agarwal, Gudmund Skovbjerg Frandsen. antsw 2004: 57-71 [doi]

On reducing a system of equations to a single equationGudmund Skovbjerg Frandsen, Igor Shparlinski. issac 2004: 163-166 [doi]

2003

An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error EstimatesIvan Damgård, Gudmund Skovbjerg Frandsen. fct 2003: 118-131 [doi]

Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein IntegersIvan Damgård, Gudmund Skovbjerg Frandsen. fct 2003: 109-117 [doi]

2001

An Extended Quadratic Frobenius Primality Test with Average Case Error EstimatesIvan Damgård, Gudmund Skovbjerg Frandsen. iacr, 2001:102, 2001. [doi]

Lower Bounds for Dynamic Algebraic ProblemsGudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen. iandc, 171(2):333-349, 2001. [doi]

1999

The Computational Complexity of Some Problems of Linear AlgebraJonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit. jcss, 58(3):572-596, 1999.

Lower Bounds for Dynamic Algebraic ProblemsGudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen. STACS 1999: 362-372 [doi]

The Complexity of Identifying Large Equivalence ClassesSven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup. FUIN, 38(1-2):25-37, 1999.

1997

1995

Dynamic Algorithms for the Dyck LanguagesGudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum. wads 1995: 98-108

1994

Some Results on Uniform Arithmetic Circuit ComplexityGudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington. mst, 27(2):105-124, 1994.

1993

Dynamic Word ProblemsGudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum. focs 1993: 470-479

The Complexity of Finding Replicas Using Equality TestsGudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum. mfcs 1993: 463-472

The Computational Efficacy of Finite-Field ArithmeticCarl Sturtivant, Gudmund Skovbjerg Frandsen. TCS, 112(2):291-309, 1993.

1992

An Arithmetic Model of Computation Equivalent to Threshold CircuitsJoan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant. TCS, 93(2):303-319, 1992.

1991

What is an Efficient Implementation of the /lambda-calculus?Gudmund Skovbjerg Frandsen, Carl Sturtivant. fpca 1991: 289-312

1985

Logic programming and substitutionsGudmund Skovbjerg Frandsen. fct 1985: 146-158

Sign in or sign up to see more results.

runs on WebDSL