| Publication | Date of Publication | Type |
|---|
Dynamic algorithms for the Dyck languages
Lecture Notes in Computer Science | 2022-12-16 | Paper |
The computational complexity of some problems of linear algebra (extended abstract)
Lecture Notes in Computer Science | 2022-11-09 | Paper |
Dynamic maintenance of majority information in constant time per update
Information Processing Letters | 2016-05-26 | Paper |
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science | 2011-03-29 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2010-04-20 | Paper |
An extended quadratic Frobenius primality test with average and worst case error estimates.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Reviewing bounds on the circuit size of the hardest functions
Information Processing Letters | 2009-12-04 | Paper |
Dynamic matrix rank
Theoretical Computer Science | 2009-09-29 | Paper |
Dynamic Matrix Rank
Automata, Languages and Programming | 2009-03-12 | Paper |
A New GCD Algorithm for Quadratic Number Rings with Unique Factorization
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Dynamic Normal Forms and Dynamic Characteristic Polynomial
Automata, Languages and Programming | 2008-08-28 | Paper |
Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers
Journal of Symbolic Computation | 2007-10-19 | Paper |
An extended quadratic Frobenius primality test with average- and worst-case error estimate
Journal of Cryptology | 2007-01-24 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2005-08-12 | Paper |
On reducing a system of equations to a single equation
Proceedings of the 2004 international symposium on Symbolic and algebraic computation | 2005-03-14 | Paper |
Lower bounds for dynamic algebraic problems
Information and Computation | 2003-01-14 | Paper |
On the density of normal bases in finite fields
Finite Fields and their Applications | 2000-08-14 | Paper |
| scientific article; zbMATH DE number 1339958 (Why is no real title available?) | 2000-05-04 | Paper |
The computational complexity of some problems of linear algebra
Journal of Computer and System Sciences | 2000-02-08 | Paper |
Some results on uniform arithmetic circuit complexity
Mathematical Systems Theory | 1994-11-13 | Paper |
The computational efficacy of finite-field arithmetic
Theoretical Computer Science | 1993-05-24 | Paper |
An arithmetic model of computation equivalent to threshold circuits
Theoretical Computer Science | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 3965412 (Why is no real title available?) | 1985-01-01 | Paper |
