| Publication | Date of Publication | Type |
|---|
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem
Designs, Codes and Cryptography | 2024-10-14 | Paper |
| Hidden stabilizers, the isogeny to endomorphism ring problem and the cryptanalysis of pSIDH | 2024-08-30 | Paper |
| On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829319 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7716603 (Why is no real title available?)
(available as arXiv preprint) | 2023-07-25 | Paper |
scientific article; zbMATH DE number 7378736 (Why is no real title available?)
(available as arXiv preprint) | 2021-08-04 | Paper |
Irreducibility and deterministic \(r\)-th root finding over finite fields
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
On the polynomial parity argument complexity of the combinatorial Nullstellensatz
(available as arXiv preprint) | 2020-05-26 | Paper |
Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
SIAM Journal on Computing | 2019-05-07 | Paper |
Explicit equivalence of quadratic forms over \(\mathbb{F}_q(t)\)
Finite Fields and their Applications | 2018-12-19 | Paper |
Constructive non-commutative rank computation is in deterministic polynomial time
Computational Complexity | 2018-12-10 | Paper |
Constructive non-commutative rank computation is in deterministic polynomial time
Computational Complexity | 2018-12-10 | Paper |
Computing explicit isomorphisms with full matrix algebras over \(\mathbb {F}_q(x)\)
Foundations of Computational Mathematics | 2018-05-18 | Paper |
| Constructive non-commutative rank computation is in deterministic polynomial time | 2018-05-03 | Paper |
Polynomial interpolation and identity testing from high powers over finite fields
Algorithmica | 2018-04-06 | Paper |
| Algorithms based on \(\ast\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing | 2018-03-15 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Journal of Computer and System Sciences | 2017-11-14 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Non-commutative Edmonds' problem and matrix semi-invariants
Computational Complexity | 2017-10-18 | Paper |
| Generalized Wong sequences and their applications to Edmonds' problems | 2017-03-03 | Paper |
Solving systems of diagonal polynomial equations over finite fields
Theoretical Computer Science | 2017-02-06 | Paper |
New bounds on the classical and quantum communication complexity of some graph properties
(available as arXiv preprint) | 2017-01-26 | Paper |
Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract)
Proceedings of the 2000 international symposium on Symbolic and algebraic computation | 2015-11-26 | Paper |
On solving systems of diagonal polynomial equations over finite fields
Frontiers in Algorithmics | 2015-11-12 | Paper |
On solving systems of diagonal polynomial equations over finite fields
Frontiers in Algorithmics | 2015-11-12 | Paper |
| On generating the ring of matrix semi-invariants | 2015-08-06 | Paper |
Generalized Wong sequences and their applications to Edmonds' problems
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Quantum computation of discrete logarithms in semigroups
Journal of Mathematical Cryptology | 2015-01-22 | Paper |
Quantum computation of discrete logarithms in semigroups
Journal of Mathematical Cryptology | 2015-01-22 | Paper |
An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Deterministic polynomial factoring and association schemes
LMS Journal of Computation and Mathematics | 2014-07-23 | Paper |
On the complexity of trial and error for constraint satisfaction problems
Automata, Languages, and Programming | 2014-07-01 | Paper |
Hidden translation and translating coset in quantum computing
SIAM Journal on Computing | 2014-06-04 | Paper |
Hidden translation and translating coset in quantum computing
SIAM Journal on Computing | 2014-06-04 | Paper |
Hidden symmetry subgroup problems
SIAM Journal on Computing | 2014-02-04 | Paper |
Hidden symmetry subgroup problems
SIAM Journal on Computing | 2014-02-04 | Paper |
| Improved algorithms for splitting full matrix algebras. | 2013-06-13 | Paper |
Improved algorithms for splitting full matrix algebras.
(available as arXiv preprint) | 2013-06-13 | Paper |
Splitting full matrix algebras over algebraic number fields.
Journal of Algebra | 2012-09-06 | Paper |
Finding hidden Borel subgroups of the general linear group
Quantum Information & Computation | 2012-09-05 | Paper |
Schemes for deterministic polynomial factoring
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
On the distance between non-isomorphic groups.
European Journal of Combinatorics | 2012-05-04 | Paper |
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
Algorithmica | 2012-04-26 | Paper |
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Mathematics of Computation | 2012-02-17 | Paper |
Deterministic polynomial time algorithms for matrix completion problems
SIAM Journal on Computing | 2011-04-04 | Paper |
Efficient testing of groups
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Hidden translation and orbit coset in quantum computing
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the black-box complexity of Sperner's Lemma
Theory of Computing Systems | 2009-09-02 | Paper |
Simple Lie algebras having extremal elements
Indagationes Mathematicae. New Series | 2009-03-09 | Paper |
scientific article; zbMATH DE number 5372380 (Why is no real title available?)
(available as arXiv preprint) | 2008-11-24 | Paper |
| Constructions for quantum computing with symmetrized gates | 2008-09-12 | Paper |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups
Lecture Notes in Computer Science | 2008-04-15 | Paper |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
STACS 2007 | 2007-09-03 | Paper |
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
STACS 2007 | 2007-09-03 | Paper |
Root shadow spaces
European Journal of Combinatorics | 2007-05-18 | Paper |
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Deciding universality of quantum gates
Journal of Algebra | 2007-04-18 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Root filtration spaces from Lie algebras and abstract root groups
Journal of Algebra | 2006-08-16 | Paper |
EFFICIENT QUANTUM ALGORITHMS FOR SOME INSTANCES OF THE NON-ABELIAN HIDDEN SUBGROUP PROBLEM
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
Deciding finiteness for matrix semigroups over function fields over finite fields. A note on a paper by Rockmore, Tan, and Beals
Israel Journal of Mathematics | 2003-06-09 | Paper |
| scientific article; zbMATH DE number 1569143 (Why is no real title available?) | 2003-04-09 | Paper |
Treating the Exceptional Cases of the MeatAxe
Experimental Mathematics | 2001-07-11 | Paper |
Treating the Exceptional Cases of the MeatAxe
Experimental Mathematics | 2001-07-11 | Paper |
Finding the radical of matrix algebras using Fitting decompositions
Journal of Pure and Applied Algebra | 1999-08-22 | Paper |
| scientific article; zbMATH DE number 1253966 (Why is no real title available?) | 1999-05-30 | Paper |
| scientific article; zbMATH DE number 1276826 (Why is no real title available?) | 1999-04-20 | Paper |
| scientific article; zbMATH DE number 1276816 (Why is no real title available?) | 1999-04-20 | Paper |
Computing Levi decompositions in Lie algebras
Applicable Algebra in Engineering, Communication and Computing | 1998-04-05 | Paper |
Finding the radical of an algebra of linear transformations
Journal of Pure and Applied Algebra | 1997-11-30 | Paper |
Computing Cartan subalgebras of Lie algebras
Applicable Algebra in Engineering, Communication and Computing | 1997-01-05 | Paper |
Lattice basis reduction for indefinite forms and an application
Discrete Mathematics | 1996-10-08 | Paper |
| scientific article; zbMATH DE number 871949 (Why is no real title available?) | 1996-06-18 | Paper |
Decomposition of algebras over \(F_ q(X_ 1,\dots,X_ m)\)
Applicable Algebra in Engineering, Communication and Computing | 1995-05-28 | Paper |
Finding maximal orders in semisimple algebras over \(\mathbb{Q}\)
Computational Complexity | 1994-08-07 | Paper |
