Gábor Ivanyos

98 papers A* 6A 6B 7C 1Misc 1Journal 73Unranked 4

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