Gudmund Skovbjerg Frandsen
Gudmund Skovbjerg Frandsen
Computer Science, Aarhus University
Zweryfikowany adres z cs.au.dk
Tytuł
Cytowane przez
Cytowane przez
Rok
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
134*1999
Dynamic word problems
G Skovbjerg Frandsen, PB Miltersen, S Skyum
Journal of the ACM (JACM) 44 (2), 257-271, 1997
54*1997
Dynamic algorithms: Course notes on van Emde Boas trees (PDF)
GS Frandsen
University of Aarhus, Department of Computer Science, 0
49
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
402005
Lower bounds for dynamic algebraic problems
GS Frandsen, JP Hansen, PB Miltersen
Information and Computation 171 (2), 333-349, 2001
312001
What is an Efficient Implementation of the λ-calculus?
GS Frandsen, C Sturtivant
Conference on Functional Programming Languages and Computer Architecture …, 1991
261991
An extended quadratic Frobenius primality test with average-and worst-case error estimate
IB Damgard, GS Frandsen
Journal of cryptology 19 (4), 489-520, 2006
24*2006
Dynamic matrix rank
GS Frandsen, PF Frandsen
Theoretical computer science 410 (41), 4085-4093, 2009
202009
An arithmetic model of computation equivalent to threshold circuits
J Boyar, G Frandsen, C Sturtivant
Theoretical Computer Science 93 (2), 303-319, 1992
191992
A singular choice for multiple choice
GS Frandsen, MI Schwartzbach
ACM SIGCSE Bulletin 38 (4), 34-38, 2006
152006
Dynamic algorithms for the Dyck languages
GS Frandsen, T Husfeldt, PB Miltersen, T Rauhe, S Skyum
Workshop on Algorithms and Data Structures, 98-108, 1995
151995
Logic programming and substitutions
G Frandsen
International Conference on Fundamentals of Computation Theory, 146-158, 1985
13*1985
Dynamic normal forms and dynamic characteristic polynomial
GS Frandsen, P Sankowski
Theoretical computer science 412 (16), 1470-1483, 2011
112011
On the density of normal bases in finite fields
GS Frandsen
Finite Fields and Their Applications 6 (1), 23-38, 2000
11*2000
Reviewing bounds on the circuit size of the hardest functions
GS Frandsen, PB Miltersen
Information processing letters 95 (2), 354-357, 2005
102005
Some results on uniform arithmetic circuit complexity
GS Frandsen, M Valence, DAM Barrington
Mathematical Systems Theory 27 (2), 105-124, 1994
101994
Binary GCD like algorithms for some complex quadratic rings
S Agarwal, GS Frandsen
International Algorithmic Number Theory Symposium, 57-71, 2004
92004
The computational efficacy of finite-field arithmetic
C Sturtivant, GS Frandsen
Theoretical computer science 112 (2), 291-309, 1993
71993
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
61993
Layout construction: A case study in algorithm engineering
GS Frandsen, J Palsberg, EM Schmidt, S Sjøgaard
DAIMI Report Series 22 (450), 1993
51993
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20