Department of Computer Science

Aarhus University Seal
You are here: Department of Computer Science Research Publications

Publications

Sort by: Date | Author | Title

Hansen, K. A., Miltersen, P. B. & Vinay, V. (2002). Circuits on Cylinders. Electronic Colloquium on Computational Complexity, (TR02-066).
Damgård, I. B. & Frandsen, G. S. (2001). An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates.
Frandsen, G. S., Hansen, J. P. & Miltersen, P. B. (2001). Lower Bounds for Dynamic Algebraic Problems. Information and Computation, 171(2), 333-349. https://doi.org/10.1006/inco.2001.3046
Frandsen, G. S. (2000). On the Density of Normal Bases in Finite Fields. Finite Fields and Their Applications, 6(1), 23-38. https://doi.org/10.1006/ffta.1999.0263
Frandsen, G. S., Hansen, J. P. & Miltersen, P. B. (1999). Lower bounds for dynamic algebraic problems. Lecture Notes in Computer Science, 362-372. https://doi.org/10.1007/3-540-49116-3
Skyum, S., Frandsen, G. S., Miltersen, P. B. & Binderup, P. G. (1999). The Complexity of Identifying Large Equivalence Classes. Fundamenta Informaticae, 38(1-2), 25-37. https://doi.org/10.3233/FI-1999-381203
Buss, J. F., Frandsen, G. S. & Shallit, J. O. (1999). The Computational Complexity of Some Problems of Linear Algebra. Journal of Computer and System Sciences, 58(3), 572-596. https://doi.org/10.1006/jcss.1998.1608
Frandsen, G. S. & Skyum, S. (1997). Dynamic maintenance of majority information in constant time per update. Information Processing Letters, 63(2), 75-78. https://doi.org/10.1016/S0020-0190(97)00100-2
Frandsen, G. S., Miltersen, P. B. & Skyum, S. (1997). Dynamic word problems. Journal of the ACM, 44(2), 257-271. https://doi.org/10.1145/256303.256309
Buss, J. F., Frandsen, G. S. & Shallit, J. O. (1997). The computational complexity of some problems of linear algebra. In R. Reischuk & M. Morvan (Eds.), STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science Lübeck, Germany February 27–March 1, 1997 Proceedings (pp. 451-462). Springer. https://doi.org/10.1007/BFb0023480
Frandsen, G. S., Husfeldt, T., Miltersen, P. B., Rauhe, T. & Skyum, S. (1995). Dynamic algorithms for the Dyck languages. In S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (Eds.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (pp. 98-108). Springer. https://doi.org/10.1007/3-540-60220-8_54
Frandsen, G. S., Valence, M. & Barrington, D. A. M. (1994). Some results on uniform arithmetic circuit complexity. Theory of Computing Systems, 27(2), 105-124. https://doi.org/10.1007/BF01195199
Frandsen, G. S., Miltersen, P. B. & Skyum, S. (1993). Dynamic Word Problems. In 34th Annual Symposium on Foundations of Computer Science, 1993. Proceedings. (pp. 470-479). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1993.366840
Frandsen, G. S., Palsberg, J., Schmidt, E. M. & Sjøgaard, S. (1993). Layout Construction: A Case Study In Algorithm Engineering. Department of Computer Science, Aarhus University.
Frandsen, G. S., Miltersen, P. B. & Skyum, S. (1993). The complexity of finding replicas using equality tests. In A. M. Borzyszkowsji & S. Sokolowski (Eds.), Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS'93 Gdansk, Poland, August 30-September 3, 1993 Proceedings (pp. 463-472). Springer. https://doi.org/10.1007/3-540-57182-5_38
Sturtivant, C. & Frandsen, G. S. (1993). The computational efficacy of finite-field arithmetic. Theoretical Computer Science, 112(2), 291-309. https://doi.org/10.1016/0304-3975(93)90022-L
Boyar, J., Frandsen, G. S. & Sturtivant, C. (1992). An arithmetic model of computation equivalent to threshold circuits. Theoretical Computer Science, 93(2), 303-319. https://doi.org/10.1016/0304-3975(92)90335-D
Frandsen, G. S. (1991). Parallel Construction of Irreducible Polynomials. Department of Computer Science, Aarhus University.
Frandsen, G. S. & Sturtivant, C. (1991). What is an efficient implementation of the λ-calculus? In J. Hughes (Ed.), Functional Programming Languages and Computer Architecture: 5th ACM Conference Cambridge, MA, USA, August 26–30, 1991 Proceedings (pp. 289-312). Springer. https://doi.org/10.1007/3540543961_14
Frandsen, G. S. (1985). A Denotational Semantics for Logic Programming. Department of Computer Science, Aarhus University.
Frandsen, G. S. (1985). Learnability. Department of Computer Science, Aarhus University.
Frandsen, G. S. (1985). Logic programming and substitutions. In L. Budach (Ed.), Fundamentals of Computation Theory: FCT '85 Cottbus, GDR, September 9–13, 1985 (pp. 146-158). Springer. https://doi.org/10.1007/BFb0028799

Displaying results 151 to 172 out of 172

Previous

1

2

3

4

Sort by: Date | Author | Title

Revised 01.09.2025