The SCEAS System
| |||||||

## Search the dblp DataBase
Gudmund Skovbjerg Frandsen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Saurabh Agarwal, Gudmund Skovbjerg Frandsen
**Binary GCD Like Algorithms for Some Complex Quadratic Rings.**[Citation Graph (0, 0)][DBLP] ANTS, 2004, pp:57-71 [Conf] - Ivan Damgård, Gudmund Skovbjerg Frandsen
**Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers.**[Citation Graph (0, 0)][DBLP] FCT, 2003, pp:109-117 [Conf] - Ivan Damgård, Gudmund Skovbjerg Frandsen
**An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates.**[Citation Graph (0, 0)][DBLP] FCT, 2003, pp:118-131 [Conf] - Gudmund Skovbjerg Frandsen
**Logic programming and substitutions.**[Citation Graph (0, 0)][DBLP] FCT, 1985, pp:146-158 [Conf] - Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
**Dynamic Word Problems**[Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:470-479 [Conf] - Gudmund Skovbjerg Frandsen, Carl Sturtivant
**What is an Efficient Implementation of the \lambda-calculus?**[Citation Graph (0, 0)][DBLP] FPCA, 1991, pp:289-312 [Conf] - Gudmund Skovbjerg Frandsen, Peter Frands Frandsen
**Dynamic Matrix Rank.**[Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:395-406 [Conf] - Gudmund Skovbjerg Frandsen, Igor Shparlinski
**On reducing a system of equations to a single equation.**[Citation Graph (0, 0)][DBLP] ISSAC, 2004, pp:163-166 [Conf] - Saurabh Agarwal, Gudmund Skovbjerg Frandsen
**A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:30-42 [Conf] - Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
**The Complexity of Finding Replicas Using Equality Tests.**[Citation Graph (0, 0)][DBLP] MFCS, 1993, pp:463-472 [Conf] - Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
**The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STACS, 1997, pp:451-462 [Conf] - Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
**Lower Bounds for Dynamic Algebraic Problems.**[Citation Graph (0, 0)][DBLP] STACS, 1999, pp:362-372 [Conf] - Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum
**Dynamic Algorithms for the Dyck Languages.**[Citation Graph (0, 0)][DBLP] WADS, 1995, pp:98-108 [Conf] - Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
**Reviewing Bounds on the Circuit Size of the Hardest Functions**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:032, pp:- [Journal] - Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
**The Computational Complexity of Some Problems of Linear Algebra**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:9, pp:- [Journal] - Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup
**The Complexity of Identifying Large Equivalence Classes.**[Citation Graph (0, 0)][DBLP] Fundam. Inform., 1999, v:38, n:1-2, pp:25-37 [Journal] - Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
**Lower Bounds for Dynamic Algebraic Problems.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2001, v:171, n:2, pp:333-349 [Journal] - Gudmund Skovbjerg Frandsen, Peter Bro Miltersen
**Reviewing bounds on the circuit size of the hardest functions.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:95, n:2, pp:354-357 [Journal] - Gudmund Skovbjerg Frandsen, Sven Skyum
**Dynamic Maintenance of Majority Information in Constant Time per Update.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:2, pp:75-78 [Journal] - Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum
**Dynamic word problems.**[Citation Graph (0, 0)][DBLP] J. ACM, 1997, v:44, n:2, pp:257-271 [Journal] - Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
**The Computational Complexity of Some Problems of Linear Algebra.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1999, v:58, n:3, pp:572-596 [Journal] - Ivan Damgård, Gudmund Skovbjerg Frandsen
**An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2006, v:19, n:4, pp:489-520 [Journal] - Ivan Damgård, Gudmund Skovbjerg Frandsen
**Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers.**[Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2005, v:39, n:6, pp:643-652 [Journal] - Gudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington
**Some Results on Uniform Arithmetic Circuit Complexity.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1994, v:27, n:2, pp:105-124 [Journal] - Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant
**An Arithmetic Model of Computation Equivalent to Threshold Circuits.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1992, v:93, n:2, pp:303-319 [Journal] - Carl Sturtivant, Gudmund Skovbjerg Frandsen
**The Computational Efficacy of Finite-Field Arithmetic.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:112, n:2, pp:291-309 [Journal] **Dynamic Normal Forms and Dynamic Characteristic Polynomial.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |