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
[3]
Hilfe
Suche: Author="Tani, Seiichiro"
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
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
Claw finding algorithms using quantum walk
Seiichiro Tani
Theoretical Computer Science
410
(50), 2009, pp. 5285-5297
Quantum query complexity of Boolean functions with small on-sets
Andris Ambainis
,
Kazuo Iwama
,
Masaki Nakanishi
,
Harumichi Nishimura
,
Rudy Raymond
,
Seiichiro Tani
,
Shigeru Yamashita
Lecture Notes in Computer Science
5369
, 2008, pp. 907-918
Multi-party quantum communication complexity with routed messages
Seiichiro Tani
,
Masaki Nakanishi
,
Shigeru Yamashita
Lecture Notes in Computer Science
5092
, 2008, pp. 180-190
Multi-party quantum communication complexity with routed messages
Seiichiro Tani
,
Masaki Nakanishi
,
Shigeru Yamashita
Lecture Notes in Computer Science
5092
, 2008, pp. 180-190
An improved claw finding algorithm using quantum walk
Seiichiro Tani
Lecture Notes in Computer Science
4708
, 2007, pp. 536-547
Exact quantum algorithms for the leader election problem
Seiichiro Tani
,
Hirotada Kobayashi
,
Keiji Matsumoto
Lecture Notes in Computer Science
3404
, 2005, pp. 581-592
Output-size sensitiveness of OBDD construction through maximal independent set problem
Kezuyoshi Hayase
,
Kunihiko Sadakane
,
Seiichiro Tani
Lecture Notes in Computer Science
959
, 1995, pp. 229-234
Computing the Tutte polynomial of a graph of moderate size
Kyoko Sekine
,
Hiroshi Imai
,
Seiichiro Tani
Lecture Notes in Computer Science
1004
, 1995, pp. 224-233
A reordering operation for an ordered binary decision diagram and an extended framework for combinatorics of graphs
Seiichiro Tani
,
Hiroshi Imai
Lecture Notes in Computer Science
834
, 1994, pp. 575-583
The complexity of the optimal variable ordering problems of shared binary decision diagrams
Seiichiro Tani
,
Kiyoharu Hamaguchi
,
Shuzo Yajima
Proceedings of the 4th International Symposium on Algorithms and Computation. ISAAC '93 (Hong Kong, December 15-17, 1993)
LNCS 762
, 1993, pp. 389-398