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
[1]
Hilfe
Suche: Author="Le Gall, Fran{\c{c}}ois"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quantum algorithms for finding constant-sized sub-hypergraphs
François Le Gall
,
Harumichi Nishimura
,
Seiichiro Tani
Lecture Notes in Computer Science
8591
, 2014, pp. 429-440
Quantum algorithms for matrix products over semirings
François Le Gall
,
Harumichi Nishimura
Lecture Notes in Computer Science
8503
, 2014, pp. 331-343
Quantum weakly nondeterministic communication complexity
François Le Gall
Theoretical Computer Science
486
, 2013, pp. 43-49
Reconstructing strings from substrings with quantum queries
Richard Cleve
,
Kazuo Iwama
,
François Le Gall
,
Harumichi Nishimura
,
Seiichiro Tani
,
Junichi Teruyama
,
Shigeru Yamashita
Lecture Notes in Computer Science
7357
, 2012, pp. 388-397
A time-efficient output-sensitive quantum algorithm for Boolean matrix multiplication
François Le Gall
Lecture Notes in Computer Science
7676
, 2012, pp. 639-648
Quantum property testing of group solvability
Yoshifumi Inui
,
François Le Gall
Algorithmica
59
(1), 2011, pp. 35-47
Property testing for cyclic groups and beyond
François Le Gall
,
Yuichi Yoshida
Lecture Notes in Computer Science
6842
, 2011, pp. 432-443
An efficient quantum algorithm for some instances of the group isomorphism problem
François Le Gall
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 549-560
General scheme for perfect quantum network coding with free classical communication
Hirotada Kobayashi
,
François Le Gall
,
Harumichi Nishimura
,
Martin Rötteler
Lecture Notes in Computer Science
5555
, 2009, pp. 622-633
Efficient isomorphism testing for a class of group extensions
François Le Gall
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 625-636
Exponential separation of quantum and classical online space complexity
François Le Gall
Theory of Computing Systems
45
(2), 2009, pp. 188-202
Quantum weakly nondeterministic communication complexity
François Le Gall
Lecture Notes in Computer Science
4162
, 2006, pp. 658-669
Exponential separation of quantum and classical online space complexity
François Le Gall
Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2006 (Cambridge, Massachusetts, USA, July 30 - August 2, 2006)
, 2006, pp. 67-73