Gudmund Skovbjerg Frandsen

Citado por

	Total	Desde 2020
Citas	615	163
Índice h	13	5
Índice i10	15	4

1987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420253 10 2 4 3 4 8 3 11 7 11 7 9 5 5 11 18 20 16 21 21 20 19 16 23 22 20 13 19 18 32 29 24 33 26 60 19 1

Coautores

Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityDirección de correo verificada de cs.au.dk
Jeffrey ShallitProfessor Emeritus of Computer Science, University of WaterlooDirección de correo verificada de cs.uwaterloo.ca
Sven SkyumReader emeritus at Department of Computer Science, University of AarhusDirección de correo verificada de cs.au.dk
Ivan DamgårdProfessor of Computer Science, Aarhus UniversityDirección de correo verificada de cs.au.dk
Johan P. HansenDepartment of Mathematics, Aarhus UniversityDirección de correo verificada de math.au.dk
Peter Frands FrandsenDirección de correo verificada de partisiablockchain.com
Joan BoyarProfessor Emerita of Computer Science, University of Southern DenmarkDirección de correo verificada de imada.sdu.dk
Piotr SankowskiUniversity of Warsaw, MIM Solutions,Dirección de correo verificada de mimuw.edu.pl
Thore HusfeldtIT University of CopenhagenDirección de correo verificada de itu.dk
Michael SchwartzbachProfessor of Computer Science, Aarhus UniversityDirección de correo verificada de cs.au.dk
Jens PalsbergUniversity of California, Los Angeles (UCLA)Dirección de correo verificada de ucla.edu
Igor ShparlinskiUNSWDirección de correo verificada de unsw.edu.au

Seguir

Gudmund Skovbjerg Frandsen

formerly Aarhus University

Dirección de correo verificada de cs.au.dk


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
The computational complexity of some problems of linear algebra JF Buss, GS Frandsen, JO Shallit Journal of Computer and System Sciences 58 (3), 572-596, 1999	207*	1999
Dynamic word problems G Skovbjerg Frandsen, PB Miltersen, S Skyum Journal of the ACM (JACM) 44 (2), 257-271, 1997	68*	1997
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers IB Damgård, GS Frandsen Journal of Symbolic Computation 39 (6), 643-652, 2005	46	2005
Lower bounds for dynamic algebraic problems GS Frandsen, JP Hansen, PB Miltersen Information and Computation 171 (2), 333-349, 2001	32	2001
What is an Efficient Implementation of the λ-calculus? GS Frandsen, C Sturtivant Functional Programming Languages and Computer Architecture: 5th ACM …, 1991	25	1991
An extended quadratic Frobenius primality test with average-and worst-case error estimate IB Damgard, GS Frandsen Journal of Cryptology 19, 489-520, 2006	24*	2006
Dynamic matrix rank GS Frandsen, PF Frandsen Theoretical computer science 410 (41), 4085-4093, 2009	22	2009
Dynamic algorithms for the Dyck languages GS Frandsen, T Husfeldt, PB Miltersen, T Rauhe, S Skyum Algorithms and Data Structures: 4th International Workshop, WADS'95 Kingston …, 1995	21	1995
A singular choice for multiple choice GS Frandsen, MI Schwartzbach ACM SIGCSE Bulletin 38 (4), 34-38, 2006	19	2006
Reviewing bounds on the circuit size of the hardest functions GS Frandsen, PB Miltersen Information processing letters 95 (2), 354-357, 2005	19	2005
An arithmetic model of computation equivalent to threshold circuits J Boyar, G Frandsen, C Sturtivant Theoretical Computer Science 93 (2), 303-319, 1992	19	1992
On the density of normal bases in finite fields GS Frandsen Finite Fields and Their Applications 6 (1), 23-38, 2000	14*	2000
Some results on uniform arithmetic circuit complexity GS Frandsen, M Valence, DA Mix Barrington Mathematical Systems Theory 27, 105-124, 1994	13	1994
Logic programming and substitutions G Frandsen Fundamentals of Computation Theory: FCT'85 Cottbus, GDR, September 9–13 …, 1985	13*	1985
Dynamic normal forms and dynamic characteristic polynomial GS Frandsen, P Sankowski Theoretical computer science 412 (16), 1470-1483, 2011	10	2011
Binary GCD like algorithms for some complex quadratic rings S Agarwal, GS Frandsen International Algorithmic Number Theory Symposium, 57-71, 2004	9	2004
The computational efficacy of finite-field arithmetic C Sturtivant, GS Frandsen Theoretical computer science 112 (2), 291-309, 1993	9	1993
Dynamic algorithms: Course notes on van Emde Boas trees (PDF) GS Frandsen University of Aarhus, Department of Computer Science, 0	8
The complexity of finding replicas using equality tests GS Frandsen, PB Miltersen, S Skyum International Symposium on Mathematical Foundations of Computer Science, 463-472, 1993	6	1993
A denotational semantics for logic programming GS Frandsen DAIMI Report Series, 1985	6	1985

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores