Jump to content

EU Centre of ExcellenceISO 9001

ERCIMW3C MemberFraunhofer Project Center

Gábor Ivanyos, doctor of HAS, research advisor
Gábor Ivanyos
Address: 1111 Budapest, Lágymányosi u. 11
Mail address: 1111 Budapest, Kende u. 13-17.
Room number: L 409
Phone: +36 1 279 6164
Fax: +36 1 209 5269
E-mail: Ivanyos.GaborEZT_TOROLJE_KI@EZT_TOROLJE_KIsztaki.mta.hu
Homepage: http://www.sztaki.hu/~ivanyos/
Department: SzTKCs

Works at MTA SZTAKI since 1983. Obtained degree "Doctor of the Hungarian Academy of Sciences" in 2010 in mathematics, PhD in 1997, also from the HAS and also in mathematics. Graduated in mathematics at the Faculty of Sciences of the Eötvös University (ELTE) in 1983. Main research interests: algebraic algorithms, quantum computing.

Publications

[order by time] [order by categories ]

computational complexity

Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes
Authors: Friedl, K.; Ivanyos, Gábor; Santha, M.; Verhoeven, YF
Date: 2006.
Published by: Lecture Notes in Computer Science (Page: 3)

Publication without a category

Finding hidden Borel subgroups of the general linear group
Authors: Ivanyos, Gábor
Date: 2012.
Published by: Quantum Information and Computation
Quantum computing on lattices using global two-qubit gates
Authors: Ivanyos, Gábor; Massar, S.; Nagy, AB
Date: 2005.
Published by: PHYSICAL REVIEW A
Efficient testing of groups
Authors: Friedl, K.; Ivanyos, Gábor; Santha, M.
Date: 2005.
Published by: STOC�05. Proceedings of the 37th annual ACM symposium on theory of computing. Baltimore, 2005. (Page: 1)
Algebra
Authors: Ivanyos, Gábor; Rónyai, Lajos
Editor: Iványi, A
Date: 2005.
Published by: Informatikai algoritmusok II. 18. fejezet. (Volume no.: I, Page: 8)
Root shadow spaces
Authors: Cohen, Arjeh M.; Ivanyos, Gábor
Date: 2007.
Published by: European Journal of Combinatorics (Page: 1)
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups
Authors: Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos
Editor: Weil, W. T.
Date: 2007.
Published by: STACS 2007. (Lecture notes in computer science 4393.) (Page: 5)
Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem
Authors: Ivanyos, Gábor; Magniez, F.; Santha, M.
Date: 2003.
Published by: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (Page: 7)
Hidden translation and orbit coset in quantum computing
Authors: Friedl, K.; Ivanyos, Gábor; Magniez, F.; Santha, M.; Sen, P.
Date: 2003.
Published by: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, ACM 2003 (Page: 1)
Finding splitting elements and maximal tori in matrix algebras
Authors: De Graaf, WA; Ivanyos, Gábor
Editor: Van Oystaeyen, F; Saorin, M
Date: 2000.
Published by: Interactions between ring theory and representations of algebras. (Lecture notes in pure and applied mathematics 210) (Page: 9)
Treating the exceptional cases of the MeatAxe
Authors: Ivanyos, Gábor; Lux, K.
Date: 2000.
Published by: EXPERIMENTAL MATHEMATICS (Page: 3)
Fast randomized algorithms for the structure of matrix algebras over finite fields
Authors: Ivanyos, Gábor
Date: 2000.
Published by: ISSAC 2000. International symposium on symbolic and algebraic computation. St. Andrews, 2000. (Page: 1)
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
Authors: Ivanyos, Gábor; Magniez, F.; Sántha, M.
Date: 2001.
Published by: 13th annual symposium on parallal algorithms and architectures. SPAA 2001. Crete Island, Proceedings. (Page: 2)
Algebra and computation at SZTAKI
Authors: Benczúr, András; Ivanyos, Gábor; Rónyai, Lajos
Date: 2002.
Published by: ERCIM NEWS (Page: 3)
Deciding finiteness for matrix semigroups over function fields over finite fields
Authors: Ivanyos, Gábor
Date: 2001.
Published by: ISRAEL JOURNAL OF MATHEMATICS (Page: 1)
Deciding universality of quantum gates
Authors: Ivanyos, Gábor
Date: 2007.
Published by: Journal of Algebra (Page: 4)
On the black-box complexity of Sperner's Lemma
Authors: Friedl, K.; Ivanyos, Gábor; Santha, M.; Verhoeven, YF
Date: 2005.
Published by: LECTURE NOTES IN COMPUTER SCIENCE (Page: 2)
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
Authors: Ivanyos, Gábor; Santha, Miklos; Sanselme, Luc
Date: 2012.
Published by: Algoritmica (Page: 4)
Splitting full matrix algebras over algebraic number fields
Authors: Rónyai, Lajos; Ivanyos, Gábor; Schicho, Josef
Date: 2011.
Published by: Mathematisches Forschungsinstitut Oberwolfach. Report 37/2011. (Page: 3)
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Authors: Ivanyos, Gábor; Karpinski, Marek; Rónyai, Lajos; Saxena, Nitin
Date: 2012.
Published by: Mathematics of Computation (Page: 4)
Splitting full matrix algebras over algebraic number fields
Authors: Ivanyos, Gábor; Rónyai, Lajos; Schicho, Josef
Date: 2012.
Published by: Journal of Algebra (Page: 2)
New bounds on the classical and quantum communication complexity of some graph properties
Authors: Ivanyos, Gábor; Klauck, Hartmut; Lee, Troy; Santha, Miklos; de Wolf, Ronald
Date: 2012.
Published by: (Page: 1)
Algebra
Authors: Ivanyos, Gábor; Rónyai, Lajos
Editor: Iványi, A.
Date: 2007.
Published by: Algorithms of informatics. Vol. 1. Foundations. (Volume no.: I, Page: 2)
Deterministic polynomial time algorithms for matrix completion problems
Authors: Ivanyos, Gábor; Karpinski, Marek; Saxena, Nitin
Date: 2010.
Published by: SIAM Journal on Computing (Page: 3)
On the distance between non-isomorphic groups
Authors: Ivanyos, Gábor; Le Gall, Francois; Yoshida, Yuichi
Date: 2012.
Published by: European Journal of Combinatorics (Page: 4)
Simple Lie algebras having extremal elements
Authors: Cohen, Arjeh M.; Ivanyos, Gábor; Roozemond, Dan
Date: 2008.
Published by: Indagationes Mathematicae New Series (Page: 1)
Schemes for deterministic polynomial factoring
Authors: Ivanyos, Gábor; Karpinski, Marek; Saxena, Nitin
Editor: Johnson, J.; Park, H.; Kaltofen, E.
Date: 2009. 07. 28.
Published by: ISSAC 2009. International symposium on symbolic and algebraic computation. Seoul, 2009. (Page: 1)
On solving systems of random linear disequations
Authors: Ivanyos, Gábor
Date: 2008.
Published by: Quantum Information and Computation (Issue no.: 6, Page: 5)
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
Authors: Ivanyos, Gábor; Sanselme, Luc; Santha, Miklos
Date: 2008.
Published by: LATIN 2008. Theoretical informatics. 8th Latin American symposium. Búzios, 2008. (Lecture notes in computer science 4957.) (Page: 7)
On the black-box complexity of Sperner's Lemma
Authors: Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.
Date: 2009.
Published by: Theory of Computing Systems (Page: 6)
Constructions for quantum computing with symmetrized gates
Authors: Ivanyos, Gábor; Nagy, Attila B.; Rónyai, Lajos
Date: 2008.
Published by: Quantum Information and Computation (Page: 4)
Lattice basis reduction for indefinite forms and an application
Authors: Ivanyos, Gábor; Szántó, Á.
Date: 1996.
Published by: DISCRETE MATHEMATICS (Issue no.: 1, Page: 1)
Multiplicative equations over commuting matrices
Authors: Babai, L.; Beals, R.; Cai, J-Y; Ivanyos, Gábor; Luks, EM
Date: 1996.
Published by: Proceeding of the seventh ACM-SIAM symposium on discrete algorithms. Atlanta, 1996. (Page: 4)
Decomposition of algebras over Fq(X1,...,Xm)
Authors: Ivanyos, Gábor; Rónyai, Lajos; Szántó, Á.
Date: 1994.
Published by: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING (Page: 7)
Computing Cartan subalgebras in Lie algebras
Authors: De Graaf, W.; Ivanyos, Gábor; Rónyai, Lajos
Date: 1996.
Published by: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING (Page: 3)
Finding maximal orders in semisimple algebras over Q
Authors: Ivanyos, Gábor; Rónyai, Lajos
Date: 1993.
Published by: COMPUTATIONAL COMPLEXITY (Page: 2)
Algoritmusok
Authors: Rónyai, Lajos; Ivanyos, Gábor; Szabó, R.
Date: 1998.
Published by: Algoritmusok.
Computations in associative and Lie algebras
Authors: Ivanyos, Gábor; Rónyai, Lajos
Editor: Cohen, AM; Cuypers, H; Sterk, H
Date: 1999.
Published by: Some tapas of computer algebra. (Algorithms and computation in mathematics, 4.) (Page: 9)
Finding the radical of matrix algebras using fitting decompositions
Authors: Ivanyos, Gábor
Date: 1999.
Published by: JOURNAL OF PURE AND APPLIED ALGEBRA (Page: 1)
Computing Levi decompositions in Lie algebras
Authors: De Graaf, W.; Ivanyos, Gábor; Küronya, A.; Rónyai, Lajos
Date: 1997.
Published by: APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING (Page: 2)
Finding the radical of an algebra of linear transformations
Authors: Cohen, AM; Ivanyos, Gábor; Wales, DB
Date: 1997.
Published by: JOURNAL OF PURE AND APPLIED ALGEBRA (Volume no.: 1, Page: 1)
Polynomial time algorithms for modules over finite dimensional algebras
Authors: Christov, A.; Ivanyos, Gábor; Karpinski, M.
Date: 1997.
Published by: Proceedings of the 1997 international symposium on symbolic and algebraic computation. Mauui, 1997. (Page: 6)

New search