Committee 
Date Time 
Place 
Paper Title / Authors 
Abstract 
Paper # 
IT, ISEC, RCC, WBS 
20220311 16:25 
Online 
Online 
An Efficient Method for Constructing Garbled Circuits Using Linked Lists Guangjian Liu, Hikaru Morita (Graduate School of Kanagawa Univ) IT2021131 ISEC202196 WBS202199 RCC2021106 
Since the proposal of the Garbled Circuit by Yao, a number of construction methods for secret circuits have been propose... [more] 
IT2021131 ISEC202196 WBS202199 RCC2021106 pp.281284 
SITE, IA, IPSJIOT [detail] 
20210302 13:55 
Online 
Online 
Mutual Secrecy of Attributes and Authorization Policies in Identity Federation Satsuki Nishioka, Yasuo Okabe (Kyoto Univ.) SITE202053 IA202049 
In modern Web services, authentication federation that separates the Identity Provider (IdP), which centrally manages au... [more] 
SITE202053 IA202049 pp.93100 
QIT (2nd) 
20201210 17:10 
Online 
Online 
Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams Seiichiro Tani (NTT) 
An ordered binary decision diagram (OBDD) is a directed acyclic graph that represents a Boolean function.
Since OBDDs h... [more] 

VLD, DC, RECONF, ICD, IPSJSLDM (Joint) [detail] 
20201117 14:25 
Online 
Online 
Variable Ordering for Minimizing Power Consumption of BDDbased Optical Logic Circuits Ryosuke Matsuo, Shinichi Minato (Kyoto Univ) VLD202024 ICD202044 DC202044 RECONF202043 
Optical logic circuits based on integrated nanophotonics have attracted significant interest due to their ultrahighspe... [more] 
VLD202024 ICD202044 DC202044 RECONF202043 pp.7883 
RECONF 
20200911 15:35 
Online 
Online 
Inductive Invariant Generation Based on Binary Decision Diagram and its Application to Logic Synthesis Liu ZiHao, Miyasaka Yukio, Fujita Masahiro (UT) RECONF202028 
In this paper, we mainly focus on inductive invariant generation using binary decision diagram (BDD), and its applicatio... [more] 
RECONF202028 pp.5459 
R 
20191128 13:45 
Osaka 
Central Electric Club 
A Note on MomentBased Approximation for Uncertainty Propagation in Hierarchical Models Jiahao Zhang (Hiroshima Univ.), Junjun Zheng (Ritsumeikan Univ.), Hiroyuki Okamura, Tadashi Dohi (Hiroshima Univ.) R201943 
This paper discusses an approximation method for uncertainty propagation in a hierarchical model. The uncertainty propag... [more] 
R201943 pp.16 
NS 
20191010 16:10 
Aichi 
Nagoya Institute of Technology 
[Invited Talk]
On recent developments in network reliability computation using binary decision diagrams Jun Kawahara (Kyoto Univ.) NS2019113 
Given a network with static link failure probabilities, the network reliability is to compute the probability that two s... [more] 
NS2019113 pp.5962 
COMP 
20190902 16:00 
Okayama 
Tsushima Campus, Okayama University 
Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP201916 
This research proposes algorithms that construct compressed data
structures, called zerosuppressed binary decision dia... [more] 
COMP201916 p.33 
COMP, IPSJAL 
20190511 10:40 
Kumamoto 
Kumamoto University 
Enumerating and Indexing Graph Subdivisions using Zerosuppressed Binary Decision Diagrams Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shinichi Minato (Kyoto Univ.) COMP20193 
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$.
In this paper, when ... [more] 
COMP20193 pp.5158 
IMQ, IE, MVE, CQ (Joint) [detail] 
20190315 13:50 
Kagoshima 
Kagoshima University 
Network reliability evaluation with arbitrary dependencies on link failures Jun Kawahara (NAIST), Takeru Inoue (NTT), Shoji Kasahara (NAIST) CQ2018113 
Given a network and the failure ratio of each link of the network, network reliability evaluation is to compute the prob... [more] 
CQ2018113 pp.111116 
IBISML 
20181105 15:10 
Hokkaido 
Hokkaido Citizens Activites Center (Kaderu 2.7) 
[Poster Presentation]
A Note on the Estimation Method of Causality Effects based on Statistical Decision Theory Shunsuke Horii, Tota Suko (Waseda Univ.) IBISML201897 
In this paper, we deal with the problem of estimating the intervention effect in statistical causal analysis using struc... [more] 
IBISML201897 pp.397402 
COMP 
20181026 15:00 
Kyoto 
Kyoto University 
Upper and lower bounds on the OBDDwidth of a special integer multiplication Tong Qin (Tokyo Tech) COMP201827 
We consider a Boolean function ${rm SMul}_{n1}^n$ that computes the middle bit of the multiplication of two natural num... [more] 
COMP201827 pp.4554 
COMP 
20181026 15:55 
Kyoto 
Kyoto University 
[Invited Lecture]
Report of Presentation in SEA2018 and Recent Study Yu Nakahata, Jun Kawahara (NAIST) COMP201829 
Partitioning a graph into balanced components is important for several applications. For multiobjective problems, it is... [more] 
COMP201829 p.57 
COMP 
20181026 16:20 
Kyoto 
Kyoto University 
[Invited Lecture]
AISTATS2018 Presentation Report and Recent Research Activities Shinsaku Sakaue, Masakazu Ishihata (NTT CS Lab.) COMP201830 
We introduce an AISTATS2018 accepted paper: Efficient Bandit Combinatorial Optimization Algorithm with Zerosuppressed ... [more] 
COMP201830 p.59 
IBISML 
20171109 13:00 
Tokyo 
Univ. of Tokyo 
Fast Computation of Lower Bounds for Privacy Evaluations, Based on Binary Decision Diagrams Shogo Takeuchi (Univ. of Tokyo), Kosuke Kusano, Jun Sakuma (Univ. of Tsukuba), Koji Tsuda (Univ. of Tokyo) IBISML201760 
An input value estimation is a privacy issue in a service provides information by personal information. It is necessary ... [more] 
IBISML201760 pp.193200 
NC, IPSJBIO, IBISML, IPSJMPS [detail] 
20170624 09:30 
Okinawa 
Okinawa Institute of Science and Technology 
Efficient Adversarial Combinatorial Bandit Algorithm via Zerosuppressed Decision Diagrams Shinsaku Sakaue (NTT), Masakazu Ishihata, Shinichi Minato (Hokkaido Univ.) IBISML20171 
We propose an algorithm for the adversarial combinatorial bandit problem, which is a sequential decision problem. The pr... [more] 
IBISML20171 pp.4348 
VLD 
20170303 11:20 
Okinawa 
Okinawa Seinen Kaikan 
Optimization of Parallel Prefix Adder Using Simulated Annealing Takayuki Moto, Mineo Kaneko (JAIST) VLD2016127 
In this report, simulated annealing based optimization of parallel prefix adders (PPA) is proposed. In order to construc... [more] 
VLD2016127 pp.139144 
NS, IN (Joint) 
20160304 09:30 
Miyazaki 
Phoenix Seagaia Resort 
Evaluating connectivity on physical networks with switch failures Koki Sonoda, Jun Kawahara (NAIST), Takeru Inoue (NTT), Shoji Kasahara (NAIST), Osamu Akashi, Ryoichi Kawahara, Hiroshi Saito (NTT) NS2015213 
In a network reliability evaluation, it is a problem to compute the probability that two specified nodes can communicate... [more] 
NS2015213 pp.261266 
COMP 
20151201 10:30 
Osaka 

A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shinichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP201531 
This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between... [more] 
COMP201531 pp.916 
IN, NV (Joint) 
20150717 11:15 
Hokkaido 
Hokkaido University 
[Invited Talk]
Exploiting ZDDs on Constrained Dynamic Programming Problems Norihito Yasuda (Hokkaido Univ.) IN201534 
Dynamic Programming is a fundamental tool for many optimization problems. However, in practical situations, in addition ... [more] 
IN201534 pp.6772 