Gábor Ivanyos

Publication Activity (10 Years)

Years Active: 1993-2024
Publications (10 Years): 35

Top Topics

Polynomial Equations

Real Valued Time Series

Constraint Satisfaction

Quantum Computing

Top Venues

J. Comput. Syst. Sci.

IACR Cryptol. ePrint Arch.

Publications

Muhammad Imran, Gábor Ivanyos
Zero sum subsequences and hidden subgroups. Quantum Inf. Process. 23 (1) (2024)
Jonathan Allcock, João F. Doriguello, Gábor Ivanyos, Miklos Santha
Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits. CoRR (2024)
Muhammad Imran, Gábor Ivanyos
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem. CoRR (2023)
Mingjie Chen, Muhammad Imran, Gábor Ivanyos, Péter Kutas, Antonin Leroux, Christophe Petit
Hidden Stabilizers, the Isogeny to Endomorphism Ring Problem and the Cryptanalysis of pSIDH. ASIACRYPT (3) (2023)
Gábor Ivanyos, Youming Qiao
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions. SODA (2023)
Muhammad Imran, Gábor Ivanyos
Zero sum subsequences and hidden subgroups. CoRR (2023)
Muhammad Imran, Gábor Ivanyos
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem. IACR Cryptol. ePrint Arch. 2023 (2023)
Mingjie Chen, Muhammad Imran, Gábor Ivanyos, Péter Kutas, Antonin Leroux, Christophe Petit
Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH. IACR Cryptol. ePrint Arch. 2023 (2023)
Mingjie Chen, Muhammad Imran, Gábor Ivanyos, Péter Kutas, Antonin Leroux, Christophe Petit
Hidden Stabilizers, the Isogeny To Endomorphism Ring Problem and the Cryptanalysis of pSIDH. CoRR (2023)
Gábor Ivanyos, Tushant Mittal, Youming Qiao
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras. ITCS (2022)
Gábor Ivanyos, Attila Pereszlényi, Lajos Rónyai
Some Complexity Results Involving Quantum Computing. ERCIM News 2022 (128) (2022)
Muhammad Imran, Gábor Ivanyos
An exact quantum hidden subgroup algorithm and applications to solvable groups. Quantum Inf. Comput. 22 (9&10) (2022)
Muhammad Imran, Gábor Ivanyos
An exact quantum hidden subgroup algorithm and applications to solvable groups. CoRR (2022)
Gábor Ivanyos, Tushant Mittal, Youming Qiao
Symbolic determinant identity testing and non-commutative ranks of matrix Lie algebras. CoRR (2021)
Gábor Ivanyos, Antoine Joux, Miklos Santha
Discrete logarithm and Diffie-Hellman problems in identity black-box groups. CoRR (2019)
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
Explicit equivalence of quadratic forms over Fq(t). Finite Fields Their Appl. 55 (2019)
Gábor Ivanyos, Youming Qiao
Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing. SIAM J. Comput. 48 (3) (2019)
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
(x). Found. Comput. Math. 18 (2) (2018)
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields. Algorithmica 80 (2) (2018)
Gábor Ivanyos, Anupam Prakash, Miklos Santha
On learning linear functions from subset and its applications in quantum computing. CoRR (2018)
Gábor Ivanyos, Youming Qiao
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. SODA (2018)
Gábor Ivanyos, Anupam Prakash, Miklos Santha
On Learning Linear Functions from Subset and Its Applications in Quantum Computing. ESA (2018)
Gábor Ivanyos, Lajos Rónyai
Chevalley-Warning Theorem in Quantum Computing. ERCIM News 2018 (112) (2018)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the complexity of trial and error for constraint satisfaction problems. J. Comput. Syst. Sci. 92 (2018)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive non-commutative rank computation is in deterministic polynomial time. Comput. Complex. 27 (4) (2018)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Non-commutative Edmonds' problem and matrix semi-invariants. Comput. Complex. 26 (3) (2017)
Gábor Ivanyos, Miklos Santha
Solving systems of diagonal polynomial equations over finite fields. Theor. Comput. Sci. 657 (2017)
Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
Irreducibility and deterministic r-th root finding over finite fields. Electron. Colloquium Comput. Complex. 24 (2017)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ITCS (2017)
Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. Computational Complexity Conference (2017)
Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
Irreducibility and Deterministic r-th Root Finding over Finite Fields. ISSAC (2017)
Gábor Ivanyos, Youming Qiao
Algorithms based on *-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing. CoRR (2017)
Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CoRR (2017)
Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena
Irreducibility and r-th root finding over finite fields. CoRR (2017)
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
Explicit equivalence of quadratic forms over $\mathbb{F}_q(t)$. CoRR (2016)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. CoRR (2015)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
Non-commutative Edmonds' problem and matrix semi-invariants. CoRR (2015)
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems. J. Comput. Syst. Sci. 81 (7) (2015)
Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam
On generating the ring of matrix semi-invariants. CoRR (2015)
Gábor Ivanyos, Miklos Santha
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields. FAW (2015)
Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski
Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. CoRR (2015)
Gábor Ivanyos, Miklos Santha
On solving systems of diagonal polynomial equations over finite fields. CoRR (2015)
Gábor Ivanyos, Péter Kutas, Lajos Rónyai
Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$. CoRR (2015)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the Complexity of Trial and Error for Constraint Satisfaction Problems. ICALP (1) (2014)
Thomas Decker, Peter Høyer, Gábor Ivanyos, Miklos Santha
Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Inf. Comput. 14 (9-10) (2014)
Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
Hidden Translation and Translating Coset in Quantum Computing. SIAM J. Comput. 43 (1) (2014)
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems. STACS (2014)
Andrew M. Childs, Gábor Ivanyos
Quantum computation of discrete logarithms in semigroups. J. Math. Cryptol. 8 (4) (2014)
Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. MFCS (2) (2014)
Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Deterministic polynomial factoring and association schemes. LMS J. Comput. Math. 17 (1) (2014)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the complexity of trial and error for constraint satisfaction problems. Electron. Colloquium Comput. Complex. 21 (2014)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR (2014)
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems. CoRR (2013)
Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha
Generalized Wong sequences and their applications to Edmonds' problems. Electron. Colloquium Comput. Complex. 20 (2013)
Andrew M. Childs, Gábor Ivanyos
Quantum computation of discrete logarithms in semigroups. CoRR (2013)
Thomas Decker, Gábor Ivanyos, Miklos Santha, Pawel Wocjan
Hidden Symmetry Subgroup Problems. SIAM J. Comput. 42 (5) (2013)
Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Deterministic Polynomial Factoring and Association Schemes CoRR (2012)
Gábor Ivanyos, François Le Gall, Yuichi Yoshida
On the distance between non-isomorphic groups. Eur. J. Comb. 33 (4) (2012)
Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena
Trading GRH for algebra: Algorithms for factoring polynomials and related structures. Math. Comput. 81 (277) (2012)
Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Deterministic Polynomial Factoring and Association Schemes. Electron. Colloquium Comput. Complex. 19 (2012)
Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf
New bounds on the classical and quantum communication complexity of some graph properties CoRR (2012)
Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf
New bounds on the classical and quantum communication complexity of some graph properties. FSTTCS (2012)
Gábor Ivanyos, Luc Sanselme, Miklos Santha
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. Algorithmica 62 (1-2) (2012)
Gábor Ivanyos
Finding hidden Borel subgroups of the general linear group. Quantum Inf. Comput. 12 (7-8) (2012)
Gábor Ivanyos, Lajos Rónyai, Josef Schicho
Splitting full matrix algebras over algebraic number fields CoRR (2011)
Gábor Ivanyos, François Le Gall, Yuichi Yoshida
On the distance between non-isomorphic groups CoRR (2011)
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Deterministic Polynomial Time Algorithms for Matrix Completion Problems. SIAM J. Comput. 39 (8) (2010)
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Deterministic Polynomial Time Algorithms for Matrix Completion Problems CoRR (2009)
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Deterministic Polynomial Time Algorithms for Matrix Completion Problems. Electron. Colloquium Comput. Complex. 16 (2009)
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Schemes for deterministic polynomial factoring. ISSAC (2009)
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
On the Black-Box Complexity of Sperner's Lemma. Theory Comput. Syst. 45 (3) (2009)
Gábor Ivanyos, Attila B. Nagy, Lajos Rónyai
Constructions for quantum computing with symmetrized gates. Quantum Inf. Comput. 8 (5) (2008)
Gábor Ivanyos, Luc Sanselme, Miklos Santha
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. LATIN (2008)
Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena
Trading GRH for algebra: algorithms for factoring polynomials and related structures. Electron. Colloquium Comput. Complex. 15 (099) (2008)
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Schemes for Deterministic Polynomial Factoring. Electron. Colloquium Comput. Complex. 15 (043) (2008)
Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena
Trading GRH for algebra: algorithms for factoring polynomials and related structures CoRR (2008)
Gábor Ivanyos, Marek Karpinski, Nitin Saxena
Schemes for Deterministic Polynomial Factoring CoRR (2008)
Gábor Ivanyos
On solving systems of random linear disequations. Quantum Inf. Comput. 8 (6) (2008)
Arjeh M. Cohen, Gábor Ivanyos
Root shadow spaces. Eur. J. Comb. 28 (5) (2007)
Gábor Ivanyos, Luc Sanselme, Miklos Santha
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. STACS (2007)
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. CIAC (2006)
Katalin Friedl, Gábor Ivanyos, Miklos Santha
Efficient testing of groups. STOC (2005)
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
On the Black-Box Complexity of Sperner's Lemma. FCT (2005)
Gábor Ivanyos, Frédéric Magniez, Miklos Santha
Efficient Quantum Algorithms For Some Instances Of The Non-Abelian Hidden Subgroup Problem. Int. J. Found. Comput. Sci. 14 (5) (2003)
Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen
Hidden translation and orbit coset in quantum computing. STOC (2003)
Gábor Ivanyos, Frédéric Magniez, Miklos Santha
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. SPAA (2001)
Gábor Ivanyos, Klaus Lux
Treating the Exceptional Cases of the MeatAxe. Exp. Math. 9 (3) (2000)
Gábor Ivanyos
Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract). ISSAC (2000)
Willem A. de Graaf, Gábor Ivanyos, A. Küronya, Lajos Rónyai
Computing Levi Decompositions in Lie algebras. Appl. Algebra Eng. Commun. Comput. 8 (4) (1997)
Alexander L. Chistov, Gábor Ivanyos, Marek Karpinski
Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. ISSAC (1997)
Gábor Ivanyos, Ágnes Szántó
Lattice basis reduction for indefinite forms and an application. Discret. Math. 153 (1-3) (1996)
László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks
Multiplicative Equations over Commuting Matrices. SODA (1996)
Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai
Computing Cartan subalgebras of Lie algebras. Appl. Algebra Eng. Commun. Comput. 7 (5) (1996)
Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó
). Appl. Algebra Eng. Commun. Comput. 5 (1994)
Gábor Ivanyos, Lajos Rónyai
Finding Maximal Orders in Semisimple Algebras Over Q. Comput. Complex. 3 (1993)