The statistical longest path problem and its application to delay analysis of logical circuits. - Ei Ando; Masafumi Yamashita; Toshio Nakata; Yusuke Matsunaga (Timing Issues in the Specification and Synthesis of Digital Systems, 2002)

A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems. - Ei Ando; Hirotaka Ono 001; Masafumi Yamashita (SAGA, 2009)

Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG. - Ei Ando; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (TAMC, 2009)

Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. - Ei Ando; Toshio Nakata; Masafumi Yamashita (J. Discrete Algorithms, 2009)

The Space Complexity of Leader Election in Anonymous Networks. - Ei Ando; Hirotaka Ono 001; Kunihiko Sadakane; Masafumi Yamashita (Int. J. Found. Comput. Sci., 2010)

Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand. - Ei Ando; Binay K. Bhattacharya; Yuzhuang Hu; Tsunehiko Kameda; Qiaosheng Shi (ICTAC, 2011)

An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral. - Ei Ando; Shuji Kijima (ISAAC, 2014)

#P-hardness of Computing High Order Derivative and Its Logarithm. - Ei Ando (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution. - Ei Ando; Shuji Kijima (Algorithmica, 2016)

An FPTAS for the Volume of a V-polytope - It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes. - Ei Ando; Shuji Kijima (CoRR, 2016)

An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes. - Ei Ando; Shuji Kijima (COCOON, 2017)

An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths. - Ei Ando (WALCOM, 2017)

The Volume of a Crosspolytope Truncated by a Halfspace. - Ei Ando; Shoichi Tsuchiya (TAMC, 2019)

The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length. - Ei Ando (CoRR, 2019)

An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes. - Ei Ando; Shuji Kijima (Theor. Comput. Sci., 2020)