- CSB - MetaPress - Google - Bing - Yahoo
 | 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) (2012) |
| j13 | | Gábor Ivanyos: Finding hidden Borel subgroups of the general linear group. Quantum Information & Computation 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. Electronic Colloquium on Computational Complexity (ECCC) 19: 68 (2012) |
| 2011 | ||
| i8 | | Gábor Ivanyos, Lajos Rónyai, Joseph 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) |
| 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. Electronic Colloquium on Computational Complexity (ECCC) 16: 58 (2009) |
| 2008 | ||
| j10 | | Gábor Ivanyos, Attila B. Nagy, Lajos Rónyai: Constructions for quantum computing with symmetrized gates. Quantum Information & Computation 8(5): 411-429 (2008) |
| j9 | | Gábor Ivanyos: On solving systems of random linear disequations. Quantum Information & Computation 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, Nitin Saxena: Schemes for Deterministic Polynomial Factoring. Electronic Colloquium on Computational Complexity (ECCC) 15(043) (2008) |
| i1 | | Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena: Trading GRH for algebra: algorithms for factoring polynomials and related structures. Electronic Colloquium on Computational Complexity (ECCC) 15(099) (2008) |
| 2007 | ||
| j8 | | |
| 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 | | |
| 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. Experimental Mathematics 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 |
| 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. Discrete Mathematics 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. Computational Complexity 3: 245-261 (1993) |
Colors in the list of coauthors
Last update Thu May 23 02:06:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page