Kojiro Kobayashi

32 papers A 1B 3C 1Journal 24Unranked 3
YearRankTypeTitle / Venue / Authors
2019 J jnl
Minimum firing times of firing squad synchronization problems for paths in grid spaces.
CoRR
Kojiro Kobayashi
2019 J jnl
Nonexistence of Minimal-time Solutions for Some Variations of the Firing Squad Synchronization Problem having Simple Geometric Configurations.
J. Cell. Autom.
Kojiro Kobayashi
2019 J jnl
Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations.
CoRR
Kojiro Kobayashi
2019 J jnl
The firing squad synchronization problem for squares with holes.
CoRR
Kojiro Kobayashi
2015 — conf
Evaluation on mechanical impact parameters in piezoelectric power generation.
ASCC
Amat A. Basari, Sosuke Awaji, Shintaro Sakamoto, Seiji Hashimoto, Bunji Homma, Kenji Suto, Hiroaki Okada, Hideki Okuno, Kojiro Kobayashi, Shunji Kumagai
2014 J jnl
The minimum firing time of the generalized firing squad synchronization problem for squares.
Theor. Comput. Sci.
Kojiro Kobayashi
2012 J jnl
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks.
SIAM J. Comput.
Darin Goldstein, Kojiro Kobayashi
2011 J jnl
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation.
Inf. Process. Lett.
Takashi Saso, Kojiro Kobayashi, Atsuyoshi Nakamura
2007 B conf
On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem.
ISAAC
Darin Goldstein, Kojiro Kobayashi
2006 A conf
On the Complexity of the "Most General" Firing Squad Synchronization Problem.
STACS
Darin Goldstein, Kojiro Kobayashi
2005 C conf
On Formulations of Firing Squad Synchronization Problems.
UC
Kojiro Kobayashi, Darin Goldstein
2005 J jnl
On the Complexity of Network Synchronization.
SIAM J. Comput.
Darin Goldstein, Kojiro Kobayashi
2004 B conf
On the Complexity of Network Synchronization.
ISAAC
Darin Goldstein, Kojiro Kobayashi
2001 J jnl
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths.
Theor. Comput. Sci.
Kojiro Kobayashi
1997 J jnl
The Kolmogorov complexity, universal distribution, and coding theorem for generalized length functions.
IEEE Trans. Inf. Theory
Kojiro Kobayashi
1997 J jnl
Transformations that Preserve Malignness of Universal Distributions.
Theor. Comput. Sci.
Kojiro Kobayashi
1994 — conf
On Coding Theorems with Modified Length Functions.
Logic, Language and Computation
Kojiro Kobayashi
1993 J jnl
Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness.
Inf. Process. Lett.
Kojiro Kobayashi
1992 B conf
On Malign Input Distributions for Algorithms.
ISAAC
Kojiro Kobayashi
1986 J jnl
Characterization of omega-Regular Languages by Monadic Second-Order Formulas.
Theor. Comput. Sci.
Hideki Yamasaki, Masako Takahashi, Kojiro Kobayashi
1985 J jnl
On Proving Time Constructibility of Functions.
Theor. Comput. Sci.
Kojiro Kobayashi
1985 J jnl
On the structure of one-tape nondeterministic turing machine time hierarchy.
Theor. Comput. Sci.
Kojiro Kobayashi
1984 J jnl
Characterization of omega-Regular Languages by First-Order Formulas.
Theor. Comput. Sci.
Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki
1984 — conf
Logical formulas and four subclasses of omega-regular languages.
Automata on Infinite Words
Kojiro Kobayashi, Masako Takahashi, Hideki Yamasaki
1978 J jnl
On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks.
Theor. Comput. Sci.
Kojiro Kobayashi
1978 J jnl
The Firing Squad Synchronization Problem for a Class of Polyautomata Networks.
J. Comput. Syst. Sci.
Kojiro Kobayashi
1977 J jnl
The Firing Squad Synchronization Problem for Two-Dimensional Arrays
Inf. Control.
Kojiro Kobayashi
1974 J jnl
A Note on Extending Equivalence Theories of Algorithms.
Inf. Process. Lett.
Kojiro Kobayashi
1971 J jnl
Structural Complexity of Context-Free Languages
Inf. Control.
Kojiro Kobayashi
1969 J jnl
Classification of Formal Languages by Functional Binary Transductions
Inf. Control.
Kojiro Kobayashi
1968 J jnl
Some Unsolvable Problems on Context-Free Languages and Their Application to On-Line Language Recognizers
Inf. Control.
Kojiro Kobayashi
1966 J jnl
On the Class of Predicates Decidable by Two-Way Multitape Finite Automata.
J. ACM
Kojiro Kobayashi, Shigeru Sekiguchi