![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Yoshihide Igarashi
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c35]Mariko Fujikake Funada, Tadashi Funada, Yoshihide Igarashi:
Dynamic Changes of ERPs in Gestaltzerfall Phenomena: Analysis Using Multi-data Selecting and Averaging Method. HCI (5) 2017: 117-127 - 2015
- [c34]Mariko Fujikake Funada, Tadashi Funada, Yoshihide Igarashi:
Discrimination in Good-Trained Brain States for Brain Computer Interface. HCI (15) 2015: 187-198 - 2013
- [c33]Mariko Fujikake Funada, Yoshihide Igarashi, Tadashi Funada, Miki Shibukawa:
An Effective ERP Model for Brain Computer Interface. HCI (24) 2013: 299-307 - 2011
- [c32]Mariko Fujikake Funada, Yoshihide Igarashi, Tadashi Funada, Miki Shibukawa:
Studies on Imaging Methods to Realize Effective BCI through ERPs. HCI (9) 2011: 228-236
2000 – 2009
- 2009
- [c31]Mariko Fujikake Funada, Miki Shibukawa, Yoshihide Igarashi, Takashi Shimizu, Tadashi Funada, Satoki P. Ninomija:
The Effectiveness of Feedback Control in a HCI System Using Biological Features of Human Beings. HCI (16) 2009: 380-389 - [c30]Miki Shibukawa, Mariko Fujikake Funada, Yoshihide Igarashi, Satoki P. Ninomija:
Fundamental Studies on Effective e-Learning Using Physiology Indices. HCI (10) 2009: 795-804 - 2007
- [c29]Mariko Fujikake Funada, Miki Shibukawa, Tadashi Funada, Satoki P. Ninomija, Yoshihide Igarashi:
Comparison Between Event Related Potentials Obtained by Syllable Recall Tasks and by Associative Recall Tasks. HCI (6) 2007: 838-847 - 2005
- [c28]Mariko Fujikake Funada, Yoshihide Igarashi, T. Funada, Satoki P. Ninomija:
An estimation of homonyms using event related potentials caused by visualizing them in mind. SIP 2005: 347-351 - 2004
- [j28]Masataka Takamura, Yoshihide Igarashi:
Highly Concurrent Group Mutual Exclusion Algorithms Based on Ticket Orders. IEICE Trans. Inf. Syst. 87-D(2): 322-329 (2004) - [j27]Masataka Takamura, Tom Altman, Yoshihide Igarashi:
Speedup of Vidyasankar's algorithm for the group. Inf. Process. Lett. 91(2): 85-91 (2004) - 2003
- [j26]Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
:
Improving the efficiency of parallel minimum spanning tree algorithms. Discret. Appl. Math. 126(1): 33-54 (2003) - [c27]Masataka Takamura, Yoshihide Igarashi:
Group Mutual Exclusion Algorithms Based on Ticket Orders. COCOON 2003: 232-241 - [c26]Tom Altman, Yoshihide Igarashi, Michiko Omori:
A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model. ISAAC 2003: 454-463 - 2002
- [c25]Masataka Takamura, Yoshihide Igarashi:
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model. COCOON 2002: 259-268 - [c24]Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi:
Fast and Dependable Communication in Hyper-rings. COCOON 2002: 350-359 - 2001
- [c23]Kumiko Obokata, Michiko Omori, Kazuhiro Motegi, Yoshihide Igarashi:
A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem. COCOON 2001: 571-575 - 2000
- [c22]Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi:
Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures. ISAAC 2000: 290-301
1990 – 1999
- 1999
- [j25]Yijie Han, Yoshihide Igarashi:
Parallel PROFIT/COST Algorithms Through Fast Derandomization. Acta Informatica 36(3): 215-232 (1999) - [j24]Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi:
Independent Spanning Trees of Chordal Rings. Inf. Process. Lett. 69(3): 155-160 (1999) - [j23]Yoshihide Igarashi, Yasuaki Nishitani:
Speedup of the n-Process Mutual Exclusion Algorithm. Parallel Process. Lett. 9(4): 475-485 (1999) - [c21]Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
:
Improving Parallel Computation with Fast Integer Sorting. COCOON 1999: 452-461 - [c20]Yoshihide Igarashi, Yasuaki Nishitani:
Speedup of Lockout-Free Mutual Exclusion Algorithms. ISPAN 1999: 172-177 - 1998
- [j22]Feng Bao, Yoshihide Igarashi, Sabine R. Öhring:
Reliable broadcasting in product networks. Discret. Appl. Math. 83(1-3): 3-20 (1998) - 1997
- [j21]Feng Bao, Aohan Mei, Yoshihide Igarashi:
Average Competitive Ratios of On-Line Spanning Trees. Inf. Process. Lett. 62(4): 213-216 (1997) - [c19]Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi:
Independent Spanning Trees of Chordal Rings. COCOON 1997: 431-440 - [c18]Feng Bao, Yutaka Funyu, Yukihiro Hamada, Yoshihide Igarashi:
Reliable broadcasting and secure distributing in channel networks. ISPAN 1997: 472-478 - [c17]Feng Bao, Robert H. Deng
, Xiang Gao, Yoshihide Igarashi:
Modified Finite Automata Public Key Cryptosystem. ISW 1997: 82-95 - 1996
- [j20]Koji Obokata, Yasuaki Nishitani, Yoshihide Igarashi:
A Probably Optimal Embedding of Hyper-Rings in Hypercubes. Inf. Process. Lett. 58(3): 117-122 (1996) - [c16]Yukihiro Hamada, Aohan Mei, Feng Bao, Yoshihide Igarashi:
Broadcasting in Star Graphs with Byzantine Failures. ASIAN 1996: 162-171 - [c15]Feng Bao, Yoshihide Igarashi:
Reliable Broadcasting in Product Networks with Byzantine Faults. FTCS 1996: 262-271 - [c14]Aohan Mei, Yoshihide Igarashi, Naoki Shimizu:
Efficient Broadcasting on Faulty Star Networks. FTRTFT 1996: 298-305 - [c13]Yukihiro Hamada, Feng Bao, Aohan Mei, Yoshihide Igarashi:
Fault-tolerant File Transmission by Information Dispersal Algorithm in Rotator Graphs. ICDCS 1996: 19-25 - [c12]Aohan Mei, Feng Bao, Yukihiro Hamada, Yoshihide Igarashi:
Optimal Time Broadcasting in Faulty Star Networks. WDAG 1996: 175-190 - [c11]Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi:
Independent Spanning Trees of Product Graphs. WG 1996: 338-351 - [e1]Tetsuo Asano, Yoshihide Igarashi, Hiroshi Nagamochi, Satoru Miyano, Subhash Suri:
Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings. Lecture Notes in Computer Science 1178, Springer 1996, ISBN 3-540-62048-6 [contents] - 1995
- [j19]Tom Altman, Yoshihide Igarashi, Koji Obokata:
Hyper-Ring Connection Machines. Parallel Comput. 21(8): 1327-1338 (1995) - [c10]Feng Bao, Yoshihide Igarashi:
Break Finite Automata Public Key Cryptosystem. ICALP 1995: 147-158 - [c9]Yukihiro Hamada, Aohan Mei, Yasuaki Nishitani, Yoshihide Igarashi:
Embeddings of Hyper-Rings in Hypercubes. ISAAC 1995: 312-321 - [c8]Feng Bao, Yoshihide Igarashi, Keiko Katano:
Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults. WDAG 1995: 215-229 - 1994
- [j18]Yoshihide Igarashi, Shingo Osawa, Walter Unger:
Automorphisms of Broadcasting Schemes with Respect to Start Rounds. Inf. Process. Lett. 51(1): 35-41 (1994) - [j17]Aohan Mei, Yoshihide Igarashi:
An Efficient Strategy for Robot Navigation in Unknown Environment. Inf. Process. Lett. 52(1): 51-56 (1994) - [j16]Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura:
Broadcasting in Faulty Binary Jumping Networks. J. Parallel Distributed Comput. 23(3): 462-467 (1994) - [c7]Aohan Mei, Yoshihide Igarashi:
Efficient Strategies for Robot Navigation in Unknown Environment. ICALP 1994: 630-641 - [c6]Feng Bao, Yoshihide Igarashi:
A Randomized Algorithm to Finite Automata Public Key Cryptosystem. ISAAC 1994: 678-686 - [c5]Aohan Mei, Yoshihide Igarashi:
A shortest path algorithm for banded matrices by a mesh connection without processor penalty. ISPAN 1994: 159-166 - 1993
- [c4]Yijie Han, Yoshihide Igarashi:
Efficient Parallel Shortest Path Algorithms for Banded Matrices. ICPP (3) 1993: 223-226 - 1992
- [j15]Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski:
Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discret. Appl. Math. 36(2): 141-152 (1992) - [j14]Yoshihide Igarashi, Shingo Osawa, Yukio Shibata:
Some language families generated by one-letter languages. Inf. Sci. 62(3): 271-276 (1992) - [c3]Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura:
Fault-Tolerant Broadcasting in Binary Jumping Networks. ISAAC 1992: 145-154 - 1991
- [j13]Yumi Fukushima, Yoshihide Igarashi:
Efficient algorithms for realizing a layout of complete binary trees. Syst. Comput. Jpn. 22(13): 1-9 (1991) - 1990
- [j12]Yijie Han, Yoshihide Igarashi:
Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. Inf. Process. Lett. 33(5): 233-238 (1990) - [c2]Yijie Han, Yoshihide Igarashi:
Derandomization by Exploiting Redundancy and Mutual Independence. SIGAL International Symposium on Algorithms 1990: 328-337
1980 – 1989
- 1989
- [j11]Yijie Han, Yoshihide Igarashi:
Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. Acta Informatica 26(7): 643-655 (1989) - 1988
- [c1]Yijie Han, Yoshihide Igarashi:
Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. AWOC 1988: 434-443 - 1987
- [j10]Kazuhiro Sado, Yoshihide Igarashi:
A Function for Evaluating the Computing Time of a Bubbling System. Theor. Comput. Sci. 54: 315-324 (1987) - 1986
- [j9]Kazuhiro Sado, Yoshihide Igarashi:
Some Parallel Sorts on a Mesh-Connected Processor Array and Their Time Efficiency. J. Parallel Distributed Comput. 3(3): 398-410 (1986) - 1985
- [j8]Yoshihide Igarashi:
A Pumping Lemma for Real-Time Deterministic Context-Free Languages. Theor. Comput. Sci. 36: 89-97 (1985) - 1984
- [j7]Frank M. Brown, Yoshihide Igarashi:
On permutations of wires and states. Discret. Appl. Math. 7(3): 231-241 (1984)
1970 – 1979
- 1978
- [j6]Yoshihide Igarashi:
Tape Bounds for Some Subclasses of Deterministic Context-Free Languages. Inf. Control. 37(3): 321-333 (1978) - 1977
- [j5]Yoshihide Igarashi:
General Properties of Derivational Complexity. Acta Informatica 8: 267-283 (1977) - [j4]Yoshihide Igarashi:
The Tape Complexity of Some Classes of Szilard Languages. SIAM J. Comput. 6(3): 460-466 (1977) - 1975
- [j3]Yoshihide Igarashi, Namio Honda:
Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 11(3): 397 (1975) - 1974
- [j2]Yoshihide Igarashi, Namio Honda:
Deterministic Multitape Automata Computations. J. Comput. Syst. Sci. 8(2): 167-189 (1974) - 1973
- [j1]Yoshihide Igarashi, Namio Honda:
On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 7(2): 199-217 (1973)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint