default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGábor Ivanyos
Person information
SPARQL queries 
🛈 Please note that only 61% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j33]Muhammad Imran
, Gábor Ivanyos:
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem. Des. Codes Cryptogr. 92(10): 2825-2843 (2024)- [j32]Muhammad Imran, Gábor Ivanyos:
Zero sum subsequences and hidden subgroups. Quantum Inf. Process. 23(1): 14 (2024) - [c25]Gábor Ivanyos, Euan J. Mendoza, Youming Qiao, Xiaorui Sun, Chuanqi Zhang:
Faster Isomorphism Testing of p-Groups of Frattini Class 2. FOCS 2024: 1408-1424 - [i39]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 abs/2405.06357 (2024) - 2023
- [c24]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: 99-130 - [c23]Gábor Ivanyos, Youming Qiao:
On the orbit closure intersection problems for matrix tuples under conjugation and left-right actions. SODA 2023: 4115-4126 - [i38]Muhammad Imran, Gábor Ivanyos:
Zero sum subsequences and hidden subgroups. CoRR abs/2304.08376 (2023) - [i37]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 abs/2305.19897 (2023) - [i36]Muhammad Imran, Gábor Ivanyos:
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem. CoRR abs/2312.14028 (2023) - [i35]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: 779 (2023) - [i34]Muhammad Imran, Gábor Ivanyos:
Efficient quantum algorithms for some instances of the semidirect discrete logarithm problem. IACR Cryptol. ePrint Arch. 2023: 1953 (2023) - 2022
- [j31]Muhammad Imran, Gábor Ivanyos:
An exact quantum hidden subgroup algorithm and applications to solvable groups. Quantum Inf. Comput. 22(9&10): 770-789 (2022) - [c22]Gábor Ivanyos, Tushant Mittal, Youming Qiao:
Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras. ITCS 2022: 87:1-87:21 - [i33]Muhammad Imran, Gábor Ivanyos:
An exact quantum hidden subgroup algorithm and applications to solvable groups. CoRR abs/2202.04047 (2022) - [i32]Gábor Ivanyos, Attila Pereszlényi, Lajos Rónyai:
Some Complexity Results Involving Quantum Computing. ERCIM News 2022(128) (2022) - 2021
- [i31]Gábor Ivanyos, Tushant Mittal, Youming Qiao:
Symbolic determinant identity testing and non-commutative ranks of matrix Lie algebras. CoRR abs/2109.06403 (2021)
2010 – 2019
- 2019
- [j30]Gábor Ivanyos, Péter Kutas, Lajos Rónyai:
Explicit equivalence of quadratic forms over Fq(t). Finite Fields Their Appl. 55: 33-63 (2019) - [j29]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): 926-963 (2019) - [i30]Gábor Ivanyos, Antoine Joux, Miklos Santha:
Discrete logarithm and Diffie-Hellman problems in identity black-box groups. CoRR abs/1911.01662 (2019) - 2018
- [j28]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): 560-575 (2018) - [j27]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Constructive non-commutative rank computation is in deterministic polynomial time. Comput. Complex. 27(4): 561-593 (2018) - [j26]Gábor Ivanyos, Péter Kutas, Lajos Rónyai:
Computing Explicit Isomorphisms with Full Matrix Algebras over Fq(x). Found. Comput. Math. 18(2): 381-397 (2018) - [j25]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: 48-64 (2018) - [c21]Gábor Ivanyos, Anupam Prakash, Miklos Santha:
On Learning Linear Functions from Subset and Its Applications in Quantum Computing. ESA 2018: 66:1-66:14 - [c20]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: 2357-2376 - [i29]Gábor Ivanyos, Anupam Prakash, Miklos Santha:
On learning linear functions from subset and its applications in quantum computing. CoRR abs/1806.09660 (2018) - [i28]Gábor Ivanyos, Lajos Rónyai:
Chevalley-Warning Theorem in Quantum Computing. ERCIM News 2018(112) (2018) - 2017
- [j24]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Non-commutative Edmonds' problem and matrix semi-invariants. Comput. Complex. 26(3): 717-763 (2017) - [j23]Gábor Ivanyos, Miklos Santha:
Solving systems of diagonal polynomial equations over finite fields. Theor. Comput. Sci. 657: 73-85 (2017) - [c19]Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang:
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CCC 2017: 30:1-30:24 - [c18]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time. ITCS 2017: 55:1-55:19 - [c17]Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and Deterministic r-th Root Finding over Finite Fields. ISSAC 2017: 37-44 - [i27]Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and r-th root finding over finite fields. CoRR abs/1702.00558 (2017) - [i26]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 abs/1708.03495 (2017) - [i25]Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang:
On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. CoRR abs/1710.08602 (2017) - [i24]Vishwas Bhargava, Gábor Ivanyos, Rajat Mittal, Nitin Saxena:
Irreducibility and deterministic r-th root finding over finite fields. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i23]Gábor Ivanyos, Péter Kutas, Lajos Rónyai:
Explicit equivalence of quadratic forms over $\mathbb{F}_q(t)$. CoRR abs/1610.08671 (2016) - 2015
- [j22]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. J. Comput. Syst. Sci. 81(7): 1373-1386 (2015) - [c16]Gábor Ivanyos, Miklos Santha:
On Solving Systems of Diagonal Polynomial Equations Over Finite Fields. FAW 2015: 125-137 - [i22]Gábor Ivanyos, Marek Karpinski, Miklos Santha, Nitin Saxena, Igor E. Shparlinski:
Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. CoRR abs/1502.06631 (2015) - [i21]Gábor Ivanyos, Miklos Santha:
On solving systems of diagonal polynomial equations over finite fields. CoRR abs/1503.09016 (2015) - [i20]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Non-commutative Edmonds' problem and matrix semi-invariants. CoRR abs/1508.00690 (2015) - [i19]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
On generating the ring of matrix semi-invariants. CoRR abs/1508.01554 (2015) - [i18]Gábor Ivanyos, Péter Kutas, Lajos Rónyai:
Computing explicit isomorphisms with full matrix algebras over $\mathbb{F}_q(x)$. CoRR abs/1508.07755 (2015) - [i17]Gábor Ivanyos, Youming Qiao, K. V. Subrahmanyam:
Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics. CoRR abs/1512.03531 (2015) - 2014
- [j21]Andrew M. Childs, Gábor Ivanyos:
Quantum computation of discrete logarithms in semigroups. J. Math. Cryptol. 8(4): 405-416 (2014) - [j20]Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic polynomial factoring and association schemes. LMS J. Comput. Math. 17(1): 123-140 (2014) - [j19]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): 790-806 (2014) - [j18]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): 1-24 (2014) - [c15]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: 663-675 - [c14]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: 226-238 - [c13]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. STACS 2014: 397-408 - [i16]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR abs/1406.5336 (2014) - [i15]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. TR14 (2014) - 2013
- [j17]Thomas Decker, Gábor Ivanyos, Miklos Santha, Pawel Wocjan:
Hidden Symmetry Subgroup Problems. SIAM J. Comput. 42(5): 1987-2007 (2013) - [i14]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. CoRR abs/1307.6429 (2013) - [i13]Andrew M. Childs, Gábor Ivanyos:
Quantum computation of discrete logarithms in semigroups. CoRR abs/1310.6238 (2013) - [i12]Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j16]Gábor Ivanyos, Luc Sanselme, Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. Algorithmica 62(1-2): 480-498 (2012) - [j15]Gábor Ivanyos, François Le Gall, Yuichi Yoshida:
On the distance between non-isomorphic groups. Eur. J. Comb. 33(4): 474-476 (2012) - [j14]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): 493-531 (2012) - [j13]Gábor Ivanyos:
Finding hidden Borel subgroups of the general linear group. Quantum Inf. Comput. 12(7-8): 661-669 (2012) - [c12]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: 148-159 - [i11]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 abs/1204.4596 (2012) - [i10]Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Factoring and Association Schemes. CoRR abs/1205.5653 (2012) - [i9]Manuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Factoring and Association Schemes. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [i8]Gábor Ivanyos, Lajos Rónyai, Josef Schicho:
Splitting full matrix algebras over algebraic number fields. CoRR abs/1106.6191 (2011) - [i7]Gábor Ivanyos, François Le Gall, Yuichi Yoshida:
On the distance between non-isomorphic groups. CoRR abs/1107.0133 (2011) - 2010
- [j12]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Time Algorithms for Matrix Completion Problems. SIAM J. Comput. 39(8): 3736-3751 (2010)
2000 – 2009
- 2009
- [j11]Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven:
On the Black-Box Complexity of Sperner's Lemma. Theory Comput. Syst. 45(3): 629-646 (2009) - [c11]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Schemes for deterministic polynomial factoring. ISSAC 2009: 191-198 - [i6]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Time Algorithms for Matrix Completion Problems. CoRR abs/0907.0774 (2009) - [i5]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Deterministic Polynomial Time Algorithms for Matrix Completion Problems. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j10]Gábor Ivanyos, Attila B. Nagy, Lajos Rónyai:
Constructions for quantum computing with symmetrized gates. Quantum Inf. Comput. 8(5): 411-429 (2008) - [j9]Gábor Ivanyos:
On solving systems of random linear disequations. Quantum Inf. Comput. 8(6): 579-594 (2008) - [c10]Gábor Ivanyos, Luc Sanselme, Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. LATIN 2008: 759-771 - [i4]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Schemes for Deterministic Polynomial Factoring. CoRR abs/0804.1974 (2008) - [i3]Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena:
Trading GRH for algebra: algorithms for factoring polynomials and related structures. CoRR abs/0811.3165 (2008) - [i2]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. TR08 (2008) - [i1]Gábor Ivanyos, Marek Karpinski, Nitin Saxena:
Schemes for Deterministic Polynomial Factoring. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j8]Arjeh M. Cohen, Gábor Ivanyos:
Root shadow spaces. Eur. J. Comb. 28(5): 1419-1441 (2007) - [c9]Gábor Ivanyos, Luc Sanselme, Miklos Santha:
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. STACS 2007: 586-597 - 2006
- [c8]Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven:
Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. CIAC 2006: 380-391 - 2005
- [c7]Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven:
On the Black-Box Complexity of Sperner's Lemma. FCT 2005: 245-257 - [c6]Katalin Friedl, Gábor Ivanyos, Miklos Santha:
Efficient testing of groups. STOC 2005: 157-166 - 2003
- [j7]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): 723-740 (2003) - [c5]Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen:
Hidden translation and orbit coset in quantum computing. STOC 2003: 1-9 - 2001
- [c4]Gábor Ivanyos, Frédéric Magniez, Miklos Santha:
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. SPAA 2001: 263-270 - 2000
- [j6]Gábor Ivanyos, Klaus Lux:
Treating the Exceptional Cases of the MeatAxe. Exp. Math. 9(3): 373-381 (2000) - [c3]Gábor Ivanyos:
Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract). ISSAC 2000: 175-183
1990 – 1999
- 1997
- [j5]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): 291-303 (1997) - [c2]Alexander L. Chistov, Gábor Ivanyos, Marek Karpinski:
Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. ISSAC 1997: 68-74 - 1996
- [j4]Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai:
Computing Cartan subalgebras of Lie algebras. Appl. Algebra Eng. Commun. Comput. 7(5): 339-349 (1996) - [j3]Gábor Ivanyos, Ágnes Szántó:
Lattice basis reduction for indefinite forms and an application. Discret. Math. 153(1-3): 177-188 (1996) - [c1]László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks:
Multiplicative Equations over Commuting Matrices. SODA 1996: 498-507 - 1994
- [j2]Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó:
Decomposition of Algebras over Fq(X1, ..., Xm). Appl. Algebra Eng. Commun. Comput. 5: 71-90 (1994) - 1993
- [j1]Gábor Ivanyos, Lajos Rónyai:
Finding Maximal Orders in Semisimple Algebras Over Q. Comput. Complex. 3: 245-261 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 00:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
