- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j14 |      | Gudmund Skovbjerg Frandsen, Piotr Sankowski: Dynamic normal forms and dynamic characteristic polynomial. Theor. Comput. Sci. 412(16): 1470-1483 (2011) |
| 2009 | ||
| j13 | | Gudmund Skovbjerg Frandsen, Peter Frands Frandsen: Dynamic matrix rank. Theor. Comput. Sci. 410(41): 4085-4093 (2009) |
| 2008 | ||
| c14 | | Gudmund Skovbjerg Frandsen, Piotr Sankowski: Dynamic Normal Forms and Dynamic Characteristic Polynomial. ICALP (1) 2008: 434-446 |
| 2006 | ||
| j12 | | 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) |
| j11 | | Gudmund Skovbjerg Frandsen, Michael I. Schwartzbach: A singular choice for multiple choice. SIGCSE Bulletin 38(4): 34-38 (2006) |
| c13 | | |
| c12 | | Saurabh Agarwal, Gudmund Skovbjerg Frandsen: A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. LATIN 2006: 30-42 |
| 2005 | ||
| j10 | | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen: Reviewing bounds on the circuit size of the hardest functions. Inf. Process. Lett. 95(2): 354-357 (2005) |
| j9 | | 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) |
| i3 | | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen: Reviewing Bounds on the Circuit Size of the Hardest Functions. Electronic Colloquium on Computational Complexity (ECCC)(032) (2005) |
| 2004 | ||
| c11 | | Saurabh Agarwal, Gudmund Skovbjerg Frandsen: Binary GCD Like Algorithms for Some Complex Quadratic Rings. ANTS 2004: 57-71 |
| c10 | | Gudmund Skovbjerg Frandsen, Igor Shparlinski: On reducing a system of equations to a single equation. ISSAC 2004: 163-166 |
| 2003 | ||
| c9 | | Ivan Damgård, Gudmund Skovbjerg Frandsen: Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. FCT 2003: 109-117 |
| c8 | | Ivan Damgård, Gudmund Skovbjerg Frandsen: An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. FCT 2003: 118-131 |
| 2001 | ||
| j8 | | Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen: Lower Bounds for Dynamic Algebraic Problems. Inf. Comput. 171(2): 333-349 (2001) |
| i2 | | Ivan Damgård, Gudmund Skovbjerg Frandsen: An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. IACR Cryptology ePrint Archive 2001: 102 (2001) |
| 1999 | ||
| j7 | | 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) |
| j6 | | 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) |
| c7 | | Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen: Lower Bounds for Dynamic Algebraic Problems. STACS 1999: 362-372 |
| 1997 | ||
| j5 | | Gudmund Skovbjerg Frandsen, Sven Skyum: Dynamic Maintenance of Majority Information in Constant Time per Update. Inf. Process. Lett. 63(2): 75-78 (1997) |
| j4 | | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: Dynamic word problems. J. ACM 44(2): 257-271 (1997) |
| c6 | | Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit: The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). STACS 1997: 451-462 |
| i1 | | 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) |
| 1995 | ||
| c5 | | Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum: Dynamic Algorithms for the Dyck Languages. WADS 1995: 98-108 |
| 1994 | ||
| j3 | | 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 | ||
| j2 | | Carl Sturtivant, Gudmund Skovbjerg Frandsen: The Computational Efficacy of Finite-Field Arithmetic. Theor. Comput. Sci. 112(2): 291-309 (1993) |
| c4 | | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: Dynamic Word Problems. FOCS 1993: 470-479 |
| c3 | | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: The Complexity of Finding Replicas Using Equality Tests. MFCS 1993: 463-472 |
| 1992 | ||
| j1 | | 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 | ||
| c2 | | Gudmund Skovbjerg Frandsen, Carl Sturtivant: What is an Efficient Implementation of the \lambda-calculus? FPCA 1991: 289-312 |
| 1985 | ||
| c1 | | |
| 1 | Saurabh Agarwal | |
| 2 | David A. Mix Barrington | |
| 3 | Peter G. Binderup | |
| 4 | Joan Boyar (Joan B. Plumstead) | |
| 5 | Jonathan F. Buss | |
| 6 | Ivan Damgård (Ivan Bjerre Damgård) | |
| 7 | Peter Frands Frandsen | |
| 8 | Johan P. Hansen | |
| 9 | Thore Husfeldt | |
| 10 | Peter Bro Miltersen | |
| 11 | Theis Rauhe | |
| 12 | Piotr Sankowski | |
| 13 | Michael I. Schwartzbach | |
| 14 | Jeffrey Shallit (Jeffrey O. Shallit) | |
| 15 | Igor Shparlinski | |
| 16 | Sven Skyum | |
| 17 | Søren Skyum | |
| 18 | Carl Sturtivant | |
| 19 | Mark Valence |
Data released under the ODC-BY 1.0 license — See also our legal information page