Gudmund Skovbjerg Frandsen

2008
28	EE	Gudmund Skovbjerg Frandsen, Piotr Sankowski: Dynamic Normal Forms and Dynamic Characteristic Polynomial. ICALP (1) 2008: 434-446
2006
27	EE	Gudmund Skovbjerg Frandsen, Peter Frands Frandsen: Dynamic Matrix Rank. ICALP (1) 2006: 395-406
26	EE	Saurabh Agarwal, Gudmund Skovbjerg Frandsen: A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. LATIN 2006: 30-42
25	EE	Ivan Damgård, Gudmund Skovbjerg Frandsen: An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate. J. Cryptology 19(4): 489-520 (2006)
24	EE	Gudmund Skovbjerg Frandsen, Michael I. Schwartzbach: A singular choice for multiple choice. SIGCSE Bulletin 38(4): 34-38 (2006)
2005
23	EE	Gudmund Skovbjerg Frandsen, Peter Bro Miltersen: Reviewing Bounds on the Circuit Size of the Hardest Functions Electronic Colloquium on Computational Complexity (ECCC)(032): (2005)
22	EE	Gudmund Skovbjerg Frandsen, Peter Bro Miltersen: Reviewing bounds on the circuit size of the hardest functions. Inf. Process. Lett. 95(2): 354-357 (2005)
21	EE	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): 643-652 (2005)
2004
20	EE	Saurabh Agarwal, Gudmund Skovbjerg Frandsen: Binary GCD Like Algorithms for Some Complex Quadratic Rings. ANTS 2004: 57-71
19	EE	Gudmund Skovbjerg Frandsen, Igor Shparlinski: On reducing a system of equations to a single equation. ISSAC 2004: 163-166
2003
18	EE	Ivan Damgård, Gudmund Skovbjerg Frandsen: Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. FCT 2003: 109-117
17	EE	Ivan Damgård, Gudmund Skovbjerg Frandsen: An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. FCT 2003: 118-131
2001
16	EE	Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen: Lower Bounds for Dynamic Algebraic Problems. Inf. Comput. 171(2): 333-349 (2001)
1999
15	EE	Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen: Lower Bounds for Dynamic Algebraic Problems. STACS 1999: 362-372
14		Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup: The Complexity of Identifying Large Equivalence Classes. Fundam. Inform. 38(1-2): 25-37 (1999)
13		Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit: The Computational Complexity of Some Problems of Linear Algebra. J. Comput. Syst. Sci. 58(3): 572-596 (1999)
1997
12		Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit: The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS 1997: 451-462
11	EE	Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit: The Computational Complexity of Some Problems of Linear Algebra Electronic Colloquium on Computational Complexity (ECCC) 4(9): (1997)
10	EE	Gudmund Skovbjerg Frandsen, Sven Skyum: Dynamic Maintenance of Majority Information in Constant Time per Update. Inf. Process. Lett. 63(2): 75-78 (1997)
9	EE	Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: Dynamic word problems. J. ACM 44(2): 257-271 (1997)
1995
8		Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum: Dynamic Algorithms for the Dyck Languages. WADS 1995: 98-108
1994
7		Gudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington: Some Results on Uniform Arithmetic Circuit Complexity. Mathematical Systems Theory 27(2): 105-124 (1994)
1993
6		Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: Dynamic Word Problems FOCS 1993: 470-479
5		Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: The Complexity of Finding Replicas Using Equality Tests. MFCS 1993: 463-472
4		Carl Sturtivant, Gudmund Skovbjerg Frandsen: The Computational Efficacy of Finite-Field Arithmetic. Theor. Comput. Sci. 112(2): 291-309 (1993)
1992
3		Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant: An Arithmetic Model of Computation Equivalent to Threshold Circuits. Theor. Comput. Sci. 93(2): 303-319 (1992)
1991
2		Gudmund Skovbjerg Frandsen, Carl Sturtivant: What is an Efficient Implementation of the \lambda-calculus? FPCA 1991: 289-312
1985
1		Gudmund Skovbjerg Frandsen: Logic programming and substitutions. FCT 1985: 146-158

Coauthor Index

1	Saurabh Agarwal	[20] [26]
2	David A. Mix Barrington	[7]
3	Peter G. Binderup	[14]
4	Joan Boyar	[3]
5	Jonathan F. Buss	[11] [12] [13]
6	Ivan Damgård	[17] [18] [21] [25]
7	Peter Frands Frandsen	[27]
8	Johan P. Hansen	[15] [16]
9	Thore Husfeldt	[8]
10	Peter Bro Miltersen	[5] [6] [8] [9] [14] [15] [16] [22] [23]
11	Theis Rauhe	[8]
12	Piotr Sankowski	[28]
13	Michael I. Schwartzbach	[24]
14	Jeffrey Shallit	[11] [12] [13]
15	Igor Shparlinski	[19]
16	Søren Skyum	[8]
17	Sven Skyum	[5] [6] [9] [10] [14]
18	Carl Sturtivant	[2] [3] [4]
19	Mark Valence	[7]

Colors in the list of coauthors