Search results for "Gábor Ivanyos"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Gábor Ivanyos, Luc Sanselme, Miklos Santha	An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, François Le Gall, Yuichi Yoshida	On the distance between non-isomorphic groups.	Eur. J. Comb.	2012	DBLP DOI BibTeX RDF
1	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	2012	DBLP BibTeX RDF
1	Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena	Trading GRH for algebra: Algorithms for factoring polynomials and related structures.	Math. Comput.	2012	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, François Le Gall, Yuichi Yoshida	On the distance between non-isomorphic groups	CoRR	2011	DBLP BibTeX RDF
1	Gábor Ivanyos, Lajos Rónyai, Joseph Schicho	Splitting full matrix algebras over algebraic number fields	CoRR	2011	DBLP BibTeX RDF
1	Gábor Ivanyos, Marek Karpinski, Nitin Saxena	Deterministic Polynomial Time Algorithms for Matrix Completion Problems.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, Marek Karpinski, Nitin Saxena	Deterministic Polynomial Time Algorithms for Matrix Completion Problems.	Electronic Colloquium on Computational Complexity (ECCC)	2009	DBLP BibTeX RDF
1	Gábor Ivanyos, Marek Karpinski, Nitin Saxena	Deterministic Polynomial Time Algorithms for Matrix Completion Problems	CoRR	2009	DBLP BibTeX RDF
1	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven	On the Black-Box Complexity of Sperner's Lemma.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Sperner’s lemma, Probabilistic and quantum lower bound, Deterministic algorithm, Query complexity
1	Gábor Ivanyos, Marek Karpinski, Nitin Saxena	Schemes for deterministic polynomial factoring.	ISSAC	2009	DBLP DOI BibTeX RDF	grh, schemes, polynomial factoring, representation theory
1	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)	2008	DBLP BibTeX RDF
1	Gábor Ivanyos, Marek Karpinski, Nitin Saxena	Schemes for Deterministic Polynomial Factoring.	Electronic Colloquium on Computational Complexity (ECCC)	2008	DBLP BibTeX RDF
1	Gábor Ivanyos, Attila B. Nagy, Lajos Rónyai	Constructions for quantum computing with symmetrized gates.	Quantum Information & Computation	2008	DBLP BibTeX RDF
1	Gábor Ivanyos	On solving systems of random linear disequations.	Quantum Information & Computation	2008	DBLP BibTeX RDF
1	Gábor Ivanyos, Marek Karpinski, Nitin Saxena	Schemes for Deterministic Polynomial Factoring	CoRR	2008	DBLP BibTeX RDF
1	Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena	Trading GRH for algebra: algorithms for factoring polynomials and related structures	CoRR	2008	DBLP BibTeX RDF
1	Gábor Ivanyos, Luc Sanselme, Miklos Santha	An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups.	LATIN	2008	DBLP DOI BibTeX RDF
1	Arjeh M. Cohen, Gábor Ivanyos	Root shadow spaces.	Eur. J. Comb.	2007	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, Luc Sanselme, Miklos Santha	An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups.	STACS	2007	DBLP DOI BibTeX RDF
1	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven	Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes.	CIAC	2006	DBLP DOI BibTeX RDF
1	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven	On the Black-Box Complexity of Sperner's Lemma.	FCT	2005	DBLP DOI BibTeX RDF
1	Katalin Friedl, Gábor Ivanyos, Miklos Santha	Efficient testing of groups.	STOC	2005	DBLP DOI BibTeX RDF	group multiplication testing, quantum computation, edit distance, probabilistic computation
1	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.	2003	DBLP DOI BibTeX RDF
1	Katalin Friedl, Gábor Ivanyos, Frédéric Magniez, Miklos Santha, Pranab Sen	Hidden translation and orbit coset in quantum computing.	STOC	2003	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, Frédéric Magniez, Miklos Santha	Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem.	SPAA	2001	DBLP DOI BibTeX RDF
1	Gábor Ivanyos	Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract).	ISSAC	2000	DBLP DOI BibTeX RDF
1	Willem A. de Graaf, Gábor Ivanyos, A. Küronya, Lajos Rónyai	Computing Levi Decompositions in Lie algebras.	Appl. Algebra Eng. Commun. Comput.	1997	DBLP DOI BibTeX RDF	Associative algebras, Complexity, Decomposition, Symbolic computations, Lie algebras, Radical
1	Alexander L. Chistov, Gábor Ivanyos, Marek Karpinski	Polynomial Time Algorithms for Modules over Finite Dimensional Algebras.	ISSAC	1997	DBLP BibTeX RDF
1	Gábor Ivanyos, Ágnes Szántó	Lattice basis reduction for indefinite forms and an application.	Discrete Mathematics	1996	DBLP DOI BibTeX RDF
1	Willem A. de Graaf, Gábor Ivanyos, Lajos Rónyai	Computing Cartan subalgebras of Lie algebras.	Appl. Algebra Eng. Commun. Comput.	1996	DBLP DOI BibTeX RDF	Cartan subalgebra, Polynomial time algorithm, Symbolic computation, Lie algebra
1	László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks	Multiplicative Equations over Commuting Matrices.	SODA	1996	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, Lajos Rónyai, Ágnes Szántó	Decomposition of Algebras over Fq(X1, ..., Xm).	Appl. Algebra Eng. Commun. Comput.	1994	DBLP DOI BibTeX RDF
1	Gábor Ivanyos, Lajos Rónyai	Finding Maximal Orders in Semisimple Algebras Over Q.	Computational Complexity	1993	DBLP DOI BibTeX RDF

Publications of "Gábor Ivanyos" ( http://dblp.L3S.de/Authors/Gábor_Ivanyos )