Get started
Author

Ei Ando

Observed names: Ando, Ei, EI ANDO, Ei ANDO
ORCID: 0000-0001-7284-9896
Observed ORCID: 0000-0001-7284-9896
OpenAlex ID: A5049609773
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time
2009 · Ei Ando, Toshio Nakata, et al. · Journal of Discrete Algorithms · 20
PDF
The statistical longest path problem and its application to delay analysis of logical circuits
2002 · Ei Ando, Masafumi Yamashita, et al. · 8
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution
2015 · Ei Ando, Shuji Kijima · Algorithmica · 6
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG
2009 · Ei Ando, Hirotaka Ono, et al. · Lecture notes in computer science · 4
An FPTAS for the Volume of Some $$\mathcal{V}$$-polytopes—It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes
2017 · Ei Ando, Shuji Kijima · Lecture notes in computer science · 3
The space complexity of the leader election in anonymous networks
2008 · Ei Ando, Hirotaka Ono, et al. · Proceedings - IEEE International Parallel and Distributed Processing Symposium · 3
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
2017 · Ei Ando · Lecture notes in computer science · 2
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral
2014 · Ei Ando, Shuji Kijima · Lecture notes in computer science · 2
The Space Complexity of Leader Election in Anonymous Networks
2010 · EI ANDO, HIROTAKA ONO, et al. · International Journal of Foundations of Computer Science · 2
An FPTAS for the Volume of a ${\cal V}$-polytope ---It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes
2016 · Ando, Ei, Kijima, Shuji · arXiv (Cornell University) · 1
PDF
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand
2011 · Ei Ando, Binay Bhattacharya, et al. · Lecture notes in computer science · 1
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
2009 · Ei Ando, Hirotaka Ono, et al. · Lecture notes in computer science · 1
A Counting-Based Approximation the Distribution Function of the Longest Path Length in Directed Acyclic Graphs
2008 · Ei Ando, Hirotaka Ono, et al. · 1
Advances in Parallel and Distributed Computing Models The Space Complexity of the Leader Election in Anonymous Networks
2008 · Ei Ando, Hirotaka Ono, et al. · 1
The Complexity of Computing Path Length Distributions with Edges i.i.d. Random via Local Uniformity
2026 · Ando, Ei · arXiv (Cornell University)
PDF
An FPTAS for the volume of some V -polytopes — It is hard to compute the volume of the intersection of two cross-polytopes
2020 · Ei Ando, Shuji Kijima · Theoretical Computer Science
The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length
2019 · Ando, Ei · arXiv (Cornell University)
PDF
The Volume of a Crosspolytope Truncated by a Halfspace
2019 · Ei Ando, Shoichi Tsuchiya · Lecture notes in computer science
#P-hardness of Computing High Order Derivative and Its Logarithm
2014 · Ei ANDO · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth
2012 · Ei Ando, Joseph G. Peters · Medical Entomology and Zoology
An Algorithm for Compung the Broadcast Time in Networks with Stochastic Transmission Time (アルゴリズム(AL) Vol.2011-AL-134)
2011 · Ei Ando, Joseph G. Peters · Medical Entomology and Zoology
学位論文審査報告
2010 · El Nasser, Ali Gamal Rabie Hafez, Li, Zhao, et al. · Institutional Repositories DataBase (IRDB)
PDF
Computing the Distribution Function of the Stochastic Longest Path Length in a DAG with Continuously Distributed Edge Lengths (Theoretical Computer Science and Its Applications)
2009 · Ei Ando, Hirotaka Ono, et al. · Kyoto University Research Information Repository (Kyoto University)
PDF
連続確率分布枝重み付きdagに対する最長路長さ分布の計算 (理論計算機科学の深化と応用)
2009 · Ando, Ei, Ono, Hirotaka, et al. · Institutional Repositories DataBase (IRDB)
PDF
Computing the Exact Distribution Function of the Longest Path Length in Directed Acyclic Graphs with Exponentially Distributed Edge Lengths
2009 · Ei Ando, Hirotaka Ono, et al. · 電子情報通信学会大会講演論文集
Works count: 30
Citation count: 55
H-index: 4
I10-index: 1
Year
Topic
Type