| 2011 | ||
|---|---|---|
| c5 | Toshio Nakata: Integral Transforms That Preserve Schur Convexity with an Application to Occupancy Problem with Collisions. ICNC 2011: 352-359 | |
| 2009 | ||
| j3 | 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) | |
| 2005 | ||
| j2 | Toshio Nakata: On the expected time for Herman's probabilistic self-stabilizing algorithm. Theor. Comput. Sci. 349(3): 475-483 (2005) | |
| 2004 | ||
| c4 | Toshio Nakata: On the Expected Time for Herman's Probabilistic Self-stabilizing Algorithm. COCOON 2004: 422-431 | |
| 2002 | ||
| c3 | 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 | |
| 2001 | ||
| c2 | Toshio Nakata, Masafumi Yamashita: Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. SIROCCO 2001: 293-304 | |
| 2000 | ||
| j1 | Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita: A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. Networks 35(4): 266-273 (2000) | |
| 1999 | ||
| c1 | Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita: Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. COCOON 1999: 330-338 | |
| 1 | Ei Ando | |
| 2 | Hiroshi Imahayashi | |
| 3 | Yusuke Matsunaga | |
| 4 | Masafumi Yamashita |
Data released under the ODC-BY 1.0 license — See also our legal information page