Ei Ando

15 papers A 1B 2C 3Misc 1Journal 6Unranked 2
YearRankTypeTitle / Venue / Authors
2020 J jnl
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.
Ei Ando, Shuji Kijima
2019 J jnl
The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length.
CoRR
Ei Ando
2019 C conf
The Volume of a Crosspolytope Truncated by a Halfspace.
TAMC
Ei Ando, Shoichi Tsuchiya
2017 B conf
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths.
WALCOM
Ei Ando
2017 Misc conf
An FPTAS for the Volume of Some
COCOON
Ei Ando, Shuji Kijima
2016 J jnl
An FPTAS for the Volume Computation of 0-1 Knapsack Polytopes Based on Approximate Convolution.
Algorithmica
Ei Ando, Shuji Kijima
2016 J jnl
An FPTAS for the Volume of a V-polytope - It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes.
CoRR
Ei Ando, Shuji Kijima
2014 B conf
An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral.
ISAAC
Ei Ando, Shuji Kijima
2011 C conf
Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand.
ICTAC
Ei Ando, Binay K. Bhattacharya, Yuzhuang Hu, Tsunehiko Kameda, Qiaosheng Shi
2010 J jnl
The Space Complexity of Leader Election in Anonymous Networks.
Int. J. Found. Comput. Sci.
Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2009 — conf
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.
SAGA
Ei Ando, Hirotaka Ono, Masafumi Yamashita
2009 J jnl
Approximating the longest path length of a stochastic DAG by a normal distribution in linear time.
J. Discrete Algorithms
Ei Ando, Toshio Nakata, Masafumi Yamashita
2009 C conf
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.
TAMC
Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2008 A conf
The space complexity of the leader election in anonymous networks.
IPDPS
Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
2002 — conf
The statistical longest path problem and its application to delay analysis of logical circuits.
Timing Issues in the Specification and Synthesis of Digital Systems
Ei Ando, Masafumi Yamashita, Toshio Nakata, Yusuke Matsunaga
2023 — conf
Not What You've Signed Up For: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection.
AISec
Kai Greshake, Sahar Abdelnabi, Shailesh Mishra, Christoph Endres, Thorsten Holz, Mario Fritz
2026 — preprint
CCX: Enabling Unmodified Intel SGX Applications on Arm CCA.
arXiv
Matti Schulze, Thorsten Holz, Felix C. Freiling