# Yoshihide Igarashi

According to our database

^{1}, Yoshihide Igarashi## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2015

Discrimination in Good-Trained Brain States for Brain Computer Interface.

Proceedings of the Foundations of Augmented Cognition, 2015

2013

An Effective ERP Model for Brain Computer Interface.

Proceedings of the Foundations of Augmented Cognition, 2013

2011

Studies on Imaging Methods to Realize Effective BCI through ERPs.

Proceedings of the Design, User Experience, and Usability. Theory, Methods, Tools and Practice, 2011

2009

Fundamental Studies on Effective e-Learning Using Physiology Indices.

Proceedings of the Human Centered Design, 2009

The Effectiveness of Feedback Control in a HCI System Using Biological Features of Human Beings.

Proceedings of the Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience, 2009

2007

Comparison Between Event Related Potentials Obtained by Syllable Recall Tasks and by Associative Recall Tasks.

Proceedings of the Universal Access in Human-Computer Interaction. Ambient Interaction, 2007

2005

An estimation of homonyms using event related potentials caused by visualizing them in mind.

Proceedings of the Signal and Image Processing (SIP 2005), 2005

2004

Speedup of Vidyasankar's algorithm for the group.

Inf. Process. Lett., 2004

Highly Concurrent Group Mutual Exclusion Algorithms Based on Ticket Orders.

IEICE Transactions, 2004

2003

Improving the efficiency of parallel minimum spanning tree algorithms.

Discrete Applied Mathematics, 2003

A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model.

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Group Mutual Exclusion Algorithms Based on Ticket Orders.

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model.

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Fast and Dependable Communication in Hyper-rings.

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem.

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000

Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures.

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999

Speedup of the n-Process Mutual Exclusion Algorithm.

Parallel Processing Letters, 1999

Independent Spanning Trees of Chordal Rings.

Inf. Process. Lett., 1999

Parallel PROFIT/COST Algorithms Through Fast Derandomization.

Acta Inf., 1999

Speedup of Lockout-Free Mutual Exclusion Algorithms.

Proceedings of the 1999 International Symposium on Parallel Architectures, 1999

Improving Parallel Computation with Fast Integer Sorting.

Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999

1998

Reliable broadcasting in product networks.

Discrete Applied Mathematics, 1998

1997

Average Competitive Ratios of On-Line Spanning Trees.

Inf. Process. Lett., 1997

Modified Finite Automata Public Key Cryptosystem.

Proceedings of the Information Security, First International Workshop, 1997

Reliable broadcasting and secure distributing in channel networks.

Proceedings of the 1997 International Symposium on Parallel Architectures, 1997

Independent Spanning Trees of Chordal Rings.

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

A Probably Optimal Embedding of Hyper-Rings in Hypercubes.

Inf. Process. Lett., 1996

Independent Spanning Trees of Product Graphs.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Optimal Time Broadcasting in Faulty Star Networks.

Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Fault-tolerant File Transmission by Information Dispersal Algorithm in Rotator Graphs.

Proceedings of the 16th International Conference on Distributed Computing Systems, 1996

Efficient Broadcasting on Faulty Star Networks.

Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

Reliable Broadcasting in Product Networks with Byzantine Faults.

Proceedings of the Digest of Papers: FTCS-26, 1996

Broadcasting in Star Graphs with Byzantine Failures.

Proceedings of the Concurrency and Parallelism, 1996

1995

Hyper-Ring Connection Machines.

Parallel Computing, 1995

Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults.

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Embeddings of Hyper-Rings in Hypercubes.

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Break Finite Automata Public Key Cryptosystem.

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

Broadcasting in Faulty Binary Jumping Networks.

J. Parallel Distrib. Comput., 1994

An Efficient Strategy for Robot Navigation in Unknown Environment.

Inf. Process. Lett., 1994

Automorphisms of Broadcasting Schemes with Respect to Start Rounds.

Inf. Process. Lett., 1994

A shortest path algorithm for banded matrices by a mesh connection without processor penalty.

Proceedings of the International Symposium on Parallel Architectures, 1994

A Randomized Algorithm to Finite Automata Public Key Cryptosystem.

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Efficient Strategies for Robot Navigation in Unknown Environment.

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Efficient Parallel Shortest Path Algorithms for Banded Matrices.

Proceedings of the 1993 International Conference on Parallel Processing, 1993

1992

Some language families generated by one-letter languages.

Inf. Sci., 1992

Indexing functions and time lower bounds for sorting on a mesh-connected computer.

Discrete Applied Mathematics, 1992

Fault-Tolerant Broadcasting in Binary Jumping Networks.

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Efficient algorithms for realizing a layout of complete binary trees.

Systems and Computers in Japan, 1991

1990

Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays.

Inf. Process. Lett., 1990

Derandomization by Exploiting Redundancy and Mutual Independence.

Proceedings of the Algorithms, 1990

1989

Time Lower Bounds for Parallel Sorting on a Mesh-Conected Processor Array.

Acta Inf., 1989

1988

Time Lower Bounds for Parallel Sorting on a Mesh-Connected Processor Array.

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

A Function for Evaluating the Computing Time of a Bubbling System.

Theor. Comput. Sci., 1987

1986

Some Parallel Sorts on a Mesh-Connected Processor Array and Their Time Efficiency.

J. Parallel Distrib. Comput., 1986

1985

A Pumping Lemma for Real-Time Deterministic Context-Free Languages.

Theor. Comput. Sci., 1985

1984

On permutations of wires and states.

Discrete Applied Mathematics, 1984

1978

Tape Bounds for Some Subclasses of Deterministic Context-Free Languages

Information and Control, June, 1978

1977

The Tape Complexity of Some Classes of Szilard Languages.

SIAM J. Comput., 1977

General Properties of Derivational Complexity.

Acta Inf., 1977

1975

Erratum: On the Extension of Gladkij's Theorem and the Hierarchies of Languages.

J. Comput. Syst. Sci., 1975

1974

Deterministic Multitape Automata Computations.

J. Comput. Syst. Sci., 1974

1973

On the Extension of Gladkij's Theorem and the Hierarchies of Languages.

J. Comput. Syst. Sci., 1973