List of Publications
(1) On the complexity of the ``most general'' undirected firing squad synchronization problem, in ISAAC 2007: Proceedings of the 18th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Vol. 4835, pp. 244-255 (2007) (Darin Goldstein, Kojiro Kobayashi)
(2) On the complexity of the ``most general'' firing squad synchronization problem, in STACS 2006: Proceedings of the 23rd Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 3884, pp. 696-711 (2006) (Darin Goldstein, Kojiro Kobayashi)
(3) On the complexity of network synchronization, SIAM J. Comput., vol. 35, no.3, pp.567-589 (2005) (Darin Goldstein, Kojiro Kobayashi)
(4) On formulations of firing squad synchronization problems, in Unconventional Computation: Proceedings of the 4th International Conference, UC 2005, Lecture Notes in Computer Science, vol. 3699, pp. 157-168 (2005) (Kojiro Kobayashi, Darin Goldstein)
(5) On the complexity of network synchronization, in ISAAC 2004: Proceedings of the 15th International Symposium, LNCS vol. 3341, pp.496 - 507 (Dec. 2004) (Darin. Goldstein, Kojiro Kobayashi)
(6) On the tree structure of some worst inputs for Heapsort, IEICE Trans. on Information & Systems, Vol.E86-D, No.2, pp.263-275 (Feb. 2003) (Yoshitomo Tomitsuru, Yoshie Fukada, Kojiro Kobayashi)
(7) On time optimal solutions of the firing squad synchronization problem for two-dimensional paths, Theoretical Computer Science, vol 259 (28 May 2001), pp.129 - 143.
(8) A complexity-theoretical approach to the firing squad synchronization problem, JIM '99 (Journee de l'Informatique Messine (Days of Metz Informatics)) "NP-Completeness and Parallelism", May 17 - 18, 1999, Metz University, Institute of Technology. pdf PostScript
(9) Transformations that preserve malignness of universal distributions, Theoretical Computer Science, vol.181 (1997), pp.289-306.
(10) The Kolmogorov complexity, the universal distribution and the coding theorem with generalized length functions, IEEE Transactions on Information Theory, vol.43, no.3 (May 1997), pp.816-826.