| Date | Author/Title | | Document Type |
|---|
| 2014 | Arora, Manuel and Ivanyos, Gábor and Karpinski, Marek and Saxena, Nitin
Deterministic polynomial factoring and association schemes | | ISI Article |
| 2014 | Friedl, Katalin and Ivanyos, Gábor and Magniez, F. and Santha, M. and Sen, P.
Hidden translation and translating coset in quantum computing |  | ISI Article |
| 2014 | Decker, Thomas and Hoyer, Peter and Ivanyos, Gábor and Santha, Miklos
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems | | ISI Article |
| 2013 | Decker, Thomas and Ivanyos, Gábor and Santha, Miklos and Wocjan, Pawel
Hidden symmetry subgroup problems | | ISI Article |
| 2012 | Ivanyos, Gábor
Finding hidden Borel subgroups of the general linear group | | ISI Article |
| 2012 | Ivanyos, Gábor and Le, Gall and Yoshida, Y
On the distance between non-isomorphic groups | | ISI Article |
| 2012 | Ivanyos, Gábor and Karpinski, M and Rónyai, Lajos and Saxena, N
Trading GRH for algebra: Algorithms for factoring polynomials and related structures | | ISI Article |
| 2012 | Ivanyos, Gábor and Karpinski, Marek and Rónyai, Lajos and Saxena, Nitin
Trading GRH for algebra: algorithms for factoring polynomials and related structures | | ISI Article |
| 2012 | Ivanyos, Gábor and Sanselme, L and Santha, M
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups | | ISI Article |
| 2010 | Ivanyos, Gábor and Karpinski, Marek and Saxena, Nitin
Deterministic polynomial time algorithms for matrix completion problems | | ISI Article |
| 2009 | Friedl, Katalin and Ivanyos, Gábor and Santha, Miklos and Verhoeven, Yves F.
On the black-box complexity of Sperner's Lemma | | ISI Article |
| 2008 | Ivanyos, Gábor and Nagy, Attila B. and Rónyai, Lajos
Constructions for quantum computing with symmetrized gates | | ISI Article |
| 2008 | Ivanyos, Gábor
On solving systems of random linear disequations | | ISI Article |
| 2008 | Cohen, Arjeh M. and Ivanyos, Gábor and Roozemond, Dan
Simple Lie algebras having extremal elements | | ISI Article |
| 2007 | Ivanyos, Gábor
Deciding universality of quantum gates | | ISI Article |
| 2007 | Cohen, Arjeh M. and Ivanyos, Gábor
Root shadow spaces | | ISI Article |
| 2006 | Friedl, K. and Ivanyos, Gábor and Santha, M. and Verhoeven, YF
Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes | | ISI Article |
| 2006 | Cohen, AM and Ivanyos, Gábor
Root filtration spaces from Lie algebras and abstract root groups | | ISI Article |
| Date | Author/Title | | Document Type |
|---|
| 2024 | Imran, Muhammad and Ivanyos, Gábor
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem | | Article |
| 2024 | Imran, Muhammad and Ivanyos, Gábor
Zero sum subsequences and hidden subgroups | | Article |
| 2023 | Ivanyos, Gábor and Joux, Antoine and Santha, Miklos
Discrete logarithm and Diffie-Hellman problems in identity black-box groups | | Article |
| 2022 | Imran, M and Ivanyos, Gábor
An Exact Quantum Hidden Subgroup Algorithm and Applications to Solvable Groups | | Article |
| 2022 | Ivanyos, Gábor and Pereszlényi, Attila and Rónyai, Lajos
Some Complexity Results Involving Quantum Computing | | Article |
| 2022 | Ivanyos, Gábor and Mittal, T and Qiao, Y
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras | | Article |
| 2019 | Ivanyos, Gábor and Qiao, Y
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing | | Article |
| 2019 | Ivanyos, Gábor and Kutas, Péter and Rónyai, Lajos
Explicit equivalence of quadratic forms over Fq ( t ) | | Article |
| 2018 | Ivanyos, Gábor and Rónyai, Lajos
Chevalley-Warning Theorem in Quantum Computing | | Article |
| 2018 | Ivanyos, Gábor and Kutas, Péter and Rónyai, Lajos
Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x) | | Article |
| 2018 | Ivanyos, Gábor and Qiao, Y. and Subrahmanyam, K.V.
Constructive non-commutative rank computation is in deterministic polynomial time | | Article |
| 2018 | Ivanyos, Gábor and Kulkarni, R and Qiao, YM and Santha, M and Sundaram, A
On the complexity of trial and error for constraint satisfaction problems | | Article |
| 2018 | Ivanyos, Gábor and Karpinski, M and Santha, M and Saxena, N and Shparlinski, IE
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields | | Article |
| 2017 | Ivanyos, Gábor and Qiao, Y and Subrahmanyam, KV
Non-commutative Edmonds’ problem and matrix semi-invariants | | Article |
| 2017 | Ivanyos, Gábor and Santha, M
Solving systems of diagonal polynomial equations over finite fields | | Article |
| 2015 | Ivanyos, Gábor and Karpinski, M and Qiao, Y and Santha, M
Generalized Wong sequences and their applications to Edmonds' problems | | Article |
| 2014-07-08 | Childs, Andrew M. and Ivanyos, Gábor
Quantum computation of discrete logarithms in semigroups | | Article |
| 2014 | Arora, Manuel and Ivanyos, Gábor and Karpinski, Marek and Saxena, Nitin
Deterministic polynomial factoring and association schemes | | Article |
| 2014 | Friedl, Katalin and Ivanyos, Gábor and Magniez, Frédéric and Santha, Miklos and Sen, Pranab
Hidden translation and translating coset in quantum computing | | Article |
| 2014 | Ivanyos, Gábor and Kulkarni, Raghav and Qiao, Youming and Santha, Miklos and Sundaram, Aarthi
On the complexity of trial and error for constraint satisfaction problems | | Article |
| 2014 | Decker, Thomas and Høyer, Peter and Ivanyos, Gábor and Santha, Miklos
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems | | Article |
| 2014 | Childs, Andrew M. and Ivanyos, Gábor
Quantum computation of discrete logarithms in semigroups | | Article |
| 2013 | Ivanyos, Gábor and Lelkes, Á and Rónyai, Lajos
Improved algorithms for splitting full matrix algebras | | Article |
| 2005 | Friedl, K. and Ivanyos, Gábor and Santha, M. and Verhoeven, YF
On the black-box complexity of Sperner's Lemma | | Article |
| 2005 | Ivanyos, Gábor and Massar, S. and Nagy, AB
Quantum computing on lattices using global two-qubit gates | | Article |
| 2003 | Ivanyos, Gábor and Magniez, F. and Santha, M.
Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem | | Article |
| 2002 | Benczúr, András and Ivanyos, Gábor and Rónyai, Lajos
Algebra and computation at SZTAKI | | Article |
| 2001 | Ivanyos, Gábor
Deciding finiteness for matrix semigroups over function fields over finite fields | | Article |
| 2000 | Ivanyos, Gábor and Lux, K.
Treating the exceptional cases of the MeatAxe | | Article |
| 1999 | Ivanyos, Gábor
Finding the radical of matrix algebras using fitting decompositions | | Article |
| 1997 | De Graaf, W. and Ivanyos, Gábor and Küronya, A. and Rónyai, Lajos
Computing Levi decompositions in Lie algebras | | Article |
| 1997 | Cohen, AM and Ivanyos, Gábor and Wales, DB
Finding the radical of an algebra of linear transformations | | Article |
| 1996 | De Graaf, W. and Ivanyos, Gábor and Rónyai, Lajos
Computing Cartan subalgebras in Lie algebras | | Article |
| 1996 | Ivanyos, Gábor and Szántó, Á.
Lattice basis reduction for indefinite forms and an application | | Article |
| 1994 | Ivanyos, Gábor and Rónyai, Lajos and Szántó, Á.
Decomposition of algebras over Fq(X1,...,Xm) | | Article |
| 1993 | Ivanyos, Gábor and Rónyai, Lajos
Finding maximal orders in semisimple algebras over Q | | Article |
| Decker, Thomas and Ivanyos, Gábor and Kulkarni, Raghav and Qiao, Youming and Santha, Miklos
An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group | | Article |
| Date | Author/Title | | Document Type |
|---|
| 2023 | Ivanyos, Gábor and Qiao, Youming
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions | | Book Section |
| 2018 | Ivanyos, Gábor and Qiao, Y.
Algorithms based on ∗-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing | | Book Section |
| 2018 | Ivanyos, Gábor and Prakash, A and Santha, M
On learning linear functions from subset and its applications in quantum computing | | Book Section |
| 2017 | Ivanyos, Gábor and Qiao, Y and Subrahmanyam, K V
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time | | Book Section |
| 2017 | Belovs, A and Ivanyos, Gábor and Qiao, Y and Santha, M and Yang, S
On the polynomial parity argument complexity of the combinatorial nullstellensatz | | Book Section |
| 2015 | Ivanyos, Gábor and Santha, M.
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields | | Book Section |
| 2015 | Ivanyos, Gábor and Santha, M
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields | | Book Section |
| 2014 | Ivanyos, Gábor and Karpisnki, Marek and Qiao, Youming and Santha, Miklos
Generalized Wong sequences and their applications to Edmonds' problems | | Book Section |
| 2007 | Ivanyos, Gábor and Rónyai, Lajos
Algebra | | Book Section |
| 2005 | Ivanyos, Gábor and Rónyai, Lajos
Algebra | | Book Section |
| 2000 | De Graaf, WA and Ivanyos, Gábor
Finding splitting elements and maximal tori in matrix algebras | | Book Section |
| 1999 | Ivanyos, Gábor and Rónyai, Lajos
Computations in associative and Lie algebras | | Book Section |
| Ivanyos, Gábor and Karpinski, Marek and Qiao, Youming and Santha, Miklos
Generalized Wong sequences and their applications to Edmonds' problems | | Book Section |
| Date | Author/Title | | Document Type |
|---|
| 2012 | Ivanyos, Gábor and Klauck, H and Lee, T and Santha, M and de, Wolf
New bounds on the classical and quantum communication complexity of some graph properties | | Conference or Workshop Item |
| 2009-07-28 | Ivanyos, Gábor and Karpinski, Marek and Saxena, Nitin
Schemes for deterministic polynomial factoring | | Conference or Workshop Item |
| 2007 | Ivanyos, Gábor and Sanselme, Luc and Santha, Miklos
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups | | Conference or Workshop Item |
| 2005 | Friedl, K. and Ivanyos, Gábor and Santha, M.
Efficient testing of groups | | Conference or Workshop Item |
| 2003 | Friedl, K. and Ivanyos, Gábor and Magniez, F. and Santha, M. and Sen, P.
Hidden translation and orbit coset in quantum computing | | Conference or Workshop Item |
| 2001 | Ivanyos, Gábor and Magniez, F. and Sántha, M.
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem | | Conference or Workshop Item |
| 2000 | Ivanyos, Gábor
Fast randomized algorithms for the structure of matrix algebras over finite fields | | Conference or Workshop Item |
| 1997 | Christov, A. and Ivanyos, Gábor and Karpinski, M.
Polynomial time algorithms for modules over finite dimensional algebras | | Conference or Workshop Item |
| 1996 | Babai, L. and Beals, R. and Cai, J-Y and Ivanyos, Gábor and Luks, EM
Multiplicative equations over commuting matrices | | Conference or Workshop Item |
