dblp.uni-trier.dewww.uni-trier.de

Kojiro Kobayashi

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2007
23EEDarin Goldstein, Kojiro Kobayashi: On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem. ISAAC 2007: 244-255
2006
22EEDarin Goldstein, Kojiro Kobayashi: On the Complexity of the "Most General" Firing Squad Synchronization Problem. STACS 2006: 696-711
2005
21EEKojiro Kobayashi, Darin Goldstein: On Formulations of Firing Squad Synchronization Problems. UC 2005: 157-168
20EEDarin Goldstein, Kojiro Kobayashi: On the Complexity of Network Synchronization. SIAM J. Comput. 35(3): 567-589 (2005)
2004
19EEDarin Goldstein, Kojiro Kobayashi: On the Complexity of Network Synchronization. ISAAC 2004: 496-507
2001
18EEKojiro Kobayashi: On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. Theor. Comput. Sci. 259(1-2): 129-143 (2001)
1997
17 Kojiro Kobayashi: The Kolmogorov complexity, universal distribution, and coding theorem for generalized length functions. IEEE Transactions on Information Theory 43(3): 816-826 (1997)
16EEKojiro Kobayashi: Transformations that Preserve Malignness of Universal Distributions. Theor. Comput. Sci. 181(2): 289-306 (1997)
1994
15 Kojiro Kobayashi: On Coding Theorems with Modified Length Functions. Logic, Language and Computation 1994: 255-259
1993
14 Kojiro Kobayashi: Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness. Inf. Process. Lett. 46(1): 37-42 (1993)
1992
13 Kojiro Kobayashi: On Malign Input Distributions for Algorithms. ISAAC 1992: 239-248
1986
12 Hideki Yamasaki, Masako Takahashi, Kojiro Kobayashi: Characterization of omega-Regular Languages by Monadic Second-Order Formulas. Theor. Comput. Sci. 46(3): 91-99 (1986)
1985
11 Kojiro Kobayashi: On Proving Time Constructibility of Functions. Theor. Comput. Sci. 35: 215-225 (1985)
1984
10 Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki: Logical formulas and four subclasses of omega-regular languages. Automata on Infinite Words 1984: 81-88
9 Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki: Characterization of omega-Regular Languages by First-Order Formulas. Theor. Comput. Sci. 28: 315-327 (1984)
1978
8 Kojiro Kobayashi: The Firing Squad Synchronization Problem for a Class of Polyautomata Networks. J. Comput. Syst. Sci. 17(3): 300-318 (1978)
7 Kojiro Kobayashi: On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks. Theor. Comput. Sci. 7: 149-167 (1978)
1977
6 Kojiro Kobayashi: The Firing Squad Synchronization Problem for Two-Dimensional Arrays Information and Control 34(3): 177-197 (1977)
1974
5 Kojiro Kobayashi: A Note on Extending Equivalence Theories of Algorithms. Inf. Process. Lett. 3(2): 54-56 (1974)
1971
4 Kojiro Kobayashi: Structural Complexity of Context-Free Languages Information and Control 18(4): 299-310 (1971)
1969
3 Kojiro Kobayashi: Classification of Formal Languages by Functional Binary Transductions Information and Control 15(1): 95-109 (1969)
1968
2 Kojiro Kobayashi: Some Unsolvable Problems on Context-Free Languages and Their Application to On-Line Language Recognizers Information and Control 13(3): 245-253 (1968)
1966
1EEKojiro Kobayashi, Shigeru Sekiguchi: On the Class of Predicates Decidable by Two-Way Multitape Finite Automata. J. ACM 13(2): 236-261 (1966)

Coauthor Index

1Darin Goldstein [19] [20] [21] [22] [23]
2Shigeru Sekiguchi [1]
3Masako Takahashi [9] [10] [12]
4Hideki Yamasaki [9] [10] [12]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)