Gábor Ivanyos

2008
21	EE	Gábor Ivanyos, Luc Sanselme, Miklos Santha: An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. LATIN 2008: 759-771
20	EE	Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring CoRR abs/0804.1974: (2008)
19	EE	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)
18	EE	Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring. Electronic Colloquium on Computational Complexity (ECCC) 15(043): (2008)
17	EE	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
16	EE	Gábor Ivanyos, Luc Sanselme, Miklos Santha: An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. STACS 2007: 586-597
15	EE	Arjeh M. Cohen, Gábor Ivanyos: Root shadow spaces. Eur. J. Comb. 28(5): 1419-1441 (2007)
2006
14	EE	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
13	EE	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven: On the Black-Box Complexity of Sperner's Lemma. FCT 2005: 245-257
12	EE	Katalin Friedl, Gábor Ivanyos, Miklos Santha: Efficient testing of groups. STOC 2005: 157-166
2003
11	EE	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
10	EE	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)
2001
9	EE	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
8	EE	Gábor Ivanyos: Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract). ISSAC 2000: 175-183
1997
7		Alexander L. Chistov, Gábor Ivanyos, Marek Karpinski: Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. ISSAC 1997: 68-74
6	EE	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)
1996
5		László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks: Multiplicative Equations over Commuting Matrices. SODA 1996: 498-507
4	EE	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)
3	EE	Gábor Ivanyos, Ágnes Szántó: Lattice basis reduction for indefinite forms and an application. Discrete Mathematics 153(1-3): 177-188 (1996)
1994
2		Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó: Decomptosition of Algebras over Fq(X1, ..., Xm). Appl. Algebra Eng. Commun. Comput. 5: 71-90 (1994)
1993
1		Gábor Ivanyos, Lajos Rónyai: Finding Maximal Orders in Semisimple Algebras Over Q. Computational Complexity 3: 245-261 (1993)

Coauthor Index

1	László Babai	[5]
2	Robert Beals	[5]
3	Jin-yi Cai	[5]
4	Alexander L. Chistov	[7]
5	Arjeh M. Cohen	[15]
6	Katalin Friedl	[11] [12] [13] [14]
7	Willem A. de Graaf	[4] [6]
8	Marek Karpinski	[7] [17] [18] [19] [20]
9	A. Küronya	[6]
10	Eugene M. Luks	[5]
11	Frédéric Magniez	[9] [10] [11]
12	Lajos Rónyai	[1] [2] [4] [6] [17] [19]
13	Luc Sanselme	[16] [21]
14	Miklos Santha	[9] [10] [11] [12] [13] [14] [16] [21]
15	Nitin Saxena	[17] [18] [19] [20]
16	Pranab Sen	[11]
17	Ágnes Szántó	[2] [3]
18	Yves F. Verhoeven	[13] [14]