BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × China
1 × Czech Republic
1 × Finland
1 × France
1 × Greece
1 × Iceland
1 × Italy
1 × Poland
1 × Spain
1 × Taiwan
5 × USA
Collaborated with:
∅ H.Nishimura S.Yamashita K.Hino R.Freivalds S.Taketomi A.Matsuura M.Amano K.Takaki R.Raymond Y.Hanatani T.Horiyama Y.Kambayashi D.Manlove S.Miyazaki Y.Morita H.Kurokawa S.Sawada M.Paterson
Talks about:
quantum (6) classic (3) string (3) communic (2) formula (2) circuit (2) random (2) state (2) recov (2) oracl (2)

Person: Kazuo Iwama

DBLP DBLP: Iwama:Kazuo

Facilitated 2 volumes:

ICALP (1) 2015Ed
ICALP (2) 2015Ed

Contributed to:

DLT 20122012
DLT 20122013
CIAA 20092009
ICALP (1) 20082008
SAT 20082008
ICALP 20072007
SAT 20032003
DAC 20022002
ICALP 20022002
SAT 20022002
ICALP 19991999
STOC 19991999
DLT 19971997
ED&TC 19971997
DAC 19941994
DLT 19931993
STOC 19831983

Wrote 17 papers:

DLT-2012-Iwama #quantum #string
Recovering Strings in Oracles: Quantum and Classic (KI), p. 23.
DLT-J-2012-IwamaN13 #quantum #string
Recovering Strings in Oracles: Quantum and Classic (KI, HN), pp. 979–994.
CIAA-2009-FreivaldsI #permutation #quantum #query
Quantum Queries on Permutations with a Promise (RF, KI), pp. 208–216.
ICALP-A-2008-IwamaNPRY #linear #network #polynomial
Polynomial-Time Construction of Linear Network Coding (KI, HN, MP, RR, SY), pp. 271–282.
SAT-2008-Iwama #satisfiability
SAT, UNSAT and Coloring (KI), p. 153.
ICALP-2007-IwamaNRY #bound #communication #complexity #quantum
Unbounded-Error One-Way Classical and Quantum Communication Complexity (KI, HN, RR, SY), pp. 110–121.
SAT-2003-HanataniHI
Density Condensation of Boolean Formulas (YH, TH, KI), pp. 69–77.
DAC-2002-IwamaKY #design #quantum
Transformation rules for designing CNOT-based quantum circuits (KI, YK, SY), pp. 419–424.
ICALP-2002-IwamaT #online #problem
Removable Online Knapsack Problems (KI, ST), pp. 293–305.
SAT-2002-MatsuuraI
Inclusion-exclusion for k-CNF formulas (AM, KI), p. 3.
ICALP-1999-IwamaMMM
Stable Marriage with Incomplete Lists and Ties (KI, DM, SM, YM), pp. 443–452.
STOC-1999-AmanoI #automaton #finite #quantum
Undecidability on Quantum Finite Automata (MA, KI), pp. 368–375.
DLT-1997-IwamaT #automaton #bound #nondeterminism
Tight Bounds on the Number of States of DFA’s That Are Equivalent to n-state NFA’s (KI, KT), pp. 147–154.
EDTC-1997-IwamaHKS #benchmark #metric #random
Random benchmark circuits with controlled attributes (KI, KH, HK, SS), pp. 90–97.
DAC-1994-IwamaH #generative #logic #random
Random Generation of Test Instances for Logic Optimizers (KI, KH), pp. 430–434.
DLT-1993-Iwama #low level #trade-off
Low-Level Tradeoffs between Reversals and Alternations (KI), pp. 326–341.
STOC-1983-Iwama #communication #multi #string
Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication (KI), pp. 374–381.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.