Kojiro Kobayashi

According to our database1, Kojiro Kobayashi authored at least 30 papers between 1966 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Nonexistence of Minimal-time Solutions for Some Variations of the Firing Squad Synchronization Problem having Simple Geometric Configurations.
J. Cell. Autom., 2019

The firing squad synchronization problem for squares with holes.
CoRR, 2019

Minimum firing times of firing squad synchronization problems for paths in grid spaces.
CoRR, 2019

2015
Evaluation on mechanical impact parameters in piezoelectric power generation.
Proceedings of the 10th Asian Control Conference, 2015

2014
The minimum firing time of the generalized firing squad synchronization problem for squares.
Theor. Comput. Sci., 2014

2012
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks.
SIAM J. Comput., 2012

2011
On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation.
Inf. Process. Lett., 2011

2007
On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
On the Complexity of the "Most General" Firing Squad Synchronization Problem.
Proceedings of the STACS 2006, 2006

2005
On the Complexity of Network Synchronization.
SIAM J. Comput., 2005

On Formulations of Firing Squad Synchronization Problems.
Proceedings of the Unconventional Computation, 4th International Conference, 2005

2001
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths.
Theor. Comput. Sci., 2001

1997
The Kolmogorov complexity, universal distribution, and coding theorem for generalized length functions.
IEEE Trans. Inf. Theory, 1997

Transformations that Preserve Malignness of Universal Distributions.
Theor. Comput. Sci., 1997

1994
On Coding Theorems with Modified Length Functions.
Proceedings of the Logic, 1994

1993
Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness.
Inf. Process. Lett., 1993

1992
On Malign Input Distributions for Algorithms.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1986
Characterization of omega-Regular Languages by Monadic Second-Order Formulas.
Theor. Comput. Sci., 1986

1985
On the structure of one-tape nondeterministic turing machine time hierarchy.
Theor. Comput. Sci., 1985

On Proving Time Constructibility of Functions.
Theor. Comput. Sci., 1985

1984
Characterization of omega-Regular Languages by First-Order Formulas.
Theor. Comput. Sci., 1984

Logical formulas and four subclasses of omega-regular languages.
Proceedings of the Automata on Infinite Words, 1984

1978
On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks.
Theor. Comput. Sci., 1978

The Firing Squad Synchronization Problem for a Class of Polyautomata Networks.
J. Comput. Syst. Sci., 1978

1977
The Firing Squad Synchronization Problem for Two-Dimensional Arrays
Inf. Control., July, 1977

1974
A Note on Extending Equivalence Theories of Algorithms.
Inf. Process. Lett., 1974

1971
Structural Complexity of Context-Free Languages
Inf. Control., May, 1971

1969
Classification of Formal Languages by Functional Binary Transductions
Inf. Control., July, 1969

1968
Some Unsolvable Problems on Context-Free Languages and Their Application to On-Line Language Recognizers
Inf. Control., September, 1968

1966
On the Class of Predicates Decidable by Two-Way Multitape Finite Automata.
J. ACM, 1966


  Loading...