Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. - Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita (COCOON, 1999)

A probabilistic local majority polling game on weighted directed graphs with an application to the distributed agreement problem. - Toshio Nakata; Hiroshi Imahayashi; Masafumi Yamashita (Networks, 2000)

Some Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game. - Toshio Nakata; Masafumi Yamashita (SIROCCO, 2001)

The statistical longest path problem and its application to delay analysis of logical circuits. - Ei Ando; Masafumi Yamashita; Toshio Nakata; Yusuke Matsunaga (Timing Issues in the Specification and Synthesis of Digital Systems, 2002)

On the Expected Time for Herman's Probabilistic Self-stabilizing Algorithm. - Toshio Nakata (COCOON, 2004)

Approximating the longest path length of a stochastic DAG by a normal distribution in linear time. - Ei Ando; Toshio Nakata; Masafumi Yamashita (J. Discrete Algorithms, 2009)

Integral Transforms That Preserve Schur Convexity with an Application to Occupancy Problem with Collisions. - Toshio Nakata (ICNC, 2011)

Limit Theorems for a Generalized Feller Game. - Keisuke Matsumoto; Toshio Nakata (J. Appl. Probab., 2013)