Kojiro Kobayashi

Publication Activity (10 Years)

Years Active: 1966-2019
Publications (10 Years): 5

Top Topics

Partial Solutions

Polynomial Equations

Hough Transform

Firing Squad Synchronization

Top Venues

J. Cell. Autom.

Theor. Comput. Sci.

Publications

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