Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kojiro Kobayashi
2010 – today
- 2012
[j18]Darin Goldstein, Kojiro Kobayashi: On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks. SIAM J. Comput. 41(3): 618-669 (2012)- 2011
- [j17]Takashi Saso, Kojiro Kobayashi, Atsuyoshi Nakamura: On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation. Inf. Process. Lett. 111(12): 595-599 (2011)
2000 – 2009
- 2007
- [c7]Darin Goldstein, Kojiro Kobayashi: On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem. ISAAC 2007: 244-255
- 2006
- [c6]Darin Goldstein, Kojiro Kobayashi: On the Complexity of the "Most General" Firing Squad Synchronization Problem. STACS 2006: 696-711
- 2005
- [j16]Darin Goldstein, Kojiro Kobayashi: On the Complexity of Network Synchronization. SIAM J. Comput. 35(3): 567-589 (2005)
- [c5]Kojiro Kobayashi, Darin Goldstein: On Formulations of Firing Squad Synchronization Problems. UC 2005: 157-168
- 2004
- [c4]Darin Goldstein, Kojiro Kobayashi: On the Complexity of Network Synchronization. ISAAC 2004: 496-507
- 2001
- [j15]Kojiro Kobayashi: On time optimal solutions of the firing squad synchronization problem for two-dimensional paths. Theor. Comput. Sci. 259(1-2): 129-143 (2001)
1990 – 1999
- 1997
- [j14]Kojiro Kobayashi: Transformations that Preserve Malignness of Universal Distributions. Theor. Comput. Sci. 181(2): 289-306 (1997)
- [j13]Kojiro Kobayashi: The Kolmogorov complexity, universal distribution, and coding theorem for generalized length functions. IEEE Transactions on Information Theory 43(3): 816-826 (1997)
- 1994
- [c3]Kojiro Kobayashi: On Coding Theorems with Modified Length Functions. Logic, Language and Computation 1994: 255-259
- 1993
- [j12]Kojiro Kobayashi: Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness. Inf. Process. Lett. 46(1): 37-42 (1993)
- 1992
- [c2]
1980 – 1989
- 1986
- [j11]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
- [j10]Kojiro Kobayashi: On Proving Time Constructibility of Functions. Theor. Comput. Sci. 35: 215-225 (1985)
- 1984
- [j9]Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki: Characterization of omega-Regular Languages by First-Order Formulas. Theor. Comput. Sci. 28: 315-327 (1984)
- [c1]Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki: Logical formulas and four subclasses of omega-regular languages. Automata on Infinite Words 1984: 81-88
1970 – 1979
- 1978
- [j8]Kojiro Kobayashi: The Firing Squad Synchronization Problem for a Class of Polyautomata Networks. J. Comput. Syst. Sci. 17(3): 300-318 (1978)
- [j7]Kojiro Kobayashi: On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks. Theor. Comput. Sci. 7: 149-167 (1978)
- 1977
- [j6]Kojiro Kobayashi: The Firing Squad Synchronization Problem for Two-Dimensional Arrays. Information and Control 34(3): 177-197 (1977)
- 1974
- [j5]Kojiro Kobayashi: A Note on Extending Equivalence Theories of Algorithms. Inf. Process. Lett. 3(2): 54-56 (1974)
- 1971
- [j4]Kojiro Kobayashi: Structural Complexity of Context-Free Languages. Information and Control 18(4): 299-310 (1971)
1960 – 1969
- 1969
- [j3]Kojiro Kobayashi: Classification of Formal Languages by Functional Binary Transductions. Information and Control 15(1): 95-109 (1969)
- 1968
- [j2]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
- [j1]Kojiro Kobayashi, Shigeru Sekiguchi: On the Class of Predicates Decidable by Two-Way Multitape Finite Automata. J. ACM 13(2): 236-261 (1966)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:04 CET by the dblp team