default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKojiro Kobayashi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j21]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): 351-396 (2019)- [i3]Kojiro Kobayashi:
Minimum firing times of firing squad synchronization problems for paths in grid spaces. CoRR abs/1909.05406 (2019) - [i2]Kojiro Kobayashi:
The firing squad synchronization problem for squares with holes. CoRR abs/1909.05408 (2019) - [i1]Kojiro Kobayashi:
Nonexistence of minimal-time solutions for some variations of the firing squad synchronization problem having simple geometric configurations. CoRR abs/1909.10125 (2019) - 2015
- [c8]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: 1-6 - 2014
- [j20]Kojiro Kobayashi:
The minimum firing time of the generalized firing squad synchronization problem for squares. Theor. Comput. Sci. 547: 46-69 (2014) - 2012
- [j19]Darin Goldstein, Kojiro Kobayashi:
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks. SIAM J. Comput. 41(3): 618-669 (2012) - 2011
- [j18]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
- [j17]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
- [j16]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
- [j15]Kojiro Kobayashi:
Transformations that Preserve Malignness of Universal Distributions. Theor. Comput. Sci. 181(2): 289-306 (1997) - [j14]Kojiro Kobayashi:
The Kolmogorov complexity, universal distribution, and coding theorem for generalized length functions. IEEE Trans. Inf. 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
- [j13]Kojiro Kobayashi:
Sigma^0_n-Complete Properties of Programs and Martin-Löf Randomness. Inf. Process. Lett. 46(1): 37-42 (1993) - 1992
- [c2]Kojiro Kobayashi:
On Malign Input Distributions for Algorithms. ISAAC 1992: 239-248
1980 – 1989
- 1986
- [j12]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
- [j11]Kojiro Kobayashi:
On Proving Time Constructibility of Functions. Theor. Comput. Sci. 35: 215-225 (1985) - [j10]Kojiro Kobayashi:
On the structure of one-tape nondeterministic turing machine time hierarchy. Theor. Comput. Sci. 40: 175-193 (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. Inf. 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. Inf. Control. 18(4): 299-310 (1971)
1960 – 1969
- 1969
- [j3]Kojiro Kobayashi:
Classification of Formal Languages by Functional Binary Transductions. Inf. 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. Inf. 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)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
