Yoshihide Igarashi

Publication Activity (10 Years)

Years Active: 1973-2017
Publications (10 Years): 2

Top Topics

Brain Computer Interface

Statistical Significance

Top Venues

Publications

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)
Mariko Fujikake Funada, Tadashi Funada, Yoshihide Igarashi
Discrimination in Good-Trained Brain States for Brain Computer Interface. HCI (15) (2015)
Mariko Fujikake Funada, Yoshihide Igarashi, Tadashi Funada, Miki Shibukawa
An Effective ERP Model for Brain Computer Interface. HCI (24) (2013)
Mariko Fujikake Funada, Yoshihide Igarashi, Tadashi Funada, Miki Shibukawa
Studies on Imaging Methods to Realize Effective BCI through ERPs. HCI (9) (2011)
Miki Shibukawa, Mariko Fujikake Funada, Yoshihide Igarashi, Satoki P. Ninomija
Fundamental Studies on Effective e-Learning Using Physiology Indices. HCI (10) (2009)
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)
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)
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)
Masataka Takamura, Yoshihide Igarashi
Highly Concurrent Group Mutual Exclusion Algorithms Based on Ticket Orders. IEICE Trans. Inf. Syst. (2) (2004)
Masataka Takamura, Tom Altman, Yoshihide Igarashi
Speedup of Vidyasankar's algorithm for the group. Inf. Process. Lett. 91 (2) (2004)
Masataka Takamura, Yoshihide Igarashi
Group Mutual Exclusion Algorithms Based on Ticket Orders. COCOON (2003)
Tom Altman, Yoshihide Igarashi, Michiko Omori
A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model. ISAAC (2003)
Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
Improving the efficiency of parallel minimum spanning tree algorithms. Discret. Appl. Math. 126 (1) (2003)
Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi
Fast and Dependable Communication in Hyper-rings. COCOON (2002)
Masataka Takamura, Yoshihide Igarashi
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model. COCOON (2002)
Kumiko Obokata, Michiko Omori, Kazuhiro Motegi, Yoshihide Igarashi
A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem. COCOON (2001)
Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi, Yoshihide Igarashi
Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures. ISAAC (2000)
Yoshihide Igarashi, Yasuaki Nishitani
Speedup of Lockout-Free Mutual Exclusion Algorithms. ISPAN (1999)
Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi
Independent Spanning Trees of Chordal Rings. Inf. Process. Lett. 69 (3) (1999)
Yijie Han, Yoshihide Igarashi
Parallel PROFIT/COST Algorithms Through Fast Derandomization. Acta Informatica 36 (3) (1999)
Ka Wong Chong, Yijie Han, Yoshihide Igarashi, Tak Wah Lam
Improving Parallel Computation with Fast Integer Sorting. COCOON (1999)
Yoshihide Igarashi, Yasuaki Nishitani
Speedup of the n-Process Mutual Exclusion Algorithm. Parallel Process. Lett. 9 (4) (1999)
Feng Bao, Yoshihide Igarashi, Sabine R. Öhring
Reliable broadcasting in product networks. Discret. Appl. Math. 83 (1-3) (1998)
Yukihiro Iwasaki, Yuka Kajiwara, Koji Obokata, Yoshihide Igarashi
Independent Spanning Trees of Chordal Rings. COCOON (1997)
Feng Bao, Aohan Mei, Yoshihide Igarashi
Average Competitive Ratios of On-Line Spanning Trees. Inf. Process. Lett. 62 (4) (1997)
Feng Bao, Robert H. Deng, Xiang Gao, Yoshihide Igarashi
Modified Finite Automata Public Key Cryptosystem. ISW (1997)
Feng Bao, Yutaka Funyu, Yukihiro Hamada, Yoshihide Igarashi
Reliable broadcasting and secure distributing in channel networks. ISPAN (1997)
Yukihiro Hamada, Aohan Mei, Feng Bao, Yoshihide Igarashi
Broadcasting in Star Graphs with Byzantine Failures. ASIAN (1996)
Yukihiro Hamada, Feng Bao, Aohan Mei, Yoshihide Igarashi
Fault-tolerant File Transmission by Information Dispersal Algorithm in Rotator Graphs. ICDCS (1996)
Koji Obokata, Yasuaki Nishitani, Yoshihide Igarashi
A Probably Optimal Embedding of Hyper-Rings in Hypercubes. Inf. Process. Lett. 58 (3) (1996)
Aohan Mei, Yoshihide Igarashi, Naoki Shimizu
Efficient Broadcasting on Faulty Star Networks. FTRTFT (1996)
Koji Obokata, Yukihiro Iwasaki, Feng Bao, Yoshihide Igarashi
Independent Spanning Trees of Product Graphs. WG (1996)
Feng Bao, Yoshihide Igarashi
Reliable Broadcasting in Product Networks with Byzantine Faults. FTCS (1996)
Aohan Mei, Feng Bao, Yukihiro Hamada, Yoshihide Igarashi
Optimal Time Broadcasting in Faulty Star Networks. WDAG (1996)
Yukihiro Hamada, Aohan Mei, Yasuaki Nishitani, Yoshihide Igarashi
Embeddings of Hyper-Rings in Hypercubes. ISAAC (1995)
Feng Bao, Yoshihide Igarashi, Keiko Katano
Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults. WDAG (1995)
Feng Bao, Yoshihide Igarashi
Break Finite Automata Public Key Cryptosystem. ICALP (1995)
Tom Altman, Yoshihide Igarashi, Koji Obokata
Hyper-Ring Connection Machines. Parallel Comput. 21 (8) (1995)
Yoshihide Igarashi, Shingo Osawa, Walter Unger
Automorphisms of Broadcasting Schemes with Respect to Start Rounds. Inf. Process. Lett. 51 (1) (1994)
Aohan Mei, Yoshihide Igarashi
An Efficient Strategy for Robot Navigation in Unknown Environment. Inf. Process. Lett. 52 (1) (1994)
Aohan Mei, Yoshihide Igarashi
Efficient Strategies for Robot Navigation in Unknown Environment. ICALP (1994)
Feng Bao, Yoshihide Igarashi
A Randomized Algorithm to Finite Automata Public Key Cryptosystem. ISAAC (1994)
Aohan Mei, Yoshihide Igarashi
A shortest path algorithm for banded matrices by a mesh connection without processor penalty. ISPAN (1994)
Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura
Broadcasting in Faulty Binary Jumping Networks. J. Parallel Distributed Comput. 23 (3) (1994)
Yijie Han, Yoshihide Igarashi
Efficient Parallel Shortest Path Algorithms for Banded Matrices. ICPP (3) (1993)
Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura
Fault-Tolerant Broadcasting in Binary Jumping Networks. ISAAC (1992)
Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski
Indexing functions and time lower bounds for sorting on a mesh-connected computer. Discret. Appl. Math. 36 (2) (1992)
Yoshihide Igarashi, Shingo Osawa, Yukio Shibata
Some language families generated by one-letter languages. Inf. Sci. 62 (3) (1992)
Yumi Fukushima, Yoshihide Igarashi
Efficient algorithms for realizing a layout of complete binary trees. Systems and Computers in Japan 22 (13) (1991)
Yijie Han, Yoshihide Igarashi
Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays. Inf. Process. Lett. 33 (5) (1990)
Yijie Han, Yoshihide Igarashi
Derandomization by Exploiting Redundancy and Mutual Independence. SIGAL International Symposium on Algorithms (1990)
Yijie Han, Yoshihide Igarashi
Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array. Acta Informatica 26 (7) (1989)
Yijie Han, Yoshihide Igarashi
Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array. AWOC (1988)
Kazuhiro Sado, Yoshihide Igarashi
A Function for Evaluating the Computing Time of a Bubbling System. Theor. Comput. Sci. 54 (1987)
Kazuhiro Sado, Yoshihide Igarashi
Some Parallel Sorts on a Mesh-Connected Processor Array and Their Time Efficiency. J. Parallel Distributed Comput. 3 (3) (1986)
Yoshihide Igarashi
A Pumping Lemma for Real-Time Deterministic Context-Free Languages. Theor. Comput. Sci. 36 (1985)
Frank M. Brown, Yoshihide Igarashi
On permutations of wires and states. Discret. Appl. Math. 7 (3) (1984)
Yoshihide Igarashi
Tape Bounds for Some Subclasses of Deterministic Context-Free Languages Inf. Control. 37 (3) (1978)
Yoshihide Igarashi
General Properties of Derivational Complexity. Acta Informatica 8 (1977)
Yoshihide Igarashi
The Tape Complexity of Some Classes of Szilard Languages. SIAM J. Comput. 6 (3) (1977)
Yoshihide Igarashi, Namio Honda
Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 11 (3) (1975)
Yoshihide Igarashi, Namio Honda
Deterministic Multitape Automata Computations. J. Comput. Syst. Sci. 8 (2) (1974)
Yoshihide Igarashi, Namio Honda
On the Extension of Gladkij's Theorem and the Hierarchies of Languages. J. Comput. Syst. Sci. 7 (2) (1973)