Author:
Ando Ei,Ono Hirotaka,Sadakane Kunihiko,Yamashita Masafumi
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Ando, E., Nakata, T., Yamashita, M.: Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. Journal of Discrete Algorithms (2009), doi:10.1016/j.jda.2009.01.001
2. Ando, E., Ono, H., Sadakane, K., Yamashita, M.: A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems (submitted for publication)
3. Ando, E., Yamashita, M., Nakata, T., Matsunaga, Y.: The Statistical Longest Path Problem and Its Application to Delay Analysis of Logical Circuits. In: Proc. TAU, pp. 134–139 (2002)
4. Network Models;M.O. Ball,1995
5. Berkelaar, M.: Statistical delay calculation, a linear time method. In: Proceedings of the International Workshop on Timing Analysis (TAU 1997), pp. 15–24 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献