dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Gábor Ivanyos Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGá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)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGá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)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManuel Arora, Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Deterministic Polynomial Factoring and Association Schemes CoRR abs/1205.5653: (2012)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, François Le Gall, Yuichi Yoshida: On the distance between non-isomorphic groups. Eur. J. Comb. 33(4): 474-476 (2012)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGá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)
2011
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Lajos Rónyai, Joseph Schicho: Splitting full matrix algebras over algebraic number fields CoRR abs/1106.6191: (2011)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, François Le Gall, Yuichi Yoshida: On the distance between non-isomorphic groups CoRR abs/1107.0133: (2011)
2010
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Marek Karpinski, Nitin Saxena: Deterministic Polynomial Time Algorithms for Matrix Completion Problems. SIAM J. Comput. 39(8): 3736-3751 (2010)
2009
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for deterministic polynomial factoring. ISSAC 2009: 191-198
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Marek Karpinski, Nitin Saxena: Deterministic Polynomial Time Algorithms for Matrix Completion Problems CoRR abs/0907.0774: (2009)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Marek Karpinski, Nitin Saxena: Deterministic Polynomial Time Algorithms for Matrix Completion Problems. Electronic Colloquium on Computational Complexity (ECCC) 16: 58 (2009)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatalin 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)
2008
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Luc Sanselme, Miklos Santha: An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups. LATIN 2008: 759-771
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring CoRR abs/0804.1974: (2008)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGá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)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring. Electronic Colloquium on Computational Complexity (ECCC) 15(043): (2008)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGá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)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Attila B. Nagy, Lajos Rónyai: Constructions for quantum computing with symmetrized gates. Quantum Information & Computation 8(5): 411-429 (2008)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos: On solving systems of random linear disequations. Quantum Information & Computation 8(6): 579-594 (2008)
2007
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Luc Sanselme, Miklos Santha: An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups. STACS 2007: 586-597
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArjeh M. Cohen, Gábor Ivanyos: Root shadow spaces. Eur. J. Comb. 28(5): 1419-1441 (2007)
2006
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatalin 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
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven: On the Black-Box Complexity of Sperner's Lemma. FCT 2005: 245-257
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatalin Friedl, Gábor Ivanyos, Miklos Santha: Efficient testing of groups. STOC 2005: 157-166
2003
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen: Hidden translation and orbit coset in quantum computing. STOC 2003: 1-9
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGá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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGá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
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos: Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract). ISSAC 2000: 175-183
1997
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander L. Chistov, Gábor Ivanyos, Marek Karpinski: Polynomial Time Algorithms for Modules over Finite Dimensional Algebras. ISSAC 1997: 68-74
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWillem 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLászló Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks: Multiplicative Equations over Commuting Matrices. SODA 1996: 498-507
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWillem 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)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Ágnes Szántó: Lattice basis reduction for indefinite forms and an application. Discrete Mathematics 153(1-3): 177-188 (1996)
1994
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGá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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGábor Ivanyos, Lajos Rónyai: Finding Maximal Orders in Semisimple Algebras Over Q. Computational Complexity 3: 245-261 (1993)

Coauthor Index

1Manuel Arora [33]
2László Babai [5]
3Robert Beals [5]
4Jin-Yi Cai (Jin-yi Cai) [5]
5Alexander L. Chistov [7]
6Arjeh M. Cohen [15]
7Katalin Friedl [11] [12] [13] [14] [24]
8François Le Gall (Francois Le Gall) [29] [32]
9Willem A. de Graaf [4] [6]
10Marek Karpinski [7] [19] [20] [21] [22] [25] [26] [27] [28] [31] [33]
11Hartmut Klauck [34]
12A. Küronya [6]
13Troy Lee [34]
14Eugene M. Luks [5]
15Frédéric Magniez [9] [10] [11]
16Attila B. Nagy [18]
17Lajos Rónyai [1] [2] [4] [6] [18] [19] [21] [30] [31]
18Luc Sanselme [16] [23] [35]
19Miklos Santha [9] [10] [11] [12] [13] [14] [16] [23] [24] [34] [35]
20Nitin Saxena [19] [20] [21] [22] [25] [26] [27] [28] [31] [33]
21Joseph Schicho [30]
22Pranab Sen [11]
23Ágnes Szántó [2] [3]
24Yves F. Verhoeven [13] [14] [24]
25Ronald de Wolf [34]
26Yuichi Yoshida [29] [32]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page