Gudmund Skovbjerg Frandsen

Piotr Sankowski

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2006

A singular choice for multiple choice.

[BibT_eX]

[DOI]

Michael I. Schwartzbach

ACM SIGCSE Bull., 2006

An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate.

[BibT_eX]

[DOI]

J. Cryptol., 2006

A New GCD Algorithm for Quadratic Number Rings with Unique Factorization.

[BibT_eX]

[DOI]

Saurabh Agarwal

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Dynamic Matrix Rank.

[BibT_eX]

[DOI]

Peter Frands Frandsen

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

Reviewing Bounds on the Circuit Size of the Hardest Functions

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

2004

On reducing a system of equations to a single equation.

[BibT_eX]

[DOI]

Igor E. Shparlinski

Proceedings of the Symbolic and Algebraic Computation, 2004

Binary GCD Like Algorithms for Some Complex Quadratic Rings.

[BibT_eX]

[DOI]

Saurabh Agarwal

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003

An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2001

An Extended Quadratic Frobenius Primality Test with Average Case Error Estimates.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2001

1999

The Complexity of Identifying Large Equivalence Classes.

[BibT_eX]

[DOI]

Peter G. Binderup

Fundam. Informaticae, 1999

Lower Bounds for Dynamic Algebraic Problems.

[BibT_eX]

[DOI]

Johan P. Hansen

Proceedings of the STACS 99, 1999

1997

Dynamic Maintenance of Majority Information in Constant Time per Update.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

The Computational Complexity of Some Problems of Linear Algebra

[BibT_eX]

[DOI]

Jonathan F. Buss

Jeffrey O. Shallit

Electron. Colloquium Comput. Complex., 1997

The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract).

[BibT_eX]

[DOI]

Jonathan F. Buss

Jeffrey O. Shallit

Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1995

Dynamic Algorithms for the Dyck Languages.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

Some Results on Uniform Arithmetic Circuit Complexity.

[BibT_eX]

[DOI]

Mark Valence

David A. Mix Barrington

Math. Syst. Theory, 1994

1993

The Computational Efficacy of Finite-Field Arithmetic.

[BibT_eX]

[DOI]

Carl Sturtivant

Theor. Comput. Sci., 1993

The Complexity of Finding Replicas Using Equality Tests.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Dynamic Word Problems

[BibT_eX]

[DOI]

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

An Arithmetic Model of Computation Equivalent to Threshold Circuits.

[BibT_eX]

[DOI]

Joan Boyar

Carl Sturtivant

Theor. Comput. Sci., 1992

1991

What is an Efficient Implementation of the \lambda-calculus?

[BibT_eX]

[DOI]

Carl Sturtivant

Proceedings of the Functional Programming Languages and Computer Architecture, 1991

1985

Logic programming and substitutions.

[BibT_eX]

[DOI]