Ei Ando

According to our database, Ei Ando authored at least 15 papers between 2002 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2020

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

2019

The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length.

Ei Ando

CoRR, 2019

The Volume of a Crosspolytope Truncated by a Halfspace.

Ei Ando, Shoichi Tsuchiya

Proceedings of the Theory and Applications of Models of Computation, 2019

2017

An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths.

Ei Ando

Proceedings of the WALCOM: Algorithms and Computation, 2017

An FPTAS for the Volume of Some <i>V</i> -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes.

Ei Ando, Shuji Kijima

Proceedings of the Computing and Combinatorics - 23rd International Conference, 2017

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 Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution.

Ei Ando, Shuji Kijima

Algorithmica, 2016

2014

<i>#P</i>-hardness of Computing High Order Derivative and Its Logarithm.

Ei Ando

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral.

Ei Ando, Shuji Kijima

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2011

Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand.

Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi

Proceedings of the Theoretical Aspects of Computing - ICTAC 2011 - 8th International Colloquium, Johannesburg, South Africa, August 31, 2011

2010

The Space Complexity of Leader Election in Anonymous Networks.

Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

Int. J. Found. Comput. Sci., 2010

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

Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.

Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.

Ei Ando, Hirotaka Ono, Masafumi Yamashita

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2009

2002

The statistical longest path problem and its application to delay analysis of logical circuits.

Ei Ando, Masafumi Yamashita, Toshio Nakata, Yusuke Matsunaga

Proceedings of the 8th ACM/IEEE International Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, 2002