Gábor Ivanyos

According to our database, Gábor Ivanyos authored at least 60 papers between 1993 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem.

Muhammad Imran, Gábor Ivanyos

Des. Codes Cryptogr., October, 2024

Zero sum subsequences and hidden subgroups.

Muhammad Imran, Gábor Ivanyos

Quantum Inf. Process., January, 2024

Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits.

Jonathan Allcock, João F. Doriguello, Gábor Ivanyos, Miklos Santha

CoRR, 2024

Faster Isomorphism Testing of p-Groups of Frattini Class 2.

Gábor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, Chuanqi Zhang

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH.

Mingjie Chen, Muhammad Imran, Gábor Ivanyos, Péter Kutas, Antonin Leroux, Christophe Petit

IACR Cryptol. ePrint Arch., 2023

On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions.

Gábor Ivanyos, Youming Qiao

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

An exact quantum hidden subgroup algorithm and applications to solvable groups.

Muhammad Imran, Gábor Ivanyos

Quantum Inf. Comput., 2022

Some Complexity Results Involving Quantum Computing.

Gábor Ivanyos, Attila Pereszlényi, Lajos Rónyai

ERCIM News, 2022

Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras.

Gábor Ivanyos, Tushant Mittal, Youming Qiao

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2019

Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing.

Gábor Ivanyos, Youming Qiao

SIAM J. Comput., 2019

Explicit equivalence of quadratic forms over Fq(t).

Gábor Ivanyos, Péter Kutas, Lajos Rónyai

Finite Fields Their Appl., 2019

Discrete logarithm and Diffie-Hellman problems in identity black-box groups.

Gábor Ivanyos, Antoine Joux, Miklos Santha

CoRR, 2019

2018

On the complexity of trial and error for constraint satisfaction problems.

Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram

J. Comput. Syst. Sci., 2018

Computing Explicit Isomorphisms with Full Matrix Algebras over F_q(x).

Gábor Ivanyos, Péter Kutas, Lajos Rónyai

Found. Comput. Math., 2018

Chevalley-Warning Theorem in Quantum Computing.

Gábor Ivanyos, Lajos Rónyai

ERCIM News, 2018

Constructive non-commutative rank computation is in deterministic polynomial time.

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam

Comput. Complex., 2018

Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields.

Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski

Algorithmica, 2018

On Learning Linear Functions from Subset and Its Applications in Quantum Computing.

Gábor Ivanyos, Anupam Prakash, Miklos Santha

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Solving systems of diagonal polynomial equations over finite fields.

Gábor Ivanyos, Miklos Santha

Theor. Comput. Sci., 2017

Irreducibility and deterministic r-th root finding over finite fields.

Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena

Electron. Colloquium Comput. Complex., 2017

Irreducibility and r-th root finding over finite fields.

Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena

CoRR, 2017

Non-commutative Edmonds' problem and matrix semi-invariants.

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam

Comput. Complex., 2017

On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz.

Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang

Proceedings of the 32nd Computational Complexity Conference, 2017

2016

Explicit equivalence of quadratic forms over $\mathbb{F}_q(t)$.

Gábor Ivanyos, Péter Kutas, Lajos Rónyai

CoRR, 2016

2015

Generalized Wong sequences and their applications to Edmonds' problems.

Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha

J. Comput. Syst. Sci., 2015

Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics.

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam

CoRR, 2015

On generating the ring of matrix semi-invariants.

Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam

CoRR, 2015

Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$.

Gábor Ivanyos, Péter Kutas, Lajos Rónyai

CoRR, 2015

2014

Hidden Translation and Translating Coset in Quantum Computing.

Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen

SIAM J. Comput., 2014

Polynomial time quantum algorithms for certain bivariate hidden polynomial problems.

Thomas Decker, Peter Høyer, Gábor Ivanyos, Miklos Santha

Quantum Inf. Comput., 2014

Deterministic polynomial factoring and association schemes.

Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena

LMS J. Comput. Math., 2014

Quantum computation of discrete logarithms in semigroups.

Andrew M. Childs, Gábor Ivanyos

J. Math. Cryptol., 2014

An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group.

Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

Hidden Symmetry Subgroup Problems.

Thomas Decker, Gábor Ivanyos, Miklos Santha, Pawel Wocjan

SIAM J. Comput., 2013

2012

Finding hidden Borel subgroups of the general linear group.

Gábor Ivanyos

Quantum Inf. Comput., 2012

Trading GRH for algebra: Algorithms for factoring polynomials and related structures.

Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena

Math. Comput., 2012

On the distance between non-isomorphic groups.

Gábor Ivanyos, François Le Gall, Yuichi Yoshida

Eur. J. Comb., 2012

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.

Gábor Ivanyos, Luc Sanselme, Miklos Santha

Algorithmica, 2012

New bounds on the classical and quantum communication complexity of some graph properties.

Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

Splitting full matrix algebras over algebraic number fields

Gábor Ivanyos, Lajos Rónyai, Josef Schicho

CoRR, 2011

2010

Deterministic Polynomial Time Algorithms for Matrix Completion Problems.

Gábor Ivanyos, Marek Karpinski, Nitin Saxena

SIAM J. Comput., 2010

2009

On the Black-Box Complexity of Sperner's Lemma.

Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven

Theory Comput. Syst., 2009

2008

Constructions for quantum computing with symmetrized gates.

Gábor Ivanyos, Attila B. Nagy, Lajos Rónyai

Quantum Inf. Comput., 2008

On solving systems of random linear disequations.

Gábor Ivanyos

Quantum Inf. Comput., 2008

Schemes for Deterministic Polynomial Factoring.

Gábor Ivanyos, Marek Karpinski, Nitin Saxena

Electron. Colloquium Comput. Complex., 2008

2007

Root shadow spaces.

Arjeh M. Cohen, Gábor Ivanyos

Eur. J. Comb., 2007

An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups.

Gábor Ivanyos, Luc Sanselme, Miklos Santha

Proceedings of the STACS 2007, 2007

2006

Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes.

Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Efficient testing of groups.

Katalin Friedl, Gábor Ivanyos, Miklos Santha

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2003

Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem.

Gábor Ivanyos, Frédéric Magniez, Miklos Santha

Int. J. Found. Comput. Sci., 2003

Hidden translation and orbit coset in quantum computing.

Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2000

Treating the Exceptional Cases of the MeatAxe.

Gábor Ivanyos, Klaus Lux

Exp. Math., 2000

Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract).

Gábor Ivanyos

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1997

Computing Levi Decompositions in Lie algebras.

Willem A. de Graaf, Gábor Ivanyos, A. Küronya, Lajos Rónyai

Appl. Algebra Eng. Commun. Comput., 1997

Polynomial Time Algorithms for Modules over Finite Dimensional Algebras.

Alexander L. Chistov, Gábor Ivanyos, Marek Karpinski

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996

Lattice basis reduction for indefinite forms and an application.

Gábor Ivanyos, Ágnes Szántó

Discret. Math., 1996

Computing Cartan subalgebras of Lie algebras.

Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai

Appl. Algebra Eng. Commun. Comput., 1996

Multiplicative Equations over Commuting Matrices.

László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1994

Decomposition of Algebras over F_q(X₁, ..., X_m).

Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó

Appl. Algebra Eng. Commun. Comput., 1994

1993

Finding Maximal Orders in Semisimple Algebras Over Q.

Gábor Ivanyos, Lajos Rónyai

Comput. Complex., 1993