Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Ivanyos, G{\'a}bor"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hidden translation and translating coset in quantum computing
Katalin Friedl
,
Gábor Ivanyos
,
Frédéric Magniez
,
Miklos Santha
,
Pranab Sen
SIAM Journal on Computing
43
(1), 2014, pp. 1-24
Generalized wong sequences and their applications to Edmonds' problems
Gábor Ivanyos
,
Marek Karpinski
,
Youming Qiao
,
Miklos Santha
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 397-408
On the complexity of trial and error for constraint satisfaction problems
Gábor Ivanyos
,
Raghav Kulkarni
,
Youming Qiao
,
Miklos Santha
,
Aarthi Sundaram
Lecture Notes in Computer Science
8572
, 2014, pp. 663-675
Hidden symmetry subgroup problems
Thomas Decker
,
Gábor Ivanyos
,
Miklos Santha
,
Pawel Wocjan
SIAM Journal on Computing
42
(5), 2013, pp. 1987-2007
New bounds on the classical and quantum communication complexity of some graph properties
Gábor Ivanyos
,
Hartmut Klauck
,
Troy Lee
,
Miklos Santha
,
Ronald de Wolf
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 148-159
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
Gábor Ivanyos
,
Luc Sanselme
,
Miklos Santha
Algorithmica
62
(1-2), 2012, pp. 480-498
Deterministic polynomial time algorithms for matrix completion problems
Gábor Ivanyos
,
Marek Karpinski
,
Nitin Saxena
SIAM Journal on Computing
39
(8), 2010, pp. 3736-3751
On the black-box complexity of Sperner's lemma
Katalin Friedl
,
Gábor Ivanyos
,
Miklos Santha
,
Yves F. Verhoeven
Theory of Computing Systems
45
(3), 2009, pp. 629-646
An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups
Gábor Ivanyos
,
Luc Sanselme
,
Miklos Santha
Lecture Notes in Computer Science
4393
, 2007, pp. 586-597
Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes
Katalin Friedl
,
Gábor Ivanyos
,
Miklos Santha
,
Yves F. Verhoeven
Lecture Notes in Computer Science
3998
, 2006, pp. 380-391
Hidden translation and orbit coset in quantum computing
Katalin Friedl
,
Gábor Ivanyos
,
Frédéric Magniez
,
Miklos Santha
,
Pranab Sen
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 1-9
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
Gábor Ivanyos
,
Frédéric Magniez
,
Miklos Santha
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 723-739