​
Login / Signup
Ei Ando
ORCID
Publication Activity (10 Years)
Years Active: 2002-2020
Publications (10 Years): 7
Top Topics
Efficient Computation
Distribution Function
High Order
Lattice Points
Top Venues
CoRR
WALCOM
COCOON
TAMC
</>
Publications
</>
Ei Ando
,
Shuji Kijima
An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes.
Theor. Comput. Sci.
833 (2020)
Ei Ando
,
Shoichi Tsuchiya
The Volume of a Crosspolytope Truncated by a Halfspace.
TAMC
(2019)
Ei Ando
The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length.
CoRR
(2019)
Ei Ando
,
Shuji Kijima
-polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes.
COCOON
(2017)
Ei Ando
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths.
WALCOM
(2017)
Ei Ando
,
Shuji Kijima
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution.
Algorithmica
76 (4) (2016)
Ei Ando
,
Shuji Kijima
An FPTAS for the Volume of a V-polytope - It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes.
CoRR
(2016)
Ei Ando
-hardness of Computing High Order Derivative and Its Logarithm.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci.
(6) (2014)
Ei Ando
,
Shuji Kijima
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral.
ISAAC
(2014)
Ei Ando
,
Binay K. Bhattacharya
,
Yuzhuang Hu
,
Tsunehiko Kameda
,
Qiaosheng Shi
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand.
ICTAC
(2011)
Ei Ando
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
The Space Complexity of Leader Election in Anonymous Networks.
Int. J. Found. Comput. Sci.
21 (3) (2010)
Ei Ando
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.
TAMC
(2009)
Ei Ando
,
Hirotaka Ono
,
Masafumi Yamashita
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.
SAGA
(2009)
Ei Ando
,
Toshio Nakata
,
Masafumi Yamashita
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time.
J. Discrete Algorithms
7 (4) (2009)
Ei Ando
,
Hirotaka Ono
,
Kunihiko Sadakane
,
Masafumi Yamashita
The space complexity of the leader election in anonymous networks.
IPDPS
(2008)
Ei Ando
,
Masafumi Yamashita
,
Toshio Nakata
,
Yusuke Matsunaga
The statistical longest path problem and its application to delay analysis of logical circuits.
Timing Issues in the Specification and Synthesis of Digital Systems
(2002)