Gudmund S. Frandsen

Available identifiers

zbMath Open frandsen.gudmund-skovbjergWikidataQ102339680 ScholiaQ102339680MaRDI QIDQ633625

List of research outcomes

Publication	Date of Publication	Type
Dynamic algorithms for the Dyck languages	2022-12-16	Paper
The computational complexity of some problems of linear algebra	2022-11-09	Paper
Dynamic maintenance of majority information in constant time per update	2016-05-26	Paper
Dynamic normal forms and dynamic characteristic polynomial	2011-03-29	Paper
Fundamentals of Computation Theory	2010-04-20	Paper
An extended quadratic Frobenius primality test with average and worst case error estimates.	2010-04-20	Paper
Reviewing bounds on the circuit size of the hardest functions	2009-12-04	Paper
Dynamic matrix rank	2009-09-29	Paper
Dynamic Matrix Rank	2009-03-12	Paper
A New GCD Algorithm for Quadratic Number Rings with Unique Factorization	2008-09-18	Paper
Dynamic Normal Forms and Dynamic Characteristic Polynomial	2008-08-28	Paper
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers	2007-10-19	Paper
An extended quadratic Frobenius primality test with average- and worst-case error estimate	2007-01-24	Paper
Algorithmic Number Theory	2005-08-12	Paper
On reducing a system of equations to a single equation	2005-03-14	Paper
Lower bounds for dynamic algebraic problems	2003-01-14	Paper
On the density of normal bases in finite fields	2000-08-14	Paper
https://portal.mardi4nfdi.de/entity/Q4265621	2000-05-04	Paper
The computational complexity of some problems of linear algebra	2000-02-08	Paper
Some results on uniform arithmetic circuit complexity	1994-11-13	Paper
The computational efficacy of finite-field arithmetic	1993-05-24	Paper
An arithmetic model of computation equivalent to threshold circuits	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3732937	1985-01-01	Paper

Research outcomes over time

This page was built for person: Gudmund S. Frandsen