| 2024 | FOCS | Faster Isomorphism Testing of p-Groups of Frattini Class 2. | Gbor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, Chuanqi Zhang |
| 2023 | ASIACRYPT | Hidden Stabilizers, the Isogeny to Endomorphism Ring Problem and the Cryptanalysis of pSIDH. | Mingjie Chen, Muhammad Imran, Gbor Ivanyos, Pter Kutas, Antonin Leroux, Christophe Petit |
| 2023 | SODA | On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions. | Gbor Ivanyos, Youming Qiao |
| 2018 | ESA | On Learning Linear Functions from Subset and Its Applications in Quantum Computing. | Gbor Ivanyos, Anupam Prakash, Miklos Santha |
| 2018 | SODA | Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. | Gbor Ivanyos, Youming Qiao |
| 2017 | ISSAC | Irreducibility and Deterministic r-th Root Finding over Finite Fields. | Vishwas Bhargava, Gbor Ivanyos, Rajat Mittal, Nitin Saxena |
| 2015 | FAW | On Solving Systems of Diagonal Polynomial Equations Over Finite Fields. | Gbor Ivanyos, Miklos Santha |
| 2014 | ICALP | On the Complexity of Trial and Error for Constraint Satisfaction Problems. | Gbor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram |
| 2014 | MFCS | An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. | Thomas Decker, Gbor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha |
| 2014 | STACS | Generalized Wong sequences and their applications to Edmonds' problems. | Gbor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha |
| 2009 | ISSAC | Schemes for deterministic polynomial factoring. | Gbor Ivanyos, Marek Karpinski, Nitin Saxena |
| 2008 | LATIN | An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. | Gbor Ivanyos, Luc Sanselme, Miklos Santha |
| 2007 | STACS | An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. | Gbor Ivanyos, Luc Sanselme, Miklos Santha |
| 2006 | CIAC | Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. | Katalin Friedl, Gbor Ivanyos, Miklos Santha, Yves F. Verhoeven |
| 2005 | FCT | On the Black-Box Complexity of Sperner's Lemma. | Katalin Friedl, Gbor Ivanyos, Miklos Santha, Yves F. Verhoeven |
| 2005 | STOC | Efficient testing of groups. | Katalin Friedl, Gbor Ivanyos, Miklos Santha |
| 2003 | STOC | Hidden translation and orbit coset in quantum computing. | Katalin Friedl, Gbor Ivanyos, Frdric Magniez, Miklos Santha, Pranab Sen |
| 2001 | SPAA | Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. | Gbor Ivanyos, Frdric Magniez, Miklos Santha |
| 2000 | ISSAC | Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract). | Gbor Ivanyos |
| 1997 | ISSAC | Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. | Alexander L. Chistov, Gbor Ivanyos, Marek Karpinski |
| 1996 | SODA | Multiplicative Equations over Commuting Matrices. | Lszl Babai, Robert Beals, Jin-yi Cai, Gbor Ivanyos, Eugene M. Luks |