|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6 occurrences of 6 keywords
|
|
|
|
|
Results
Found 31 publication records. Showing 31 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gudmund Skovbjerg Frandsen, Piotr Sankowski |
Dynamic normal forms and dynamic characteristic polynomial.  |
Theor. Comput. Sci.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Peter Frands Frandsen |
Dynamic matrix rank. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Piotr Sankowski |
Dynamic Normal Forms and Dynamic Characteristic Polynomial. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Damgård, Gudmund Skovbjerg Frandsen |
An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate. |
J. Cryptology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Michael I. Schwartzbach |
A singular choice for multiple choice. |
SIGCSE Bulletin |
2006 |
DBLP DOI BibTeX RDF |
grading scales, multiple choice, scoring strategies, theory |
| 1 | Gudmund Skovbjerg Frandsen, Peter Frands Frandsen |
Dynamic Matrix Rank. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Saurabh Agarwal, Gudmund Skovbjerg Frandsen |
A New GCD Algorithm for Quadratic Number Rings with Unique Factorization. |
LATIN |
2006 |
DBLP DOI BibTeX RDF |
quadratic number ring, quadratic form reduction, gcd |
| 1 | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen |
Reviewing bounds on the circuit size of the hardest functions. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen |
Reviewing Bounds on the Circuit Size of the Hardest Functions |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ivan Damgård, Gudmund Skovbjerg Frandsen |
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers. |
J. Symb. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Saurabh Agarwal, Gudmund Skovbjerg Frandsen |
Binary GCD Like Algorithms for Some Complex Quadratic Rings. |
ANTS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Igor Shparlinski |
On reducing a system of equations to a single equation. |
ISSAC |
2004 |
DBLP DOI BibTeX RDF |
system of equations |
| 1 | Ivan Damgård, Gudmund Skovbjerg Frandsen |
An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Damgård, Gudmund Skovbjerg Frandsen |
Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers. |
FCT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen |
Lower Bounds for Dynamic Algebraic Problems. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Damgård, Gudmund Skovbjerg Frandsen |
An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates. |
IACR Cryptology ePrint Archive |
2001 |
DBLP BibTeX RDF |
|
| 1 | Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup |
The Complexity of Identifying Large Equivalence Classes. |
Fundam. Inform. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit |
The Computational Complexity of Some Problems of Linear Algebra. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen |
Lower Bounds for Dynamic Algebraic Problems. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Sven Skyum |
Dynamic Maintenance of Majority Information in Constant Time per Update. |
Inf. Process. Lett. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit |
The Computational Complexity of Some Problems of Linear Algebra |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum |
Dynamic word problems. |
J. ACM |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit |
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract). |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum |
Dynamic Algorithms for the Dyck Languages. |
WADS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington |
Some Results on Uniform Arithmetic Circuit Complexity. |
Mathematical Systems Theory |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Carl Sturtivant, Gudmund Skovbjerg Frandsen |
The Computational Efficacy of Finite-Field Arithmetic. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum |
The Complexity of Finding Replicas Using Equality Tests. |
MFCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum |
Dynamic Word Problems |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
dynamic word problems, fixed finite monoid, decision assignment tree model, complexity, data type, algebraic properties |
| 1 | Joan Boyar, Gudmund Skovbjerg Frandsen, Carl Sturtivant |
An Arithmetic Model of Computation Equivalent to Threshold Circuits. |
Theor. Comput. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen, Carl Sturtivant |
What is an Efficient Implementation of the \lambda-calculus? |
FPCA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Gudmund Skovbjerg Frandsen |
Logic programming and substitutions. |
FCT |
1985 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #31 of 31 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")