 | 2011 |
|---|
| 7 |       | 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: 45-61 |
| 2010 |
|---|
| 6 | | Ei Ando,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
The Space Complexity of Leader Election in Anonymous Networks.
Int. J. Found. Comput. Sci. 21(3): 427-440 (2010) |
| 2009 |
|---|
| 5 | | Ei Ando,
Hirotaka Ono,
Masafumi Yamashita:
A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.
SAGA 2009: 89-103 |
| 4 | | Ei Ando,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
Computing the Exact Distribution Function of the Stochastic Longest Path Length in a DAG.
TAMC 2009: 98-107 |
| 3 | | 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): 420-438 (2009) |
| 2008 |
|---|
| 2 | | Ei Ando,
Hirotaka Ono,
Kunihiko Sadakane,
Masafumi Yamashita:
The space complexity of the leader election in anonymous networks.
IPDPS 2008: 1-8 |
| 2002 |
|---|
| 1 | | 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: 134-139 |
Data released under the ODC-BY 1.0 license — See also our legal information page